Achieving higher success probability in time-memory trade-off crypt analysis without increasing memory size

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E82-A, Issue 1, 1999, Pages 123-129

  Kim, Il Jun ^a   Matsumoto, Tsutomu ^a  

^a YOKOHAMA NATIONAL UNIVERSITY   (Japan)

Author keywords

Space complexity; Success probability; Time complexity; Time memory trade off

Indexed keywords

PROBABILITY; SECURITY OF DATA; TABLE LOOKUP;

BLOCK CIPHERS; TIME-MEMORY TRADE-OFF CRYPTANALYSIS;

CRYPTOGRAPHY;

EID: 0032680924     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (4)

1. M.E. Hellman, "A cryptanalytic time-memory trade-off," IEEE Trans. Inf. Theory, vol.IT-26, no,4, pp.401-406, 1980.
2. K. Kusuda and T. Matsumoto, "Optimization of timememory trade-off cryptanalysis and its application to DES, FEAL-32, and Skipjack," IEICE Trans. Fundamentals, vol.E79-A, no.l, pp.35-48, 1996.
3. K. Kusuda and T. Matsumoto, "A strength evaluation of the data encryption standard," IMES Discussion Paper ESeries, no.97-E-5, The Bank of Japan Institute for Monetary and Economic Studies, Aug. 1997. Available at http://www.imes,boj.or.jp/english/edps.index .html
4. T. Matsumoto, I. Kim, and T. Kara, "Methods to reduce time and memory in time-memory trade-off," IEICE Technical Report, ISEC97-10, May 26, 1997.