Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Improving the rainbow attack by reusing colours

In English

Författare

Redaktör

  • Juan A. Garay
  • Atsuko Miyaji
  • Akira Otsuka

Summary, in English

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.

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

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

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

Conference name

8th International Conference, CANS 2009

Conference date

2009-12-12 - 2009-12-14

Conference place

Kanazawa, Japan

Status

Published

Forskningsgrupp

  • Crypto and Security

ISBN/ISSN/Övrigt

  • ISSN: 1611-3349
  • ISSN: 0302-9743
  • ISBN: 978-3-642-10432-9