Pages that link to "Item:Q4392472"
From MaRDI portal
The following pages link to 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 (Q4392472):
Displaying 50 items.
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications (Q398976) (← links)
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes (Q626942) (← links)
- On the decoding of binary cyclic codes with the Newton identities (Q733502) (← links)
- Information set decoding in the Lee metric with applications to cryptography (Q825935) (← links)
- Semantic security for the McEliece cryptosystem without random oracles (Q1009060) (← links)
- Cryptanalysis of an E0-like combiner with memory (Q1021238) (← links)
- Column scrambler for the GPT cryptosystem (Q1811105) (← links)
- An improved algorithm for learning sparse parities in the presence of noise (Q2034402) (← links)
- Structural properties of self-dual monomial codes with application to code-based cryptography (Q2149783) (← links)
- A new approach for finding low-weight polynomial multiples (Q2151296) (← links)
- Information-set decoding with hints (Q2163764) (← links)
- Properties of syndrome distribution for blind reconstruction of cyclic codes (Q2304654) (← links)
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation (Q2350921) (← links)
- Practical collisions for EnRUPT (Q2429710) (← links)
- Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
- Asymptotic behaviour of codes in rank metric over finite fields (Q2439748) (← links)
- How to mask the structure of codes for a cryptographic use (Q2572961) (← links)
- On the dimension and structure of the square of the dual of a Goppa code (Q2697482) (← links)
- Related-Key Attack on Full-Round PICARO (Q2807197) (← links)
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (Q2835589) (← links)
- Faster 2-Regular Information-Set Decoding (Q3005582) (← links)
- Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256 (Q3084240) (← links)
- Wild McEliece (Q3084251) (← links)
- Parallel-CFS (Q3084252) (← links)
- Decoding One Out of Many (Q3102783) (← links)
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory (Q3193273) (← links)
- On quantiles of minimal codeword weights of random linear codes over $\mathbf{F}_p$ (Q3382023) (← links)
- New Variant of the McEliece Cryptosystem (Q3460478) (← links)
- Basics of Secrecy Coding (Q3462200) (← links)
- Attacking Reduced Round SHA-256 (Q3506406) (← links)
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory (Q3535347) (← links)
- Attacking and Defending the McEliece Cryptosystem (Q3535349) (← links)
- McEliece Cryptosystem Implementation: Theory and Practice (Q3535350) (← links)
- Syndrome Based Collision Resistant Hashing (Q3535357) (← links)
- Side Channels in the McEliece PKC (Q3535365) (← links)
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes (Q3540050) (← links)
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model (Q3623048) (← links)
- Reducing Key Length of the McEliece Cryptosystem (Q3637133) (← links)
- The Minimum Distance of Some Narrow-Sense Primitive BCH Codes (Q4591232) (← links)
- Syndrome Decoding Estimator (Q5087253) (← links)
- A Summary of McEliece-Type Cryptosystems and their Security (Q5295348) (← links)
- Analysis of Multivariate Hash Functions (Q5385529) (← links)
- Oblivious Transfer Based on the McEliece Assumptions (Q5502796) (← links)
- Generalization of the Ball-Collision Algorithm (Q5855596) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- Detection and recognition of a binary linear code (Q5939245) (← links)
- On the hardness of the Lee syndrome decoding problem (Q6089464) (← links)
- Improving the minimum distance bound of trace Goppa codes (Q6109703) (← links)
- Improved information set decoding algorithms over Galois ring in the Lee metric (Q6131036) (← links)
