Title :
Probabilistic Versus Deterministic Algebraic Cryptanalysis—A Performance Comparison
Author_Institution :
FAMNIT, Univ. of Primorska, Koper, Slovenia
Abstract :
In this work, the performance of probabilistic algebraic attacks is compared to classical (fast) algebraic attacks in the context of their application to certain linear feedback shift register (LFSR)-based stream ciphers. Using some results from coding theory it is shown that in terms of time complexity classical deterministic algebraic attacks are in general a more efficient cryptanalytic tool, unless the filtering function F : GF (2)n rarr GF (2)m has such a nonrandom structure that its cryptographic use is presumably refutable anyway.
Keywords :
algebra; cryptography; probability; shift registers; algebraic attacks; coding theory; deterministic algebraic cryptanalysis; filtering function; linear feedback shift register; nonrandom structure; probabilistic algebraic cryptanalysis; stream ciphers; time complexity; Codes; Cryptography; Filtering theory; Filters; Hardware; Helium; Linear feedback shift registers; Protection; Security; Shift registers; Algebraic attacks; annihilators; filtering generator; probabilistic algebraic cryptanalysis; stream ciphers;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2009.2030489
