![](bg8.png)
6. The SHA-3 competition has stimulated the re-
search and deepened the scientific understanding
about the design principles of secure hash func-
tions.
7. The current and anticipated technological devel-
opments in the design of recent CPUs open pos-
sibilities for cryptographers to design secure and
significantly more efficient hash functions.
8. An internationally standardized efficient crypto-
graphic hash function does not necessarily need
to be SHA-2, SHA-3 (or SHA-4).
9. An internationally standardized efficient crypto-
graphic hash function can be significantly more
efficient than MD5, SHA-1, SHA-2 and SHA-3.
REFERENCES
ANSI (1998). ANSI X9.31-1998 Digital Signatures Using
Reversible Public Key Cryptography for the Financial
Services Industry (rDSA). American National Stan-
dards Institute. http://csrc.nist.gov/groups/ST/hash/
index.html.
Bernstein, D. J. and Lange, T. (2011). SUPERCOP: Ecrypt
benchmarking of cryptographic systems.
Bosselaers, A., Dogbbertin, H., and Preneel, B. (1997). The
RIPEMD-160 cryptographic hash function. 22(1):24,
26, 28, 78, 80.
Bresson, E., Canteaut, A., Chevallier-Mames, B., Clavier,
C., Fuhr, T., Gouget, A., Icart, T., Misarsky, J.-F., M,
Naya-Plasencia, Paillier, P., Pornin, T., Reinhard, J.-
R., Thuillet, C., and Videau, M. (2008). Shabal. In
Submission to NIST.
Diffie, W. and Hellmann, M. (1976). New directions in
cryptography. In IEEE Trans. on Info. Theory, vol-
ume IT-22, pages 644–654.
Dobbertin, H., Bosselaers, A., and Preneel, B. (1996).
Ripemd-160: A strengthened version of ripemd. In
Gollmann, D., editor, FSE, volume 1039 of Lecture
Notes in Computer Science, pages 71–82. Springer.
Ferguson, N., Lucks, S., Schneier, B., Whiting, D., Bellare,
M., Kohno, T., Callas, J., and Walker, J. (2009). The
skein hash function family. In Submission to NIST
(Round 2).
Fleischmann, E., Forler, C., and Gorski, M. (2008). Clas-
sification of the sha-3 candidates. Cryptology ePrint
Archive, Report 2008/511. http://eprint.iacr.org/.
Gligoroski, D., Klima, V., Knapskog, S. J., El-Hadedy, M.,
Amundsen, J., Mjølsnes, S. F., Jensen, R. E., and Otte,
D. (2009). Cryptographic hash function BLUE MID-
NIGHT WISH. In Submission to NIST (Round 2).
Gligoroski, D., Ødeg˚ard, R. S., Mihova, M., Knapskog,
S. J., Kocarev, L., Dr´apal, A., and Klima, V. (2008).
Cryptographic hash function EDON-R. In Submission
to NIST.
IEEE-SA-Standards-Board (2000). IEEE Std 1363-2000,
IEEE Standard Specifications for Public-Key Cryp-
tography. IEEE Computer Society.
ISO/IEC (2006). ISO/IEC 14888 - Digital signatures with
appendix. ISO/IEC.
Kaliski, B. (April 1992). The md2 message-digest algo-
rithm. In RFC 1319. Network Working Group, RSA
Laboratories.
Levin, L. A. (1987). One-way functions and pseudorandom
generators. In Combinatorica, volume 7, pages 357–
363.
Menasce’, D. A. (2003). Security performance. IEEE In-
ternet Computing, 7(3):84–87.
NEMA (2001). Digital Imaging and Communications in
Medicine (DICOM) - Digital Signatures. National
Electrical Manufacturers Association. ftp:// medi-
cal.nema.org/medical/dicom/final/sup41 ft.pdf.
NIST (1992). Publication YY: Announcement and Specifi-
cations for a Secure Hash Standard (SHS).
NIST (2002). Secure Hash Standard. National Institute
of Standards and Technology, Washington. Federal
Information Processing Standard 180-2.
NIST (2009). Digital Signature Standard (DSS). Federal
Information Processing Standard 186-3.
Preneel, B. (2010). Cryptographic hash functions and the
nist sha-3 competition.
Rivest, R. (April 1992). The md5 message-digest algorithm.
In RFC 1321. Network Working Group, MIT Labo-
ratory for Computer Science and RSA Data Security
Inc.
Rivest, R. (October 1990). The md4 message-digest algo-
rithm. In RFC 1186. Network Working Group, MIT
Laboratory for Computer Science and RSA Data Se-
curity Inc.
Yao, A. (1982). Theory and application of trapdoor func-
tions. In Proceedings of 23rd IEEE Symposium on
Foundations of Computer Science, pages 80–91.
Zheng, Y., Pieprzyk, J., and Seberry, J. (1992). Haval
- a one-way hashing algorithm with variable length
of output. In Seberry, J. and Zheng, Y., editors,
AUSCRYPT, volume 718 of Lecture Notes in Com-
puter Science, pages 83–104. Springer.
INTERNATIONALLY STANDARDIZED EFFICIENT CRYPTOGRAPHIC HASH FUNCTION
433