Information Security and Cryptology

Volume 4990 of the series Lecture Notes in Computer Science pp 358-371

Multivariates Polynomials for Hashing

  • Jintai DingAffiliated withUniversity of Cincinnati and Technische Universität Darmstadt
  • , Bo-Yin YangAffiliated withInstitute of Information Science, Academia Sinica

* Final gross prices may vary according to local VAT.

Get Access


We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security properties and potential feasibility, where the compression functions are randomly chosen high-degree polynomials, and show that under some plausible assumptions, high-degree polynomials as compression functions has good properties. Next, we propose to improve on the efficiency of the system by using some specially designed polynomials generated by a small number of random parameters, where the security of the system would then relies on stronger assumptions, and we give empirical evidence for the validity of using such polynomials.


hash function multivariate polynomials sparse