earticle

논문검색

A Faster Cryptanalytic Time-Memory Tradeoff

초록

영어

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

저자정보

  • Jung Woo Kim Seoul National University
  • Jungjoo Seo Seoul National University
  • Jin Hong Seoul National University
  • Kunsoo Park Seoul National University

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.