Abstract
Today, there is a need for one-way hash-functions, particularly for use in digital signatures [1]. Following R.S. Winternitz [2], we define that H is a one-way hash-function if it maps messages of arbitrary length to some small fixed length, such that it is computationally infeasible to find two different messages M and M′ hashing to the same value H(M) = H(M′). Now, if Alice wishes to sign M using for example the public-key system RSA, she submits H(M) to her secret function SAlice, and the signature of M is Sig = SAlice [H(M)]. The functions H and PAlice (her RSA public function) being public, anybody who received the plain message M along with its signature Sig, is able to verify the signature by matching PAlice(Sig) against H(M). The one-way property of H is not the only one required [3], but is the essential one: it prevents anybody (including Alice) from claiming that Sig is Alice’s signature of a message M′, different from M.
Download to read the full chapter text
Chapter PDF
References
Pinkas, D., “The need for a Standardized Compression Algorithm for Digital Signatures”, presented at Eurocrypt 86.
Winternitz, R.S., “Producing a One-way Hash Function from DES”, Advances in Cryptology, Proceedings of Crypto 83, ed. D. Chaum, Plenum Press, New York, 1984, pp.203–207.
Denning, D.E., “Digital Signatures with RSA and Other Public-Key Cryptosystems”, CACM, Vol. 27, No4, April 84, pp. 388–392.
Rabin, M., “Digital Signatures”, Foundations of Secure Computation, Academic Press, New York, 1978.
Davies, D.W., “Applying the RSA Signature to Electronic Mail”, Computer, 1983.
Akl, S.G., “On the Security of Compressed Encodings”, Advances in Cryptology, Proceedings of Crypto 83, ed. D. Chaum, Plenum Press, New York, 1984, pp.209–230.
Coppersmith, D., “Another Birthday Attack”, Advances in Cryptology, Crypto’ 85 Proceedings, Lecture Notes in Computer Science, Vol.218, Springer-Verlag, Berlin, 1986, pp. 14–17.
Davies, D.W. and Price, W.L., “Digital Signatures, an update”, Proceedings of the International Conference on Computer Communications, Sydney, October 1984, pp. 845–849.
“Modes of Operations and Hash-functions”, ISO/TC97/SC2O/WG2/N31, July 1985.
“OSIS Security Aspects”, OSIS European Working Group WG1, Final report, October 1985.
Jueneman, R.R., Matyas, S.M. and Meyer, C.H., “Message Authentication with Manipulation Detection Codes”, Proceedings of Security & Privacy, 1983, IEEE Catalog No 83CH1882-0, pp. 33–54.
De Jonge, W. and Chaum, D., “Attacks on some RSA Signatures”, Advances in Cryptology, Crypto’ 85 Proceedings, Lecture Notes in Computer Science, Vol. 218, Springer-Verlag, Berlin, 1986, pp. 18–27.
Riesel, H., “Prime numbers and computer methods for factorization”, Progress in Mathematics, vo1.57, 1985, Birkaüser Ed., pp.300–317.
“The Directory-Authentication Framework”, CCITT/SGVII/Q35 Draft Recommendation X 509, June 1987.
“The Directory-Authentication Framework”, ISO/TC97/SC21 DP 9594/8, June 1987.
Pailles, J.C. and Girault, M., “The security processor CRIPT”, Preprints of the 4th IFIP’SEC, Monte-Carlo, December 2–4, 1986, pp.127–139.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Girault, M. (1988). Hash-Functions Using Modulo-N Operations. In: Chaum, D., Price, W.L. (eds) Advances in Cryptology — EUROCRYPT’ 87. EUROCRYPT 1987. Lecture Notes in Computer Science, vol 304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39118-5_20
Download citation
DOI: https://doi.org/10.1007/3-540-39118-5_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19102-5
Online ISBN: 978-3-540-39118-0
eBook Packages: Springer Book Archive