Discrete logarithm variants of VSH

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

Volumn 4341 LNCS, Issue , 2006, Pages 229-242

  Lenstra, Arjen K ^a,b   Page, Daniel ^c   Stam, Martijn ^a  

^a EPFL   (Switzerland)

^b LUCENT TECHNOLOGIES   (United States)

^c UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Collision resistance; Cyclotomic subgroup; Hash functions

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COLLISION RESISTANCE; CYCLOTOMIC SUBGROUP; DESIGN STRATEGIES; DISCRETE LOGARITHMS; ELLIPTIC CURVE; EXPONENTIATIONS; MODULAR EXPONENTIATION; PROVABLE SECURITY;

HASH FUNCTIONS;

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

References (21)

1. M. Bellare, O. Goldreich and S. Goldwasser. Incremental Cryptography: The Case of Hashing and Signing. In Advances in Cryptology (CRYPTO), Springer-Verlag LNCS 839, 216-233, 1994.
2. M. Bellare and, D. Micciancio. A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost. In Advances in Cryptology (EUROCRYPT), Springer-Verlag LNCS 1233, 163-192, 1997.
3. E. Biham and A. Shamir. Differential Cryptanalysis of DES-like Cryptosystems. In Advances in Cryptology (CRYPTO), Springer-Verlag LNCS 537, 2-21, 1990.
4. D. R. L. Brown. Multi-Dimensional Montgomery Ladders for Elliptic Curves. IACR eprint, 2006/220, 2006.
5. M. Brown, D. Hankerson, J. López, and A. Menezes. Software implementation of the NIST elliptic curves over prime fields. In D. Naccache, editor, CT-RSA'01, Volume 2020 of Lecture Notes in Computer Science, pages 250-265. Springer-Verlag, 2001.
6. S. Contini, A. K. Lenstra, and R. Steinfeld. VSH, an efficient and provable collision resistant hash function. In S. Vaudenay, editor, Advances in Cryptography - Euro'06, Volume 4004 of Lecture Notes in Computer Science, pages 165-182. Springer-Verlag, 2006.
7. J. Daemen and V. Rijmen. The Design of Rijndael. Springer-Verlag, 2002.
8. I.B. Damgård. Collision Free Hash Functions and Public Key Signature Schemes. In Advances in Cryptology (EUROCRYPT), Springer-Verlag LNCS 304, 203-216, 1987.
9. R. Granger. On Small Degree Extension Fields in Cryptology. PhD thesis, University of Bristol, 2005.
10. R. Granger, D. Page, and M. Stam. A comparison of ceilidh and xtr. In D. Buell, editor, ANTS-VI, Volume 3076 of Lecture Notes in Computer Science, pages 235-249. Springer-Verlag, 2004.
11. D. Hankerson, A. Menezes, and S. Vanstone. Guide to Elliptic Curve Cryptography. Springer-Verlag, 2004.
12. A. K. Lenstra. Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields. In V. Varadharajan, J. Pieprzyk, and Y. Mu, editors, ACISP'97, Volume 1270 of Lecture Notes in Computer Science, pages 127-138. Springer-Verlag, 1997.
13. A. K. Lenstra and E. R. Verheul. The XTR public key system. In M. Bellare, editor, Advances in Cryptography - Crypto'00, Volume 1880 of Lecture Notes in Computer Science, pages 1-19. Springer-Verlag, 2000.
14. M. Matsui Linear Cryptanalysis Method for DES Cipher. In Advances in Cryptology (EUROCRYPT), Springer-Verlag LNCS 765, 386-397, 1993.
15. R.C. Merkle. A Fast Software One-way Hash Function. Journal of Cryptology, 3, 43-58, 1990.
16. K. Rubin and A. Silverberg. Torus-based cryptography. Technical Report 39, IACR's ePrint Archive, 2003.
17. M.-J. O. Saarinen. Security of VSH in the real world. Technical Report 103, IACR's ePrint Archive, 2006.
18. V. Shoup. NTL: A Library for doing Number Theory. Available from: http://www.shoup.net/ntl/
19. M. Stam and A. K. Lenstra. Efficient subgroup exponentiation in quadratic and sixth degree extensions. In J. Burton S. Kaliski, Ç. KoÇ, and C. Paar, editors, CHES'02, Volume 2523 of Lecture Notes in Computer Science, pages 318-332. Springer-Verlag, 2003.
20. X. Wang, H. Yu, and Y. L. Yin. Efficient Collision Search Attacks on SHA-0. In Advances in Cryptology (CRYPTO), Springer-Verlag LNCS 3621, 1-16, 2005.
21. X. Wang, Y. Yin, H. Yu. Finding Collisions in the Full SHA-1. In Advances in Cryptology (CRYPTO), Springer-Verlag LNCS 3621, 7-36, 2005.