Abstract
Efficient hashing is a centerpiece of modern cryptography. The progress in computing technology enables us to use 64-bit machines with the promise of 128-bit machines in the near future. To exploit fully the technology for fast hashing, we need to be able to design cryptographically strong Boolean functions in many variables which can be evaluated faster using partial evaluations from the previous rounds. We introduce a new class of Boolean functions whose evaluation is especially efficient and we call them rotation symmetric. Basic cryptographic properties of rotation-symmetric functions are investigated in a broader context of symmetric functions. An algorithm for the design of rotation-symmetric functions is given and two classes of functions are examined. These classes are important from a practical point of view as their forms are short. We show that shortening of rotation-symmetric functions paradoxically leads to more expensive evaluation process.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Antoon Bosselaers, René Govaerts, and Joos Vandewalle. Fast hasing on the Pentium. In L. Koblitz, editor, Advances in Cryptology — CRYPTO'96, pages 298–312. Springer, 1996. Lecture Notes in Computer Science No. 1109.
H. Dobbertin. Cryptanalysis of MD4. In Fast Software Encryption, Lecture Notes in Computer Science, Vol. 1039, D.Gollmann (Ed.), pages 71–82. Springer-Verlag, 1996.
H. Dobbertin. Cryptanalysis of MD5 compress. Announcement on Internet, May 1996.
H. Feistel. Cryptography and computer privacy. Scientific American, 228:15–23, May 1973.
C. Fontaine. The nonlinearity of a class of boolean functions with short representation. In J. Pribyl, editor, Proceedings of PRAGOCRYPT96, pages 129–144. CTU Publishing House, 1996.
R. Forré. The strict avalanche criterion: Spectral properties of boolean functions and an extended definition. In S. Goldwasser, editor, Advances in Cryptology — CRYPTO'88, pages 450–468. Springer-Verlag, 1988. Lecture Notes in Computer Science No. 403.
M. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
F.J. MacWilliams and N.J.A. Sloane. The theory of error-correcting codes. North-Holland, Amsterdam, 1977.
W. Meier and O. Staffelbach. Nonlinearity criteria for cryptographic functions. In J.-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology — EUROCRYPT'89, pages 549–562. Springer-Verlag, 1990. Lecture Notes in Computer Science No. 434.
A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, Boca Raton, 1997.
K. Nyberg. On the construction of highly nonlinear permutations. In R.A. Rueppel, editor, Advances in Cryptology — Eurocrypt '92, pages 92–98, Berlin, 1993. Springer-Verlag.
K. Nyberg. Generalized feistel networks. In K. Kim and T. Matsumoto, editors, Advances in Cryptology — ASIACRYPT'96, volume 1163 of Lecture Notes in Computer Science, pages 91–104, Berlin, 1996. Springer.
J. Pieprzyk. Bent permutations. In G. Mullen and P. Shiue, editors, Lecture Notes in Pure and Applied Mathematics, Vol 141, Proceedings of 1st International Conference on Finite Fields, Coding Theory, and Advances in Communications and Computing, Las Vegas, 1991, 1992.
B. Preneel. Analysis and design of cryptographic hash functions. PhD thesis, Katholieke Universiteit Leuven, 1993.
B. Preneel, W. Van Leekwijck, L. Van Linden, R. Govaerts, and J. Vandewalle. Propagation characteristics of Boolean functions. In I.B. Damgård, editor, Advances in Cryptology — Eurocrypt '90, pages 161–173, Berlin, 1991. Springer-Verlag.
Ronald L. Rivest. The MD4 message digest algorithm. Technical Report MIT/LCS/TM-434, MIT Laboratory for Computer Science, October 1990.
Ronald L. Rivest. The MD5 message-digest algorithm. Internet Request for Comments, April 1992. RFC 1321.
M.J.B. Robshaw. MD2, MD4, MD5, SHA and other hash functions. Technical Report TR 101, RSA Laboratories, July 1994.
B.E. Sagan. The Symmetric Group: Representations, Combinatorial Algorithms, and Symmtric Functions. Wadsworth & Brooks, 1991.
Bruce Schneier. Applied Cryptography. John Wiley &: Sons, 1996.
Jennifer Seberry, Xian-Mo Zhang, and Yuliang Zheng. Nonlinearly balanced boolean functions and their propagation characteristics. In Douglas R. Stinson, editor, Advances in Cryptology — CRYPTO'93, pages 49–60. Springer, 1994. Lecture Notes in Computer Science No. 773.
C. E. Shannon. Communication theory of secrecy systems. Bell Sys. Tech. J., 28:657–715, 1949.
D.R. Stinson. Cryptography: Theory and Practice. CRC Press, 1995.
Y. Zheng, J. Pieprzyk, and J. Seberry. HAVAL — a one-way hashing algorithm with variable length of output. In J. Seberry and Y. Zheng, editors, Advances in Cryptology — Auscrypt '92, pages 83–104, Berlin, 1993. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pieprzyk, J., Qu, C.X. (1998). Rotation-symmetric functions and fast hashing. In: Boyd, C., Dawson, E. (eds) Information Security and Privacy. ACISP 1998. Lecture Notes in Computer Science, vol 1438. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053731
Download citation
DOI: https://doi.org/10.1007/BFb0053731
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64732-4
Online ISBN: 978-3-540-69101-3
eBook Packages: Springer Book Archive