Skip to main content

HCC: A hash function using error correcting codes

  • Conference paper
  • First Online:
  • 148 Accesses

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

Abstract

After studying the constraints related to the use of error correcting codes as hash functions, this document introduces a hash function HCC (hash with codes and correlations) having a ’divide and conquer’ approach for calculating the hash, while having an exponential complexity for the search of collisions. Possible generalizations are also sketched.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.R. Garey, D.S. Johnson Computers and intractability. A guide to the theory of NP completeness. Freeman and Co, 1979.

    Google Scholar 

  2. D.R. Stinson Cryptography theory and practice., CRC Press 1995.

    Google Scholar 

  3. D. Chaum, E. Van Heist and B. Pfitzman Cryptographically strong undeniable signatures, unconditionnaly secure for the signer. LNCS 576 (1992) CRYPTO '91.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Michael Darnell

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harari, S. (1997). HCC: A hash function using error correcting codes. In: Darnell, M. (eds) Crytography and Coding. Cryptography and Coding 1997. Lecture Notes in Computer Science, vol 1355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024455

Download citation

  • DOI: https://doi.org/10.1007/BFb0024455

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63927-5

  • Online ISBN: 978-3-540-69668-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics