article · 2000

Improved Impossible Differentials on Twofish

Eli Biham, Vladimir Furman

Cited by 0Abstract and details only

Abstract

Twofish is one of the AES finalists. The best up-to-date analysis of Twofish was presented by its designers, whose complexity on 6-round Twofish with 128-bit keys is 4.6 2128 one-round computations. In this paper we present m improvement of the attack on 6-round Twofish, whose complexity is 1.84 2128 one-round computations. For other key sizes our results have the complexity 13. 2 it one-round computations for 192-bit keys md 24.2. 2192 one-round computations for 256-bit keys. For 7-round Twofish, the designers mentioned m attack, md estimated its complexity to be about 22sc simple steps for 256-bit keys md for other key sizes have a complexities that exceed exhaustive search. We present an improvement of the attack on 7-round Twofish, whose complexity is 222&apos;48 one-round computations for 256-bit keys. We also show, for the first time, that this attack is faster thm exhaustive search for 192-bit keys for which it breaks 7-round Twofish in 2.2192 one-round computations, while exhaustive search takes 7. 2192 .

Cite this paper

APA 7

Biham, E., & Furman, V. (2000). Improved Impossible Differentials on Twofish.

MLA 9

Biham, Eli, and Vladimir Furman. “Improved Impossible Differentials on Twofish.” 2000.

Chicago

Biham, Eli, and Vladimir Furman. 2000. “Improved Impossible Differentials on Twofish.”

Harvard

Biham, E. and Furman, V. (2000) ‘Improved Impossible Differentials on Twofish’.

BibTeX

@article{biham2000improved,
  title = {{Improved Impossible Differentials on Twofish}},
  author = {Biham, Eli and Furman, Vladimir},
  year = {2000}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.