[Resource Topic] 2004/247: Vectorial fast correlation attacks

Welcome to the resource topic for 2004/247

Title:
Vectorial fast correlation attacks

Authors: Jovan Dj. Golic, 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.

ePrint: https://eprint.iacr.org/2004/247

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .