The following pages link to (Q3835408):
Displayed 19 items.
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension (Q310244) (← links)
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications (Q398976) (← links)
- On generating invertible circulant binary matrices with a prescribed number of ones (Q680936) (← links)
- Semantic security for the McEliece cryptosystem without random oracles (Q1009060) (← links)
- Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
- Optimization of $$\mathsf {LPN}$$ Solving Algorithms (Q2958144) (← links)
- Faster 2-Regular Information-Set Decoding (Q3005582) (← links)
- Really Fast Syndrome-Based Hashing (Q3011909) (← links)
- Wild McEliece (Q3084251) (← links)
- A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem (Q3084253) (← links)
- Decoding One Out of Many (Q3102783) (← links)
- An Efficient Attack on All Concrete KKS Proposals (Q3102786) (← links)
- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory (Q3452571) (← links)
- Basics of Secrecy Coding (Q3462200) (← links)
- Attacking Reduced Round SHA-256 (Q3506406) (← links)
- Attacking and Defending the McEliece Cryptosystem (Q3535349) (← links)
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes (Q3540050) (← links)
- A new algorithm for finding minimum-weight words in large linear codes (Q4608514) (← links)