Hashing with polynomials

  • Authors:
  • Vladimir Shpilrain

  • Affiliations:
  • Department of Mathematics, The City College of New York, New York, NY

  • Venue:
  • ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.