A New Measure to Estimate Pseudo-Randomness of Boolean Functions and Relations with Gröbner Bases

Danilo Gligoroski (), Smile Markovski () and Svein Johan Knapskog ()
Additional contact information
Danilo Gligoroski: Norwegian University of Science and Technology, Centre for Quantifiable Quality of Service in Communication Systems
Smile Markovski: “Ss Cyril and Methodius” University, Faculty of Natural Sciences and Mathematics, Institute of Informatics
Svein Johan Knapskog: Norwegian University of Science and Technology, Centre for Quantifiable Quality of Service in Communication Systems

A chapter in Gröbner Bases, Coding, and Cryptography, 2009, pp 421-425 from Springer

Abstract: 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.

Keywords: NANT; Hash; SHA-1; SHA-2 (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-93806-4_32

Ordering information: This item can be ordered from
http://www.springer.com/9783540938064

DOI: 10.1007/978-3-540-93806-4_32

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().