Characterization and improvement of time-memory trade-off based on perfect tables

ACM Transactions on Information and System Security

Volumn 11, Issue 4, 2008, Pages

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

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b Nagravision SA (Kudelski Group)

^c Objectif Sécurité ^*

Author keywords

Cryptography; Hellman's time memory trade off; Password cracking; Rainbow tables

Indexed keywords

FALSE ALARMS; HELLMAN'S TIME-MEMORY TRADE-OFF; PASSWORD CRACKING; POINT-BASED; RAINBOW TABLES; TIME-MEMORY TRADE-OFF;

ALARM SYSTEMS; COMPUTER HARDWARE; CRYPTOGRAPHY; SECURITY OF DATA;

COMMERCE;

EID: 49449086865     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/1380564.1380565     Document Type: Article

References (18)

1. AVOINE, G., JUNOD, P., AND OECHSLIN, P. 2005. Time-memory trade-offs: False alarm detection using checkpoints. In Proceedings of Progress in Cryptology - 6th International Conference on Cryptology (INDOCRYPT'05). Lecture Notes in Computer Science, vol. 3797. Cryptology Research Society of India, Springer-Verlag, Bangalore, India, 183-196.
2. BARKAN, E., BIHAM, E., AND SHAMIR, A. 2006. Rigorous bounds on cryptanalytic time/memory tradeoffs. In Proceedings of Advances in Cryptology - 26th Annual International Cryptology Conference (CRYPTO'06). C. Dwork, Ed. Lecture Notes in Computer Science. IACR, Springer-Verlag, Santa Barbara, CA.
3. BIRYUKOV, A., MUKHOPADHYAY, S., AND SARKAR, P. 2005. Improved time-memory trade-offs with multiple data. In Proceedings of the 12th Annual Workshop on Selected Areas in Cryptography (SAC'05), B. Preneel and S. Tavares, Eds. Lecture Notes in Computer Science, vol. 3897. Springer-Verlag, Kingston, Canada, 110-127.
4. BIRYUKOV, A. AND SHAMIR, A. 2001. Cryptanalytic time/memory/data tradeoffs for stream ciphers. In Proceedings of Advances in Cryptology - 7th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT'01), C. Boyd, Ed. Lecture Notes in Computer Science, vol. 2248. IACR, Springer-Verlag, Gold Coast, Australia, 1-13.
5. BLRYUKOV, A., SHAMIR, A., AND WAGNER, D. 2000. Real time cryptanalysis of A5/1 on a PC. In Proceedings of the Fast Software Encryption - 7th International Workshop (FSE'00), B. Schneier, Ed. Lecture Notes in Computer Science, vol. 1978. Springer-Verlag, New York, 1-18.
6. BORST, J., PRENEEL, B., AND VANDEWALLE, J. 1998. On the time-memory tradeoff between ex-haustive key search and table precomputation. In Proceedings of the 19th Symposium on Information Theory in the Benelux, P. de With and M. van der Schaar-Mitrea, Eds. Veldhoven, The Netherlands, 111-118.
7. DENNING, D. 1982. Cryptography and Data Security. Addison-Wesley, Boston, MA. 100.
8. FIAT, A. AND NAOR, M. 1991. Rigorous time/space tradeoffs for inverting functions. In Proceedings of the 23th Annual ACM Symposium on Theory of Computing (STOC'91). ACM Press, New Orleans, LA. 534-541.
9. FIAT, A. AND NAOR, M. 1999. Rigorous time/space tradeoffs for inverting functions. SIAM J. Comput. 29, 3 (December), 790-803.
10. HELLMAN, M. 1980. A cryptanalytic time-memory trade off. IEEE Trans. Inform. Theory IT-26, 4 (July), 401-406.
11. HONG, J. AND SARKAR, P. 2005. New applications of time memory data tradeoffs. In Proceedings of Advances in Cryptology - 11th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT'05), B. Roy, Ed. Lecture Notes in Computer Science, vol. 3788. IACR, Springer-Verlag, Chennai, India, 353-372.
12. KIM, I. AND MATSUMOTO, T. 1999. 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 (January), 123-129.
13. KUSUDA, K. AND MATSUMOTO, T. 1996. Optimization of time-memory trade-off cryptanalysis and its application to DES, FEAL-32, and Skipjack. IEICE Trans. Fundamentals E79-A, 1 (January), 35-48.
14. MENTENS, N., BATINA, L., PRENEEL, B., AND VERBAUWHEDE, I. 2005. Cracking Unix passwords using FPGA platforms. In Proceedings of the Workshop on Special Purpose Hardware for Attacking Cryptographic Systems (SHARCS'05).
15. OECHSLIN, P. 2003. Making a faster cryptanalytic time-memory trade-off. In Proceedings of Advances in Cryptology - 23th Annual International Cryptology Conference (CRYPTO'03), D. Boneh, Ed. Lecture Notes in Computer Science, vol. 2729. IACR, Springer-Verlag, Santa Barbara, CA. 617-630.
16. QUISQUATER, J.-J. AND DELESCAILLE, J.-P. 1989. How easy is collision search? Application to DES (extended summary). In Proceedings of Advances in Cryptology - Workshop on the Theory and Application of Cryptographic Techniques (EUROCRYPT'89), J.-J. Quisquater and V. Joos, Eds. Lecture Notes in Computer Science, vol. 434. IACR, Springer-Verlag, Houthalen, Belgium, 429-434.
17. STANDAERT, F. C.-X., ROUVROY, G., QUISQUATER, J.-J., AND LEGAT, J.-D. 2002. A time-memory tradeoff using distinguished points: New analysis & FPGA results. In Proceedings of the Workshop on Cryptographic Hardware and Embedded Systems (CHES'02), B. Kaliski, C. K. Koç, and C. Paar, Eds. Lecture Notes in Computer Science, vol. 2523. Springer-Verlag, Redwood Shores, CA. 593-609.
18. WIENER, M. AND VAN OORSCHOT, P. 1999. Parallel collision search with cryptanalytic applications. J. Crypto. 12, 1 (March), 1-28.