Cryptanalysis of T-function-based hash functions applications to MySQL password algorithms

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

Volumn 4296 LNCS, Issue , 2006, Pages 267-285

  Muller, Frédéric ^a   Peyrin, Thomas ^b  

^a HSBC Halbis Partners   (France)

^b ORANGE LABS   (France)

Author keywords

Hash functions; MySQL; T functions

Indexed keywords

ALGORITHMS; AUTHENTICATION; FUNCTIONS; SECURITY OF DATA;

HASH FUNCTIONS; MYSQL; T-FUNCTIONS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 34547426005     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/11927587_23     Document Type: Conference Paper

References (23)

1. I. Arce, A. Azubel, E. Kargieman, G. Richarte, C. Sarraute, and A. Waissbein. An attack on the MySQL authentication protocol. 2002. Technical report from Core Security Technologies.
2. J-S. Coron, Y. Dodis, C. Malinaud, and P. Puniya. Merkle-Damgárd Revisited: How to Construct a Hash Function. In V. Shoup, editor, Advances in Cryptology - Crypto '05, volume 3621 of Lectures Notes in Computer Science, pages 430-448. Springer, 2005.
3. J. Hong, D. Lee, Y. Yeom, and D. Han. A New Class of Single Cycle T-functions. In H. Gilbert and H. Handschuh, editors, Fast Software Encryption - 2005, volume 3557 of Lectures Notes in Computer Science, pages 68-82. Springer, 2005.
4. A. Joux. Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions. In M. Franklin, editor, Advances in Cryptology - CRYPTO'04, volume 3152 of Lectures Notes in Computer Science, pages 306-316. Springer, 2004.
5. n Work. In R. Cramer, editor, Advances in Cryptology - Eurocrypt'05, volume 3494 of Lectures Notes in Computer Science, pages 474-490. Springer, 2005.
6. A. Klimov. Applications of T-functions in Cryptography. PhD thesis, Weizmann Institute of Science, 2004. http://www.wisdom.weizmann.ac.il/ ask/.
7. A. Klimov and A. Shamir. A New Class of Invertible Mappings. In B. Kaliski, Ç. Koç, and C. Paar, editors, Cryptographic Hardware and Embedded Systems (CHES) - 2002, volume 2523 of Lectures Notes in Computer Science, pages 470-483. Springer, 2002.
8. A. Klimov and A. Shamir. Cryptographic Applications of T-functions. In M. Matsui and R. Zuccherato, editors, Selected Areas in Cryptography - 2003, volume 3006 of Lectures Notes in Computer Science, pages 248-261. Springer, 2004.
9. A. Klimov and A. Shamir, New Applications of T-functions in Block Ciphers and Hash Functions. In H. Gilbert and H. Handschuh, editors, Fast Software Encryption - 2005, volume 3557 of Lectures Notes in Computer Science, pages 18-31, Springer, 2005.
10. L. Knudsen, SMASH - A Cryptographic Hash Function. In H. Gilbert and H, Hand-schuh, editors, Fast Software Encryption - 2005, volume 3557 of Lectures Notes in Computer Science, pages 228-242, Springer, 2005.
11. S. Künzli, P. Junod, and W. Meier. Distinguishing Attacks on T-Functions. In E. Dawson and S. Vaudenay, editors, International Conference on Cryptology in Malaysia (MyCrypt 2005), volume 3715 of Lectures Notes in Computer Science, pages 2-15. Springer, 2005.
12. A. Menezes, P. van 0orschot, and S. Vanstone, Handbook of Applied Cryptography. CRC Press, 1996.
13. J. Mitra and P. Sarkar. Time-Memory Trade-Off Attacks on Multiplications and T-functions, In P. Lee, editor, Advances in Cryptology - Asiacrypt'04, volume 3329 of Lectures Notes in Computer Science, pages 468-482. Springer, 2004.
14. F. Muller and T. Peyrin. Linear Cryptanalysis of the TSC Family of Stream Ciphers. In B. K. Roy, editor, Advances in Cryptology - Asiacrypt'05, volume 3788 of Lectures Notes in Computer Science, pages 373-394. Springer, 2005.
15. MySQL Downloads. See http://dev.mysql.com/downloads.
16. MySQL Website. See http://www.mysql.com.
17. National Institute of Standards and Technology (NIST). Secure Hash Standard FIPS Publication 180-1, April 1995. Available at http://www.itl.nist. gov/fipspubs/fip180-1.htm.
18. J. Patarin and P. Camion. Design of Near-Optimal Pseudorandom Functions and Pseudorandom Permutations in the Information-Theoretic Model. Cryptology ePrint Archive, Report 2005/135, 2005. http://eprint.iacr.org/.
19. T. Peyrin, H. Gilbert, F. Muller, and M. Robshaw. Combining Compression Functions and Block Cipher-Based Hash. In Advances in Cryptology - Asiacrypt'06, 2006. To appear.
20. N. Pramstaller, C. Rechberger, and V. Rijmen. Breaking a New Hash Function Design Strategy Called SMASH. In B. Preneel and S. E. Tavares, editors, Selected Areas in Cryptography - 2005, volume 3897 of Lectures Notes in Computer Science, pages 233-244. Springer, 2005.
21. B. Preneel. Analysis and design of cryptographic hash functions. PhD thesis, Katholieke Universiteit Leuven, 1993.
22. X. Wang, Y. Yin, and H. Yu. Finding Collisions in the Full SHA1. In V. Shoup, editor, Advances in Cryptology - Crypto'05, volume 3621 of Lectures Notes in Computer Science, pages 17-36. Springer, 2005.
23. X. Wang and H. Yu. How to Break MD5 and Other Hash Functions. In R. Cramer, editor, Advances in Cryptology - Eurocrypt'05, volume 3494 of Lectures Notes in Computer Science, pages 19-35. Springer, 2005.