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

Authors:
T. Johansson;F. Jonsson
Affiliations:
Dept. of Inf. Technol., Lund Univ.;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Cryptanalysis of the "Grain" family of stream ciphers

ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Parallel-CFS: strengthening the CFS McEliece-based signature scheme

SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Decoding one out of many

PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography

Quantified Score

Hi-index	754.84

Visualization

Abstract

A new probabilistic algorithm for decoding one received word from a set of many given received words, into a codeword such that the Hamming distance between the received word and the codeword is at most t, is proposed. The new algorithm is applicable to several cryptographic problems, such as the Stern (1989, 1994) identification scheme, the McEliece (1978) public-key cryptosystem, and in correlation attacks on stream ciphers. When applicable, it runs significantly faster than previous algorithms used for attacks on these cryptosystems.