Information Security and Cryptology – ICISC 2006

Volume 4296 of the series Lecture Notes in Computer Science pp 22-28

Hashing with Polynomials

  • Vladimir ShpilrainAffiliated withDepartment of Mathematics, The City College of New York

* Final gross prices may vary according to local VAT.

Get Access


In this paper, we explore potential mathematical principles and structures that can provide the foundation for cryptographic hash functions, and also present a simple and efficiently computable hash function based on a non-associative operation with polynomials over a finite field of characteristic 2.