Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems
DOI10.3934/amc.2020132zbMath1520.14054OpenAlexW3127124253MaRDI QIDQ6112240
Chik How Tan, Terry Shue Chien Lau
Publication date: 7 July 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2020132
cryptanalysiscode-based cryptographyMcEliece cryptosystempublic-key encryptionpost-quantum cryptographyplaintext recovery attack
Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50) Decoding (94B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Some new NP-complete coding problems
- A new code-based cryptosystem
- 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
- 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: Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems
