원문정보
보안공학연구지원센터(IJAST)
International Journal of Advanced Science and Technology
Vol.37
2011.12
pp.129-140
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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
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
저자정보
참고문헌
자료제공 : 네이버학술정보