Earticle

초록

영어

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 [8] 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 in [6] as well as by Wang et. al. in [25] applied to SHA-0 and SHA-1. We have also compared the efficiency of our HF-hash with SHA-256.

목차

Abstract
 1. Introduction
 2. HF-hash
  1. Initialization
  2. Expansion
  3. Iteration for j = 0 to 63
  4. Intermediate Hash Value
 3. Analysis of HF-hash
  3.1. Properties of HF-hash
  3.2. Efficiency of HF-hash
  3.3. Security Analysis
 4. Conclusions
 References

키워드

저자

• Dhananjoy Dey [ SAG, Metcalfe House, Delhi-110 054, India, Department of Mathematics, Jadavpur University, Kolkata, WB 700 032, India ]
• Prasanna Raghaw Mishra [ SAG, Metcalfe House, Delhi-110 054, India ]
• Indranath Sengupta [ Department of Mathematics, Jadavpur University, Kolkata, WB 700 032, India ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Advanced Science and Technology

• 간기

  월간

• pISSN

  2005-4238

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605