Analysis of the perfect table fuzzy rainbow tradeoff (Q2336696)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7131852
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of the perfect table fuzzy rainbow tradeoff |
scientific article; zbMATH DE number 7131852 |
Statements
Analysis of the perfect table fuzzy rainbow tradeoff (English)
0 references
19 November 2019
0 references
Summary: Cryptanalytic time memory tradeoff algorithms are tools for inverting one-way functions, and they are used in practice to recover passwords that restrict access to digital documents. This work provides an accurate complexity analysis of the perfect table fuzzy rainbow tradeoff algorithm. Based on the analysis results, we show that the lesser known fuzzy rainbow tradeoff performs better than the original rainbow tradeoff, which is widely believed to be the best tradeoff algorithm. The fuzzy rainbow tradeoff can attain higher online efficiency than the rainbow tradeoff and do so at a lower precomputation cost.
0 references
0.9528433680534364
0 references
0.8577596545219421
0 references
0.8448200225830078
0 references
0.8392263054847717
0 references
0.8389624357223511
0 references
