1. [1] X. Wang and H. Yu, “How to break MD5 and other hash functions,” Advances in Cryptology — EUROCRYPT 2005, ed. R. Cramer, vol.3494 of Lect. Notes Comput. Sci., pp.19-35, Springer-Verlag, Berlin, Heidelberg, New York, 2005.
2. [2] X. Wang, Y.L. Yin, and H. Yu, “Finding collisions in the full SHA-1,” Advances in Cryptology — CRYPTO 2005, ed. V. Shoup, vol.3621 of Lect. Notes Comput. Sci., pp.17-36, Springer-Verlag, Berlin, Heidelberg, New York, 2005.
3. [3] U.S. Department of Commerce, National Institute of Standards and Technology: “Federal Register /Vol. 72, no. 212/Friday, Nov. 2, 2007/Notices” (2007). http://csrc.nist.gov/groups/ST/hash/documents/FR_Notice_Nov07.pdf
4. [4] S. Hirose, H. Kuwakado, and H. Yoshida, “SHA-3 proposal: Lesamnta,” Lesamnta home page (2009). Document version 1.0.1, Date: 15 Jan. 2009, http://www.hitachi.com/rd/yrl/crypto/lesamnta/
5. [5] S. Hirose, K. Ideguchi, H. Kuwakado, T. Owada, B. Preneel, and H. Yoshida, “A lightweight 256-bit hash for hardware and low-end devices: Lesamnta-LW,” ICISC 2010, ed. K.H. Rhee and D. Nyang, vol.6829 of Lect. Notes Comput. Sci., pp.151-168, Berlin, Heidelberg, New York, 2011.