Paper 2004/296
Designs of Efficient Secure Large Hash Values
Mridul Nandi
Abstract
A double length hash function is a 2n-bit hash function based on
an n-bit compression function. To increase the security level,
designs of good double length hash functions are important. In
this paper we construct a class of maximally secure double length
hash functions in random oracle model based on some good
permutations. This class contains recently proposed double length
hash functions. We also propose an efficient double length hash function and study its security level in the random oracle model. We prove that any attack algorithm in the random oracle model needs \Omega(2^n/(s^2n^s)) time complexity, where
Metadata
- Available format(s)
- PDF PS
- Publication info
- Published elsewhere. Unknown where it was published
- Contact author(s)
- mridul_r @ isical ac in
- History
- 2005-04-20: revised
- 2004-11-12: received
- See all versions
- Short URL
- https://ia.cr/2004/296
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2004/296, author = {Mridul Nandi}, title = {Designs of Efficient Secure Large Hash Values}, howpublished = {Cryptology {ePrint} Archive, Paper 2004/296}, year = {2004}, url = {https://eprint.iacr.org/2004/296} }