Paper 2006/401

On the cost of cryptanalytic attacks

Jean-Philippe Aumasson

Abstract

This note discusses the complexity evaluation of cryptanalytic attacks, with the example of exhaustive key search, illustrated with several ciphers from the eSTREAM project. A measure is proposed to evaluate the effective computational cost of cryptanalytic algorithms, based on the observation that the standard one is not precise enough.

Note: The benchmark results used may quickly become obsolete, please refer to the URL given in the paper for the most recent ones.

Metadata
Available format(s)
-- withdrawn --
Category
Secret-key cryptography
Publication info
Published elsewhere. This short note will only be published here.
Keywords
stream ciphersestreamcomplexity
Contact author(s)
jeanphilippe aumasson @ fhnw ch
History
2007-01-15: withdrawn
2006-11-12: received
See all versions
Short URL
https://ia.cr/2006/401
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.