Paper 2004/247
Vectorial fast correlation attacks
Jovan Dj. Golic and Guglielmo Morgari
Abstract
A new, vectorial approach to fast correlation attacks on binary memoryless combiners is proposed. Instead of individual input sequences or their linear combinations, the new attack is targeting subsets of input sequences as a whole, thus exploiting the full correlation between the chosen subset and the output sequence. In particular, all the input sequences can be targeted simultaneously. The attack is based on a novel iterative probabilistic algorithm which is also applicable to general memoryless combiners over finite fields or finite rings. Experimental results obtained for randomly chosen binary combiners with balanced combining functions show that the vectorial approach yields a considerable improvement in comparison with the classical, scalar approach.
Note: The first version of this paper with a different coauthor, and different contents with respect to algorithms and experimental results, will be published in Designs, Codes and Cryptography in 2005. This is explained in a footnote on the first page.
Metadata
- Available format(s)
- PS
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- stream cipherssequential linear cryptanalysiscorrelation attacksiterative probabilistic decoding
- Contact author(s)
- golic @ inwind it
- History
- 2004-09-22: received
- Short URL
- https://ia.cr/2004/247
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2004/247,
author = {Jovan Dj. Golic and Guglielmo Morgari},
title = {Vectorial fast correlation attacks},
howpublished = {Cryptology {ePrint} Archive, Paper 2004/247},
year = {2004},
url = {https://eprint.iacr.org/2004/247}
}
