Analysis of the Parallel Distinguished Point Tradeoff

Hong, Jin; Lee, Ga Won; Ma, Daegun

doi:10.1007/978-3-642-25578-6_14

Cited by 7 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recall from [18,20] that the number of distinct entries |DM| contained in a non-perfect DP matrix satisfies…”

Section: Propositionmentioning

confidence: 99%

“…In the case of the DP tradeoff, the cost of resolving alarms can be reduced slightly [18] through the online chain record (OCR) technique [17,24]. The method is to keep a full record of the online chain during its generation, so that any pre-computation chain regeneration can be stopped at the exact point of merge, rather than at the terminating DP.…”

Section: ⊓ ⊔mentioning

confidence: 99%

See 1 more Smart Citation

Analysis of the Non-perfect Table Fuzzy Rainbow Tradeoff

Kim

Hong

2013

Information Security and Privacy

Self Cite

View full text Add to dashboard Cite

Abstract. Time memory tradeoff algorithms are tools for inverting oneway functions, and they are often used to recover passwords from unsalted password hashes. There are many publicly known tradeoff algorithms, and the rainbow tradeoff is widely believed to be the best algorithm. This work provides an accurate complexity analysis of the non-perfect table version of the fuzzy rainbow tradeoff algorithm, which has not yet received much attention. It is shown that, when the precomputation cost and the online efficiency are both taken into consideration, the non-perfect fuzzy rainbow tradeoff is preferable to the original rainbow tradeoff in many situations.

show abstract

“…Recall from [18,20] that the number of distinct entries |DM| contained in a non-perfect DP matrix satisfies…”

Section: Propositionmentioning

confidence: 99%

Section: ⊓ ⊔mentioning

confidence: 99%

Analysis of the Non-perfect Table Fuzzy Rainbow Tradeoff

Kim

Hong

2013

Information Security and Privacy

Self Cite

View full text Add to dashboard Cite

show abstract

“…The attack can be carried out quickly, but a large amount of memory is needed to store all precomputed values. Cryptanalytic time‐memory trade‐offs are compromise solutions between time and memory. Cryptanalytic time‐memory trade‐off was introduced by Hellman in 1980 .…”

Section: Introductionmentioning

confidence: 99%

High‐speed parallel implementations of the rainbow method based on perfect tables in a heterogeneous system

et al. 2014

Self Cite

View full text Add to dashboard Cite

SummaryThe computing power of graphics processing units (GPU) has increased rapidly, and there has been extensive research on general‐purpose computing on GPU (GPGPU) for cryptographic algorithms such as RSA, Elliptic Curve Cryptosystem (ECC), NTRU, and Advanced Encryption Standard. With the rise of GPGPU, commodity computers have become complex heterogeneous GPU+CPU systems. This new architecture poses new challenges and opportunities in high‐performance computing. In this paper, we present high‐speed parallel implementations of the rainbow method based on perfect tables, which is known as the most efficient time‐memory trade‐off, in the heterogeneous GPU+CPU system. We give a complete analysis of the effect of multiple checkpoints on reducing the cost of false alarms and take advantage of it for load balancing between GPU and CPU. For GTX460, our implementation is about 1.86 and 3.25 times faster than other GPU‐accelerated implementations, RainbowCrack and Cryptohaze, respectively, and for GTX580, 1.53 and 2.40 times faster. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

“…In 2010, Jin Hong et al established a theoretical framework of analyzing false alarms [8] and gave a fair comparison of existing tradeoff algorithms [10]. Related works include the analysis of parallel distinguished point tradeoff [9], non-perfect table fuzzy rainbow tradeoff [11], perfect rainbow tradeoff [13] etc.. Analysis of one checkpoint for a single nonperfect rainbow table was done also in [8].…”

Section: Introductionmentioning

confidence: 99%

Analysis of Multiple Checkpoints in Non-perfect and Perfect Rainbow Tradeoff Revisited

Wang

Lin

2013

Information and Communications Security

View full text Add to dashboard Cite

Time memory tradeoff (TMTO) attack has proven to be an effective cryptanalysis method against block ciphers and stream ciphers. Since it was first proposed in 1980s, many new ideas have come out to reduce the false alarms during the online phase, among which rainbow table introduced by Oechslin and perfect table introduced by Borst et al. are notable landmarks. Avoine et al. introduced the checkpoints technique to detect false alarms using little additional memory without regenerating the pre-computed chain. In this paper, we revisit the analysis of multiple checkpoints in rainbow tradeoff. For non-perfect table we give a new sight to the computation of the expected decreasing number of chain regenerations at the k-th iteration. This helps to better understand the real nature of false alarms and leads us to the same results as the work of Jung Woo Kim et al. at Indocrypt 2012. For perfect rainbow tradeoff we give the first way to find optimal positions of multiple checkpoints. The results are better than previous work of Avoine et al., which only applies when the perfect table has the maximum number of chains. All the results are verified through meticulous experiments.

show abstract

Analysis of the Parallel Distinguished Point Tradeoff

Cited by 7 publications

References 11 publications

Analysis of the Non-perfect Table Fuzzy Rainbow Tradeoff

Analysis of the Non-perfect Table Fuzzy Rainbow Tradeoff

High‐speed parallel implementations of the rainbow method based on perfect tables in a heterogeneous system

Analysis of Multiple Checkpoints in Non-perfect and Perfect Rainbow Tradeoff Revisited

Contact Info

Product

Resources

About