Publication:3803024
From MaRDI portal
zbMath0655.94006MaRDI QIDQ3803024
No author found.
Publication date: 1988
algebraic coding; Goppa code; cryptanalytic algorithms; linear error correcting codes; cryptanalytic attack; McEliece's public-key cryptosystem; probabilistic decoding algorithms
Related Items
A new algorithm for finding minimum-weight words in large linear codes, Code-Based Cryptosystems Using Generalized Concatenated Codes, Susceptibility of digital signature schemes based on error-correcting codes to universal forgery, Syndrome Decoding Estimator, A Secure and Efficient Code-Based Signature Scheme, TinyKeys: a new approach to efficient multi-party computation, Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$, Generalization of the Ball-Collision Algorithm, Punctured syndrome decoding problem. Efficient side-channel attacks against \textit{Classic McEliece}, S-semantics -- an example, Solving the learning parity with noise problem using quantum algorithms, Hybrid decoding -- classical-quantum trade-offs for information set decoding, An algorithm for generalized syndrome decoding problem, Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems, Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems, Structural cryptanalysis of McEliece schemes with compact keys, Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity, Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes, Information set decoding in the Lee metric with applications to cryptography, Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\), Two attacks on rank metric code-based schemes: RankSign and an IBE scheme, Severely denting the Gabidulin version of the McEliece public key cryptosystem, Encryption scheme based on expanded Reed-Solomon codes, Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem, Cryptanalysis of LEDAcrypt, On the design and security of Lee metric McEliece cryptosystems, Construction of binary Hadamard codes and their \(s\)-PD sets, Structural properties of self-dual monomial codes with application to code-based cryptography, Information-set decoding with hints, A code-based signature scheme from the Lyubashevsky framework, Computational fuzzy extractors, Computational aspects of retrieving a representation of an algebraic geometry code, Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation, On the dimension and structure of the square of the dual of a Goppa code, Faster 2-Regular Information-Set Decoding, Really Fast Syndrome-Based Hashing, Decoding One Out of Many, A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory, Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory, Attacking and Defending the McEliece Cryptosystem, A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes, Reducing Key Length of the McEliece Cryptosystem
Uses Software
