Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$
From MaRDI portal
Publication:5739026
DOI10.1007/978-3-319-55589-8_7zbMath1365.94429OpenAlexW2591698564MaRDI QIDQ5739026
Shouichi Hirose, Jean Belo Klamti, Cheikh Thiecoumba Gueye
Publication date: 1 June 2017
Published in: Codes, Cryptology and Information Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-55589-8_7
Related Items (5)
Generalization of the Ball-Collision Algorithm ⋮ An algorithm for generalized syndrome decoding problem ⋮ Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems ⋮ Encryption scheme based on expanded Reed-Solomon codes ⋮ On the design and security of Lee metric McEliece cryptosystems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural cryptanalysis of McEliece schemes with compact keys
- Coding theory and applications. 3rd international Colloquium, Toulon, France, November 2-4, 1988. Proceedings
- On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices
- Monoidic Codes in Cryptography
- New Generic Algorithms for Hard Knapsacks
- Algebraic Cryptanalysis of McEliece Variants with Compact Keys
- Reducing Key Length of the McEliece Cryptosystem
- Security Bounds for the Design of Code-Based Cryptosystems
- Compact McEliece Keys from Goppa Codes
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- The complexity of information set decoding
- On the inherent intractability of certain coding problems (Corresp.)
- Compact McEliece keys based on quasi-dyadic Srivastava codes
- Overview of the Mceliece Cryptosystem and its Security
- Smaller Decoding Exponents: Ball-Collision Decoding
- Bucketing Coding and Information Theory for the Statistical High-Dimensional Nearest-Neighbor Problem
- Polynomial Time Attack on Wild McEliece over Quadratic Extensions
This page was built for publication: Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$
