Skip to main content
SpringerLink
Log in

A Parallel Algorithm for Extending Cryptographic Hash Functions

(Extended Abstract)

  • Conference paper
  • First Online:
Book cover Progress in Cryptology — INDOCRYPT 2001 (INDOCRYPT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2247))

Included in the following conference series:

Abstract

We describe a parallel algorithm for extending a small domain hash function to a very large domain hash function. Our construction can handle messages of any practical length and preserves the security properties of the basic hash function. The construction can be viewed as a parallel version of the well known Merkle-DamIEqgard construction, which is a sequential construction. Our parallel algorithm provides a significant reduction in the computation time of the message digest, which is a basic operation in digital signatures.

This research supported by a grant from the Mathematics of Information Technology and Complex Systems (MITACS) project.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bellare and P. Rogaway. Collision-resistant hashing: towards making UOWHFs practical. Proceedings of CRYPTO 1997, pp 470–484.

    Google Scholar 

  2. I. B. Damgard. A design principle for hash functions. Lecture Notes in Computer Science, 435 (1990), 416–427 (Advances in Cryptology-CRYPTO’89).

    Google Scholar 

  3. R. C. Merkle. One way hash functions and DES. Lecture Notes in Computer Science, 435 (1990), 428–226 (Advances in Cryptology-CRYPTO’89).

    Google Scholar 

  4. I. Mironov. Hash functions: from Merkle-Damgard to Shoup. Lecture Notes in Computer Science, 2045 (2001), 166–181 (Advances in Cryptology-EUROCRYPT’01).

    Google Scholar 

  5. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic aplications. Proceedings of the 21st Annual Symposium on Theory of Computing, ACM, 1989, pp. 33–43.

    Google Scholar 

  6. B. Preneel. The state of cryptographic hash functions. Lecture Notes in Computer Science, 1561 (1999), 158–182 (Lectures on Data Security: Modern Cryptology in Theory and Practice).

    Google Scholar 

  7. P. Sarkar and P. J. Schellenberg. A parallel algorithm for extending cryptographic hash functions. CACR Technical Report, University of Waterloo, http://www.cacr.math.uwaterloo.ca

  8. D. R. Stinson. Some observations on the theory of cryptographic hash functions. IACR preprint server, http://eprint.iacr.org/2001/020/.

  9. D. R. Stinson. Cryptography: Theory and Practice, CRC Press, 1995.

    Google Scholar 

  10. M. N. Wegman and J. L. Carter. New Hash Functions and Their Use in Authentication and Set Equality. Journal of Computer and System Sciences, 22(3): 265–279 (1981)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, 200, University Avenue West, N2L 3G1, Waterloo, Ontario, Canada

    Palash Sarkar & Paul J. Schellenberg

Authors
  1. Palash Sarkar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paul J. Schellenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai, India

    C. Pandu Rangan

  2. Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong

    Cunsheng Ding

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sarkar, P., Schellenberg, P.J. (2001). A Parallel Algorithm for Extending Cryptographic Hash Functions. In: Rangan, C.P., Ding, C. (eds) Progress in Cryptology — INDOCRYPT 2001. INDOCRYPT 2001. Lecture Notes in Computer Science, vol 2247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45311-3_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45311-3_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43010-0

  • Online ISBN: 978-3-540-45311-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation