Skip to main content

Advertisement

Springer Nature Link
Log in
Menu
Find a journal Publish with us Track your research
Search
Saved research
Cart
  1. Home
  2. Selected Areas in Cryptography
  3. Conference paper

Impact of Rotations in SHA-1 and Related Hash Functions

  • Conference paper
  • pp 261–275
  • Cite this conference paper
Save conference paper
View saved research
Selected Areas in Cryptography (SAC 2005)
Impact of Rotations in SHA-1 and Related Hash Functions
  • Norbert Pramstaller18,
  • Christian Rechberger18 &
  • Vincent Rijmen18 

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3897))

Included in the following conference series:

  • International Workshop on Selected Areas in Cryptography
  • 1676 Accesses

  • 6 Citations

Abstract

SHA-1 uses a single set of rotation constants within the compression function. However, most other members of the MD4 family of hash functions use multiple sets of rotation constants, i.e. the rotation amounts change with the step being processed.

To our knowledge, no design rationales on the choice of rotation constants are given on any of these hash functions. This is the first paper that analyzes rotations in iterated hash functions. We focus on SHA-1-like hash functions and use recent developments in the analysis of these hash functions to evaluate the security implications of using multiple sets of rotation constants in the compression function instead of a single set. Additionally, we give some observations on the set of constants used in SHA-0 and SHA-1.

The work in this paper has been supported by the Austrian Science Fund (FWF), project P18138.

Download to read the full chapter text

Chapter PDF

Similar content being viewed by others

Collision Attacks on Round-Reduced SHA-3 Using Conditional Internal Differentials

Chapter © 2023

New Records in Collision Attacks on SHA-2

Chapter © 2024

Robust Secure Routing Protocol for Mobile Ad Hoc Networks (MANETs)

Chapter © 2019

Explore related subjects

Discover the latest articles, books and news in related subjects, suggested using machine learning.
  • Algorithms
  • Computational Complexity
  • Cryptology
  • Mathematical Applications in Computer Science
  • Perl
  • Special Functions
  • Algebraic Structures in Cryptographic Function Design

References

  1. Biham, E., Chen, R.: Near-Collisions of SHA-0. In: Franklin, M.K. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 290–305. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Biham, E., Chen, R., Joux, A., Carribault, P., Lemuet, C., Jalby, W.: Collisions of SHA-0 and Reduced SHA-1. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 36–57. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Chabaud, F., Joux, A.: Differential Collisions in SHA-0. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 56–71. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. Joux, A., Carribault, P., Jalby, W., Lemuet, C.: Full iterative differential collisions in SHA-0 (2004) (preprint)

    Google Scholar 

  5. KCDSA Task Force Team. The Korean Certificate-based Digital Signature Algorithm (1998), Available at: http://grouper.ieee.org/groups/1363/P1363a/contributions/kcdsa1363.pdf

  6. Klima, V.: Finding MD5 Collisions on a Notebook PC Using Multi-message Modifications (2005) (preprint), Available at: http://eprint.iacr.org/2005/102

  7. Leon, J.S.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Transactions on Information Theory 34(5), 1354–1359 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lim, C.H.: The revised version of KCDSA (2000) (unpublished manuscript), Available at: http://dasan.sejong.ac.kr/~chlim/pub/kcdsa1.ps

  9. Lim, C.H., Lee, P.J.: A Study on the Proposed Korean Digital Signature Algorithm. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 175–186. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  10. Lloyd, J.: A Description of HAS-160 (2003), Available at: http://www.randombit.net/papers/has160.html

  11. National Institute of Standards and Technology (NIST). FIPS-180-2: Secure Hash Standard (August 2002), Available online at: http://www.itl.nist.gov/fipspubs/

  12. Park, N.K., Hwang, J.H., Lee, P.J.: HAS-V: A New Hash Function with Variable Output Length. In: Stinson, D.R., Tavares, S. (eds.) SAC 2000. LNCS, vol. 2012, pp. 202–216. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Pramstaller, N., Rechberger, C., Rijmen, V.: Exploiting Coding Theory for Collision Attacks on SHA-1. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 78–95. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Rabaey, J.M.: Digital Integrated Circuits. Prentice-Hall, Englewood Cliffs (1996)

    Google Scholar 

  15. Rijmen, V., Oswald, E.: Update on SHA-1. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 58–71. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. TTA. Digital Signature Mechanism with Appendix - Part 2: Certificate-based Digital Signature Algorithm, TTAS.KO-12.0011/R1 (2000)

    Google Scholar 

  17. TTA. Hash Function Standard - Part 2: Hash Function Algorithm Standard (HAS- 160), TTAS.KO-12.0011/R1 (2000)

    Google Scholar 

  18. Wang, X., Lai, X., Feng, D., Chen, H., Yu, X.: Cryptanalysis of the hash functions MD4 and RIPEMD. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 1–18. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  19. Wang, X., Yin, Y.L., Yu, H.: Finding Collisions in the Full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 17–36. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  20. Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 19–35. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  21. Wang, X., Yu, H., Yin, Y.L.: Efficient Collision Search Attacks on SHA-0. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 1–16. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Applied Information Processing and Communications (IAIK), Graz University of Technology, Austria

    Norbert Pramstaller, Christian Rechberger & Vincent Rijmen

Authors
  1. Norbert Pramstaller
    View author publications

    Search author on:PubMed Google Scholar

  2. Christian Rechberger
    View author publications

    Search author on:PubMed Google Scholar

  3. Vincent Rijmen
    View author publications

    Search author on:PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium

    Bart Preneel

  2. Department of Electrical and Computer Engineering, Queen’s University Kingston, K7L 3N6, Kingston, Ontario, Canada

    Stafford Tavares

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pramstaller, N., Rechberger, C., Rijmen, V. (2006). Impact of Rotations in SHA-1 and Related Hash Functions. In: Preneel, B., Tavares, S. (eds) Selected Areas in Cryptography. SAC 2005. Lecture Notes in Computer Science, vol 3897. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11693383_18

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/11693383_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33108-7

  • Online ISBN: 978-3-540-33109-4

  • eBook Packages: Computer ScienceComputer Science (R0)Springer Nature Proceedings Computer Science

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Keywords

  • Boolean Function
  • Hash Function
  • Rotation Constant
  • Compression Function
  • Variable Rotation

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us

Policies and ethics

Profiles

  1. Vincent Rijmen View author profile

Search

Navigation

  • Find a journal
  • Publish with us
  • Track your research

Footer Navigation

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Journal finder
  • Publish your research
  • Language editing
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our brands

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Discover

Corporate Navigation

  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support
  • Legal notice
  • Cancel contracts here

162.0.217.198

Not affiliated

Springer Nature

© 2026 Springer Nature