Du är här

Improving the rainbow attack by reusing colours

Författare:
Redaktör:
  • Juan A. Garay
  • Atsuko Miyaji
  • Akira Otsuka
Publiceringsår: 2009
Språk: Engelska
Sidor: 362-378
Publikation/Tidskrift/Serie: Cryptology and Network Security/Lecture Notes in Computer Science
Volym: 5888
Dokumenttyp: Konferensbidrag
Förlag: Springer

Sammanfattning

Hashing or encrypting a key or a password is a vital part in most network security protocols. The most practical generic attack on such schemes is a time memory trade-off attack. Such an attack inverts any one-way function using a trade-off between memory and execution time. Existing techniques include the Hellman attack and the rainbow attack, where the latter uses different reduction functions ("colours") within a table.

This work investigates the possibility of reusing colours, i.e., repeating the reduction functions, in the rainbow attack. We show how this outperforms the Hellman and the rainbow attack in a model of fixed resources. We try to characterize exactly when this improvement appears and in such a case the choice of an optimal number of colours.

Disputation

Nyckelord

  • Technology and Engineering
  • Thin rainbow attack
  • Rainbow attack
  • Hellman attack
  • Time memory trade-off
  • TMTO

Övriga

8th International Conference, CANS 2009
2009-12-12/2009-12-14
Kanazawa, Japan
Published
Yes
  • Crypto and Security
  • ISSN: 0302-9743
  • ISBN: 978-3-642-10432-9

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

 

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen