Stairway To Rainbow - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Stairway To Rainbow

Résumé

A cryptanalytic time-memory trade-off is a technique introduced by M. Hellman in 1980 to perform brute-force attacks. It consists of a time-consuming precomputation phase performed and stored once and for all, which is then used to reduce the computation time of brute-force attacks. A variant, known as rainbow tables, introduced by Oechslin in 2003 is used by most of today's off-the-shelf password-guessing tools. Precomputation of such tables is highly inefficient however, because much of the values computed during this task are eventually discarded. This paper revisits rainbow tables precomputation, challenging what has so far been regarded as an immutable foundation. The key idea consists in recycling values discarded during the precomputation phase, and adapting the brute force phase to make use of these recycled values. For a given memory and probability of success, the stepped rainbow tables thus created significantly reduce the workload induced by both the precomputation phase and the attack phase. The speedup obtained by using such tables is provided, and backed up by practical experiments. CCS CONCEPTS • Security and privacy → Cryptanalysis and other attacks; Authentication.
Fichier principal
Vignette du fichier
3579856.3582825.pdf (909.58 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04349311 , version 1 (17-12-2023)

Identifiants

Citer

Gildas Avoine, Xavier Carpent, Diane Leblanc-Albarel. Stairway To Rainbow. ASIA CCS '23: ACM ASIA Conference on Computer and Communications Security, Jul 2023, Melbourne VIC Australia, Australia. ⟨10.1145/3579856.3582825⟩. ⟨hal-04349311⟩
11 Consultations
8 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More