MathSciDoc: An Archive for Mathematician ∫

 
Log In
Sign Up
Help
Go
 

Multivariates Polynomials for Hashing

Jintai Ding University of Cincinnati and Technische Universit¨at Darmstadt Bo-Yin Yang Institute of Information Science, Academia Sinica

TBD mathscidoc:2207.43029

Inscrypt 2007, 358-371, 2007.8
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.
No keywords uploaded!
[ Download ] [ 2022-07-11 12:59:59 uploaded by dingjt ] [ 687 downloads ] [ 0 comments ] 
@inproceedings{jintai2007multivariates,
  title={Multivariates Polynomials for Hashing},
  author={Jintai Ding, and Bo-Yin Yang},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220711125959648352606},
  booktitle={Inscrypt 2007},
  pages={358-371},
  year={2007},
}
Jintai Ding, and Bo-Yin Yang. Multivariates Polynomials for Hashing. 2007. In Inscrypt 2007. pp.358-371. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220711125959648352606.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved