2009/09/08 by Dhananjoy Dey, Dey, Dhananjoy, Prasanna Raghaw Mishra +5 · 1 citation
Computer Science · Mathematics · #Chaos-based Image/Signal Encryption #Coding theory and cryptography #Commutative Algebra (math.AC) #Cryptographic Implementations and Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #cs.CR #math.AC
paper · pdf · doi:10.48550/arxiv.0909.1392
44 pages including 32 pages appendix (list of polynomials) 2 figures, corrected Surname
openalex publication_date 2009/09/08 · arxiv created 2009/10/05 · arxiv updated 2010/07/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.