Time-memory trade-offs: False alarm detection using checkpoints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3797 LNCS, Issue , 2005, Pages 183-196

  Avoine, Gildas ^a   Junod, Pascal ^b   Oechslin, Philippe ^a,c  

^a EPFL   (Switzerland)

^b Nagravision SA (Kudelski Group)   (Switzerland)

^c Objectif Sécurité   (Switzerland)

Author keywords

Cryptanalysis; Precomputation; Time memory trade off

Indexed keywords

ALARM SYSTEMS; COMPUTATIONAL METHODS; STORAGE ALLOCATION (COMPUTER);

CRYPTANALYSIS; PRECOMPUTATION; RAINBOW TABLES; TIME-MEMORY TRADE OFF;

CRYPTOGRAPHY;

EID: 33646826194     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11596219_15     Document Type: Conference Paper

References (15)

1. Gildas Avoine, Etienne Dysli, and Philippe Oechslin. Reducing time complexity in RFID systems. In Selected Areas in Cryptography - SAC 2005, Lecture Notes in Computer Science, Kingston, Canada, August 2005. Springer-Verlag.
2. Gildas Avoine, Pascal Junod, and Philippe Oechslin. Time-memory trade-offs: False alarms detection using checkpoints. Technical Report LASEC-REPORT-2005-002, Swiss Federal Institute of Technology (EPFL), Security and Cryptography Laboratory (LASEC), Lausanne, Switzerland, September 2005.
3. Alex Biryukov, Adi Shamir, and David Wagner. Real time cryptanalysis of A5/1 on a PC. In Fast Software Encryption - FSE'00, volume 1978 of Lecture Notes in Computer Science, pages 1-18, New York, USA, April 2000. Springer-Verlag.
4. Johan Borst, Bart Preneel, and Joos Vandewalle. On the time-memory tradeoff between exhaustive key search and table precomputation. In Symposium on Information Theory in the Benelux, pages 111-118, Veldhoven, The Netherlands, May 1998.
5. Dorothy Denning. Cryptography and Data Security, page 100. Addison-Wesley, Boston, Massachusetts, USA, June 1982.
6. Amos Fiat and Moni Naor. Rigorous time/space tradeoffs for inverting functions. In ACM Symposium on Theory of Computing - STOC'91, pages 534-541, New Orleans, Louisiana, USA, May 1991. ACM, ACM Press.
7. Amos Fiat and Moni Naor. Rigorous time/space tradeoffs for inverting functions. SIAM Journal on Computing, 29(3):790-803, December 1999.
8. Martin Hellman. A cryptanalytic time-memory trade off. IEEE Transactions on Information Theory, IT-26(4):401-406, July 1980.
9. Iljun Kim and Tsutomu Matsumoto. Achieving higher success probability in time-memory trade-off cryptanalysis without increasing memory size. IEICE Transactions on Communications/Electronics/Information and Systems, E82-A(1):123-, January 1999.
10. Koji Kusuda and Tsutomu Matsumoto. Optimization of time-memory trade-off cryptanalysis and its application to DES, FEAL-32, and Skipjack. IEICE Transactions on Fundamentals, E79-A(1):35-48, January 1996.
11. Nele Mentens, Lejla Batina, Bart Preneel, and Ingrid Verbauwhede. Cracking Unix passwords using FPGA platforms. SHARCS - Special Purpose Hardware for Attacking Cryptographic Systems, February 2005.
12. Philippe Oechslin. Making a faster cryptanalytic time-memory trade-off. In Advances in Cryptology - CRYPTO'03, volume 2729 of Lecture Notes in Computer Science, pages 617-630, Santa Barbara, California, USA, August 2003. IACR, Springer-Verlag.
13. Jean-Jacques Quisquater and Jean-Paul Delescaille. How easy is collision search? Application to DES (extended summary). In Advances in Cryptology - EUROCRYPT'89, volume 434 of Lecture Notes in Computer Science, pages 429-434, Houthalen, Belgium, April 1989. IACR, Springer-Verlag.
14. François-Xavier Standaert, Gael Rouvroy, Jean-Jacques Quisquater, and Jean-Didier Legat. A time-memory tradeoff using distinguished points: New analysis & FPGA results. In Workshop on Cryptographic Hardware and Embedded Systems - CHES 2002, volume 2523 of Lecture Notes in Computer Science, pages 593-609, Redwood Shores, California, USA, August 2002. Springer-Verlag.
15. Michael Wiener and Paul van Oorschot. Parallel collision search with cryptanalytic applications. Journal of Cryptology, 12(1):1-28, March 1999.