On the design and security of Lee metric McEliece cryptosystems
DOI10.1007/s10623-021-01002-2zbMath1485.94105OpenAlexW4205570698WikidataQ114849801 ScholiaQ114849801MaRDI QIDQ2115742
Terry Shue Chien Lau, Chik How Tan
Publication date: 21 March 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-01002-2
cryptanalysiscode-based cryptographyMcEliece cryptosystempublic-key encryptionpost-quantum cryptographyplaintext recovery attack
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Decoding (94B35)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Information set decoding in the Lee metric with applications to cryptography
- Encryption scheme based on expanded Reed-Solomon codes
- 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
- A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- Information-Set Decoding for Linear Codes over F q
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- On the inherent intractability of certain coding problems (Corresp.)
- Smaller Decoding Exponents: Ball-Collision Decoding
- Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$
- Generalization of the Ball-Collision Algorithm
This page was built for publication: On the design and security of Lee metric McEliece cryptosystems
