(Pseudo) Preimage Attack on Round-Reduced Grøstl Hash Function and Others (Extended Version)

@article{Wu2012PseudoPA,
  title={(Pseudo) Preimage Attack on Round-Reduced Gr\ostl Hash Function and Others (Extended Version)},
  author={Shuang Wu and Dengguo Feng and Wenling Wu and Jian Guo and Gaipeng Kong and Jian Zou},
  journal={IACR Cryptology ePrint Archive},
  year={2012},
  volume={2012},
  pages={206}
}
The Grøstl hash function is one of the 5 final round candidates of the SHA-3 competition hosted by NIST. In this paper, we study the preimage resistance of the Grøstl hash function. We propose pseudo preimage attacks on Grøstl hash function for both 256-bit and 512-bit versions, i.e., we need to choose the initial value in order to invert the hash function. Pseudo preimage attack on 5(out of 10)-round Grøstl-256 has a complexity of (2 , 2) (in time and memory) and pseudo preimage attack on 8… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

The whirlpool hashing function

  • Paulo S.L.M. Barreto, Vincent Rijmen
  • Submission to NESSIE,
  • 2000
Highly Influential
11 Excerpts

Updated Differential Analysis of Grøstl

  • Martin Schläffer
  • Grøstl website,
  • 2011
2 Excerpts

New Non-Ideal Properties of AES-Based Permutations: Applications to ECHO and Grøstl

  • Yu Sasaki, Yang Li, Lei Wang, Kazuo Sakiyama, Kazuo Ohta
  • In ASIACRYPT,
  • 2010
2 Excerpts

Similar Papers

Loading similar papers…