Cryptology ePrint Archive: Report 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.

Category / Keywords: secret-key cryptography / stream ciphers, estream, complexity

Publication Info: This short note will only be published here.

Date: received 10 Nov 2006, last revised 30 Nov 2006, withdrawn 15 Jan 2007

Contact author: jeanphilippe aumasson at fhnw ch

Available format(s): (-- withdrawn --)

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

Version: 20070115:081425 (All versions of this report)

Short URL: ia.cr/2006/401

Discussion forum: Show discussion | Start new discussion