Publication:3803024
From MaRDI portal
zbMath0655.94006MaRDI QIDQ3803024
No author found.
Publication date: 1988
algebraic codingGoppa codecryptanalytic algorithmslinear error correcting codescryptanalytic attackMcEliece's public-key cryptosystemprobabilistic decoding algorithms
Related Items
Structural cryptanalysis of McEliece schemes with compact keys, Construction of binary Hadamard codes and their \(s\)-PD sets, 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, Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory, Severely denting the Gabidulin version of the McEliece public key cryptosystem, Structural properties of self-dual monomial codes with application to code-based cryptography, Generalization of the Ball-Collision Algorithm, A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory, Information-set decoding with hints, Syndrome Decoding Estimator, Punctured syndrome decoding problem. Efficient side-channel attacks against \textit{Classic McEliece}, On the hardness of the Lee syndrome decoding problem, S-semantics -- an example, Solving the learning parity with noise problem using quantum algorithms, A code-based signature scheme from the Lyubashevsky framework, 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, Improved information set decoding algorithms over Galois ring in the Lee metric, Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes, Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems, Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation, A new algorithm for finding minimum-weight words in large linear codes, On the dimension and structure of the square of the dual of a Goppa code, Computational aspects of retrieving a representation of an algebraic geometry code, Code-Based Cryptosystems Using Generalized Concatenated Codes, Computational fuzzy extractors, Attacking and Defending the McEliece Cryptosystem, A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes, Susceptibility of digital signature schemes based on error-correcting codes to universal forgery, Faster 2-Regular Information-Set Decoding, Really Fast Syndrome-Based Hashing, Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity, 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$$, Encryption scheme based on expanded Reed-Solomon codes, A Secure and Efficient Code-Based Signature Scheme, Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem, Reducing Key Length of the McEliece Cryptosystem, Decoding One Out of Many, Cryptanalysis of LEDAcrypt, On the design and security of Lee metric McEliece cryptosystems
Uses Software
