On the complexity of some cryptographic problems based on the general decoding problem

DOI10.1109/TIT.2002.802608MaRDI QIDQ4677588zbMATH OpenFDO

Authors Thomas Johansson, Fredrik Jonsson

Publication date 11 May 2005

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2002.802608

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Recommendations

• A Statistical Decoding Algorithm for General Linear Block Codes
• An algorithm for generalized syndrome decoding problem
• Decoding one out of many
• A new algorithm for finding minimum-weight words in large linear codes
• Cryptanalysis of McEliece’s Public-Key Cryptosystem

Cited in

(13)

• Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
• Some cryptanalytic and coding-theoretic applications of a soft Stern algorithm
• A key recovery attack on MDPC with CCA security using decoding errors
• Parallel-CFS
• Decoding one out of many
• Basics of secrecy coding
• scientific article; zbMATH DE number 4004063 (Why is no real title available?)
• scientific article; zbMATH DE number 7650434 (Why is no real title available?)
• Interleaved Prange: a new generic decoder for interleaved codes
• An algorithm for generalized syndrome decoding problem
• On the computational hardness of the code equivalence problem in cryptography
• A code-based hybrid signcryption scheme
• Wave Parameter Selection

This page was built for publication: On the complexity of some cryptographic problems based on the general decoding problem

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