Abstract
In this short note we will introduce a generic measure of the algebraic complexity of vector valued Boolean functions: Normalized Average Number of Terms (NANT). NANT can be considered as a tool that extracts those vector valued Boolean functions that are suitable for effective application of Gröbner bases. As an example, we use NANT to show clear differences between two popular cryptographic hash functions: SHA-1 and SHA-2. The obtained results show that SHA-1 is susceptible to attacks based on Gröbner bases, which lead us to believe that SHA-1 is much weaker than SHA-2 from a design point of view.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Biham and R. Chen, Near-collision of SHA-0, Proc. of CRYPTO 2004 (M. Franklin, ed.), LNCS, vol. 3152, Springer, Berlin, 2004, p. 290.
E. Biham, R. Chen, A. Joux, P. Carribault, C. Lemuet, and W. Jalby, Collisions of SHA-0 and reduced SHA-1, Proc. of EUROCRYPT 2005, LNCS, vol. 3494, Springer, Berlin, 2005, pp. 36–57.
J. C. Faugère and A. Joux, Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gröbner bases, LNCS, vol. 2729, Springer, Berlin, 2003, pp. 44–60.
B. Preneel, R. Govaerts, and J. Varitlevalle, Boolean functions satisfying higher order propagation criteria, Proc. of EUROCRYPTO1991, LNCS, vol. 547, Springer, Berlin, 1991, pp. 141–152.
C. Qu, J. Seberry, and T. Xia, Boolean Functions in Cryptography, 2001, http://citeseer.ist.psu.edu/qu01boolean.html.
I. Simonetti, On the non-linearity of Boolean functions, this volume, 2009, pp. 409–413.
X. Wang, Y. L. Yin, and H. Yu, Finding collisions in the full SHA-1, Proc. of CRYPTO 2005, LNCS, vol. 3621, Springer, Berlin, 2005a, pp. 17–36.
X. Wang, H. Yu, and Y. L. Yin, Efficient collision search attacks on SHA-0, Proc. of CRYPTO 2005, LNCS, vol. 3621, Springer, Berlin, 2005b, pp. 1–16.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gligoroski, D., Markovski, S., Knapskog, S.J. (2009). A New Measure to Estimate Pseudo-Randomness of Boolean Functions and Relations with Gröbner Bases. In: Sala, M., Sakata, S., Mora, T., Traverso, C., Perret, L. (eds) Gröbner Bases, Coding, and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93806-4_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-93806-4_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-93805-7
Online ISBN: 978-3-540-93806-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)