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

DOI10.1109/TIT.2002.802608zbMath1062.94038MaRDI QIDQ4677588

Fredrik Jonsson, Thomas Johansson

Publication date: 11 May 2005

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

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Related Items (7)

Basics of Secrecy Coding ⋮ Interleaved Prange: a new generic decoder for interleaved codes ⋮ A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors ⋮ A code-based hybrid signcryption scheme ⋮ Parallel-CFS ⋮ Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures ⋮ Decoding One Out of Many

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