A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
From MaRDI portal
Publication:4392472
DOI10.1109/18.651067zbMath1053.94558OpenAlexW2099250555MaRDI QIDQ4392472
Anne Canteaut, Florent Chabaud
Publication date: 10 August 1998
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c4422301c7ea8d83b5e4ecb734b09ced855f87cd
Related Items (52)
Structural cryptanalysis of McEliece schemes with compact keys ⋮ Information set decoding in the Lee metric with applications to cryptography ⋮ A Summary of McEliece-Type Cryptosystems and their Security ⋮ New Variant of the McEliece Cryptosystem ⋮ Structural properties of self-dual monomial codes with application to code-based cryptography ⋮ Basics of Secrecy Coding ⋮ A new approach for finding low-weight polynomial multiples ⋮ 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 ⋮ Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x\) and some cryptographic applications] ⋮ The Minimum Distance of Some Narrow-Sense Primitive BCH Codes ⋮ On the hardness of the Lee syndrome decoding problem ⋮ Finding low-weight polynomial multiples using the rho method ⋮ Improving the minimum distance bound of trace Goppa codes ⋮ Hybrid decoding -- classical-quantum trade-offs for information set decoding ⋮ Attacking Reduced Round SHA-256 ⋮ Improved information set decoding algorithms over Galois ring in the Lee metric ⋮ Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes ⋮ Practical collisions for EnRUPT ⋮ 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 ⋮ Asymptotic behaviour of codes in rank metric over finite fields ⋮ A New Efficient Threshold Ring Signature Scheme Based on Coding Theory ⋮ Attacking and Defending the McEliece Cryptosystem ⋮ McEliece Cryptosystem Implementation: Theory and Practice ⋮ Syndrome Based Collision Resistant Hashing ⋮ Side Channels in the McEliece PKC ⋮ A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes ⋮ Analysis of Multivariate Hash Functions ⋮ Faster 2-Regular Information-Set Decoding ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ Detection and recognition of a binary linear code ⋮ An improved algorithm for learning sparse parities in the presence of noise ⋮ On the decoding of binary cyclic codes with the Newton identities ⋮ Related-Key Attack on Full-Round PICARO ⋮ A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model ⋮ Semantic security for the McEliece cryptosystem without random oracles ⋮ On quantiles of minimal codeword weights of random linear codes over $\mathbf{F}_p$ ⋮ Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256 ⋮ Wild McEliece ⋮ Parallel-CFS ⋮ Column scrambler for the GPT cryptosystem ⋮ Properties of syndrome distribution for blind reconstruction of cyclic codes ⋮ Cryptanalysis of an E0-like combiner with memory ⋮ Reducing Key Length of the McEliece Cryptosystem ⋮ Decoding One Out of Many ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN ⋮ Oblivious Transfer Based on the McEliece Assumptions ⋮ How to mask the structure of codes for a cryptographic use ⋮ Efficient representation of binary nonlinear codes: constructions and minimum distance computation
Uses Software
This page was built for publication: A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
