Volume 49 | Number 4 | Year 2017 | Article Id. IJMTT-V49P533 | DOI : https://doi.org/10.14445/22315373/IJMTT-V49P533
CH. Suneetha, D. Sravana Kumar, P. Sirisha, KM.Sandeep, "Security and Authentication Architecture of block cipher using Mathematical operation and one-way hash function," International Journal of Mathematics Trends and Technology (IJMTT), vol. 49, no. 4, pp. 226-231, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V49P533
[1] Bart PRENEEL, “Analysis and Design of Cryptographic Hash Functions," Doctoral dissertation, February 2003.
[2] Y. Zheng, T. Matsumoto, and H. Imai, “Structural properties of one-way hash functions,” Advances in Cryptology, Proc. Crypto‟90, LNCS 537 , S. Vanstone,Ed., Springer-Verlag, 1991, pp. 285–302.
[3] B. den. Boer, A. Bosselaers. Collisions for the compression function of MD5, Advances in Cryptology, Eurocrypt‟93 Proceedings, Springer-Verlag, 1994.
[4] Mihir Bellare, Joe Kilian, Phillip Rogaway, “The Security of the Cipher Block Chaining Message Authentication Code”, Journal of Computer and System Sciences, 61-362 – 399 , 2000.
[5] M Bellare, R Canetti, H Krawczyk, “Keying hash functions for message authentication”, Crypto, 1996 - Springer.
[6] John Black, Phillip Rogaway, and Tom Shrimpton, “Black box analysis of the block-cipher-based hash-functions constructions from PGV” Proc. of CRYPTO‟02, Lecture Notes in Computer Science 2442, Springer, pp. 320–335, 2002.
[7] Magnus Daum and Stefan Lucks, “Attacking hash functions by poisoned messages,” EUROCRYPT rump session, 2005. Available from www.cits.rub.de/MD5Collisions/.
[8] Daniel R. Simon, “Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?” Proc. of EUROCRYPT‟98, Lecture Notes in Computer Science 1403, Springer, pp. 334–345, 1998. Available from research. microsoft.com/crypto/dansimon/me.html.
[9] Areej Omar Baalghusun, Olfa Fahad Abusalem, Zahra Abbas Al Abbas, Jayaprakash Kar, “Authenticated Key Agreement Protocols: A Comparative Study, Journal of Information Security, 2015, 6, 51-58.
[10] Abdalla, M and M.Bellare,2000. “Increasing the lifetime of a key: A comparative analysis for the security of rekeying techniques” proceeding of Asiacrypt2000,ser LNCC,t.okamoto,Ed,vol,1976,springer verlag.
[11] A text book of Applied Cryptography by Bruce Schneier, John Wiley & Sons.
[12] ISO/IEC 9797, “Information technology Data cryptographic techniques – Data integrity mechanisms using a cryptographic check function employing a block cipher algorithm,” 1993.
[13] Elena Andreeva, Bart Mennink, and Bart Preneel, “Security Reductions of the Second Round SHA-3 Candidates. In ISC '11, volume 6531 of LNCS, pages 39{53. Springer- Verlag, 2011.
[14] Ilya Mironov,Hash functions:Theory,attacks and applications,Microsoft Research,Silicon Valley Campus,2005.
[15] Antoine Joux,”Multicollisions in iterated hash functions. Application to cascaded constructions”, Proc.of CRYPTO 2004, LNCS 3152, Springer, pp.306-316, 2004.