Multivariates Polynomials for Hashing

  • Jintai Ding
  • Bo-Yin Yang
Conference paper

DOI: 10.1007/978-3-540-79499-8_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4990)
Cite this paper as:
Ding J., Yang BY. (2008) Multivariates Polynomials for Hashing. In: Pei D., Yung M., Lin D., Wu C. (eds) Information Security and Cryptology. Inscrypt 2007. Lecture Notes in Computer Science, vol 4990. Springer, Berlin, Heidelberg


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 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jintai Ding
    • 1
  • Bo-Yin Yang
    • 2
  1. 1.University of Cincinnati and Technische Universität Darmstadt 
  2. 2.Institute of Information Science, Academia Sinica 

Personalised recommendations