Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems

DOI10.3934/AMC.2020132MaRDI QIDQ6112240zbMATH OpenOpenAlexFDO

Authors Terry Shue Chien Lau, Chik How Tan

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

zbMATH Keywords

code-based cryptographycryptanalysisMcEliece cryptosystemplaintext recovery attackpost-quantum cryptographypublic-key encryption

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Recommendations

• Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem
• Cryptanalysis of the McEliece public key cryptosystem based on polar codes
• On the edge-independence number and edge-covering number for regular graphs
• scientific article; zbMATH DE number 4070796
• Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes

Cites work

• A new code-based cryptosystem
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set 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
• scientific article; zbMATH DE number 4070796 (Why is no real title available?)
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• Information-set decoding for linear codes over F_q
• On computing nearest neighbors with applications to decoding of binary linear codes
• On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
• On the inherent intractability of certain coding problems (Corresp.)
• Smaller decoding exponents: ball-collision decoding
• Some new NP-complete coding problems

Cited in

(4)

• A Polynomial-Time Attack on the BBCRS Scheme
• Plaintext Recovery Attacks Against WPA/TKIP
• Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem
• On the security of two IKKR-type code-based cryptosystems

This page was built for publication: Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6112240)