Multivariates Polynomials for Hashing

Jintai Ding; Bo-yin Yang

Paper 2007/137

Multivariates Polynomials for Hashing

Jintai Ding and Bo-yin Yang

Abstract

We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function, whose security relies on simple hard questions. We analyze some security properties and potential feasibility, where the compression functions are randomly chosen high-degree polynomials. Next, we propose to improve on the efficiency of the system by using some specially designed polynomials using composition of maps and certain sparsity property, where the security of the system would then relies on stronger assumptions.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): ding @ math uc edu
History: 2007-04-18: received
Short URL: https://ia.cr/2007/137
License: CC BY

BibTeX

@misc{cryptoeprint:2007/137,
      author = {Jintai Ding and Bo-yin Yang},
      title = {Multivariates Polynomials for Hashing},
      howpublished = {Cryptology {ePrint} Archive, Paper 2007/137},
      year = {2007},
      url = {https://eprint.iacr.org/2007/137}
}