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
(Redirected from Publication:4392472)
Recommendations
- A new algorithm for finding minimum-weight words in large linear codes
- scientific article; zbMATH DE number 1302794
- Cryptanalysis of McEliece’s Public-Key Cryptosystem
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
- Attacking and Defending the McEliece Cryptosystem
Cited in
(64)- Semantic security for the McEliece cryptosystem without random oracles
- Cryptanalysis of an E0-like combiner with memory
- Column scrambler for the GPT cryptosystem
- An improved algorithm for learning sparse parities in the presence of noise
- Structural properties of self-dual monomial codes with application to code-based cryptography
- A new approach for finding low-weight polynomial multiples
- Information-set decoding with hints
- Properties of syndrome distribution for blind reconstruction of cyclic codes
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation
- Practical collisions for EnRUPT
- Computational aspects of retrieving a representation of an algebraic geometry code
- Asymptotic behaviour of codes in rank metric over finite fields
- How to mask the structure of codes for a cryptographic use
- Structural cryptanalysis of McEliece schemes with compact keys
- On the dimension and structure of the square of the dual of a Goppa code
- Related-key attack on full-round PICARO
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Faster 2-regular information-set decoding
- Zero-sum distinguishers for iterated permutations and application to Keccak-f and Hamsi-256
- Wild McEliece
- Parallel-CFS
- Decoding one out of many
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
- On quantiles of minimal codeword weights of random linear codes over \(\mathbf{F}_p\)
- An extension of the Brouwer-Zimmermann minimum weight algorithm
- New variant of the McEliece cryptosystem
- Basics of secrecy coding
- Attacking Reduced Round SHA-256
- 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
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
- Reducing Key Length of the McEliece Cryptosystem
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications
- scientific article; zbMATH DE number 1302794 (Why is no real title available?)
- The minimum distance of some narrow-sense primitive BCH codes
- A new algorithm for finding minimum-weight words in large linear codes
- Syndrome Decoding Estimator
- The use of the direct sum decomposition algorithm for analyzing the strength of some McEliece-type cryptosystems
- A Summary of McEliece-Type Cryptosystems and their Security
- Analysis of Multivariate Hash Functions
- Oblivious Transfer Based on the McEliece Assumptions
- Generalization of the ball-collision algorithm
- TinyKeys: a new approach to efficient multi-party computation
- Detection and recognition of a binary linear code
- 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
- Improved information set decoding algorithms over Galois ring in the Lee metric
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- On the parameters of some LCD BCH codes over \(\mathbb{F}_q\) with length \((q^m+1)/\lambda\)
- A new approach based on quadratic forms to attack the McEliece cryptosystem
- Integer syndrome decoding in the presence of noise
- CryptAttackTester: high-assurance attack analysis
- Increasing index sizes for information set decoding algorithms
- On the matrix code of quadratic relationships for a Goppa code
- A family of cyclic codes with increasing dimensions and fixed minimum distances
- On the decoding of binary cyclic codes with the Newton identities
- Information set decoding in the Lee metric with applications to cryptography
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4392472)
