Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal


TitleA new measure to estimate pseudo-randomness of Boolean functions and relations with Gr\"obner bases.
Author(s) Danilo Gligoroski, Svein Johan Knapskog, Smile Markovski
TypeBook, Chapter in Book, Conference Proceeding
AbstractIn 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.
KeywordsNANT, Hash, SHA-1, SHA-2
ISBN978-3-540-93805-7/hbk; 978-3-5
URL http://link.springer.com/chapter/10.1007%2F978-3-540-93806-4_32
PublisherBerlin: Springer
Translation No
Refereed No