HF哈希：使用受限HFE的哈希函数挑战-1
HF-hash : Hash Functions Using Restricted HFE Challenge-1
摘要：
专用散列函数易受各种攻击，这使得设计散列函数的任务更具挑战性。这为我们设计一种新的密码哈希函数HF-哈希提供了强大的动力。这是一个散列函数，其压缩函数是通过使用HFE挑战-1的前32个多项式（具有64个变量）并强制剩余16个变量为零来设计的。HF-hash给出256位的消息摘要，与SHA-256一样有效。它是安全的，对差分攻击提出的Chabaud和Joux以及由王等。SHA-0和SHA-1。
英文摘要：
Vulnerability of dedicated hash functions to various attacks has made the task of designing hash function much more challenging. This provides us a strong motivation to design a new cryptographic hash function viz. HF-hash. This is a hash function, whose compression function is designed by using first 32 polynomials of HFE Challenge-1 with 64 variables by forcing remaining 16 variables as zero. HF-hash gives 256 bits message digest and is as efficient as SHA-256. It is secure against the differential attack proposed by Chabaud and Joux as well as by Wang et. al. applied to SHA-0 and SHA-1.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
