원문정보
보안공학연구지원센터(IJSIA)
International Journal of Security and Its Applications
Vol.7 No.2
2013.03
pp.75-88
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
There has been extensive research on a cryptanalytic time-memory tradeoff for recent 30 years. Since Hellman’s work in 1980, some improved variants and techniques have been proposed, and the rainbow method is known as the best time-memory tradeoff. As for the memory size, however, the required number of bits per start point and end point was not explicitly considered in these works. With this in mind, we propose a new time-memory tradeoff and analyze the expected cryptanalysis time.
목차
Abstract
1: Introduction
2: Rainbow Method
2.1: Precomputation Phase
2.2: Online Phase
2.3: Analysis
3: A Faster Time-Memory Tradeoff
4: Performance Analyses and Comparisons
4.1: Analyses
4.2: Comparisons
5: Conclusion
Acknowledgement
References
1: Introduction
2: Rainbow Method
2.1: Precomputation Phase
2.2: Online Phase
2.3: Analysis
3: A Faster Time-Memory Tradeoff
4: Performance Analyses and Comparisons
4.1: Analyses
4.2: Comparisons
5: Conclusion
Acknowledgement
References
저자정보
참고문헌
자료제공 : 네이버학술정보
