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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Ding, J., & Yang, B. Y. (2008). Multivariates polynomials for hashing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4990 LNCS, pp. 358–371). https://doi.org/10.1007/978-3-540-79499-8_28
Mendeley helps you to discover research relevant for your work.