## CryptoDB

### Paper: Multivariates Polynomials for Hashing

Authors: Jintai Ding Bo-Yin Yang URL: http://eprint.iacr.org/2007/137 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2007-13419,
title={Multivariates Polynomials for Hashing},
booktitle={IACR Eprint archive},
keywords={foundations /},
url={http://eprint.iacr.org/2007/137},
note={ ding@math.uc.edu 13621 received 17 Apr 2007},
author={Jintai Ding and Bo-Yin Yang},
year=2007
}