On new problems in asymmetric cryptography based on error-resistant coding (Q6173457): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114846599, #quickstatements; #temporary_batch_1714786519576
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A digital signature scheme based on random error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic informatics. 5th international conference, CAI 2013, Porquerolles, France, September 3--6, 2013. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing Key Length of the McEliece Cryptosystem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Cryptanalysis of McEliece Variants with Compact Keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inherent intractability of certain coding problems (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the edge-independence number and edge-covering number for regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attacking and Defending the McEliece Cryptosystem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:04, 1 August 2024

scientific article; zbMATH DE number 7715381
Language Label Description Also known as
English
On new problems in asymmetric cryptography based on error-resistant coding
scientific article; zbMATH DE number 7715381

    Statements

    On new problems in asymmetric cryptography based on error-resistant coding (English)
    0 references
    0 references
    0 references
    0 references
    21 July 2023
    0 references
    McEliece cryptosystem
    0 references
    information-set decoding
    0 references
    generalized Reed-Solomon code
    0 references
    post-quantum cryptography
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references