CRYPTOGRAPHIC KEY COMMUNICATION PROTOCOL USING ELLIPTIC CURVE OVER FINITE FIELD WITH NESTED CONSTRUCTION OF HASH MESSAGE AUTHENTICATION CODE

Main Article Content

CH SUNEETHA
D.Sravana Kumar
P. Sirisha

Abstract

As the internet is the basic means of communication nowadays confirming the integrity and authenticity of the received data is a prime necessity in communication network. The present paper explores the key communication protocol from one entity to the other rather than sharing the part of the key by both the entities using elliptic curve over finite field. In addition one Nested construction of Hash Message Authentication Code (NMAC) is tagged to the communicated key that guards the communicated key for verification using cartographic hash function. The protocol designed here is more suitable for communicating high secured pass words and PIN numbers in monetary transactions

Downloads

Download data is not yet available.

Article Details

Section
Articles
Author Biography

CH SUNEETHA, GITAM UNIVERSITY VISAKHAPATNAM, INDIA

MATHEMATICS, ASSOCIATE PROFESSOR

References

B. Preneel and P. Van Oorschot On the security of two MAC algorithms Advanes in Cryptology EUROCRYPT 96, Proceedings Lecture Notes in Computer Science Vol. 1070 U. Maurer ed., Springer Verlag 1996.

A. Menzes, P. Van Oorschot and S. Vanstone Hand book of Applied Cryptography CRC Press 1997.

B. Song and K. Kim Two- pass Authenticated Key agreement protocol with key confirmation Progress in Cryptology INDOCRYPT LNCS 1977 Springer – Verlag pp 237-249, December 2000.

Simon Blake-Wilson, Don Johnson, Alfred Menezes “Key agreement protocols and their security analysisâ€, IMA International Conference on Cryptography and Coding

ANSI X9.63-1997, Elliptic Curve Key Agreement and Key Transport Protocols, October 1997, working draft.

B. den Boer, A. Bosselaeres, “Collosions for the Compression function of MD 5†Advances in Cryptology EUROCRYPT ’ 93 proceedings Springer – Verlag 1994.

X.Y. wang, F.D. Guo, X.J. Lai, H.B. Yu “Collisions for Hash functions MD 4, MD 5 HAVEL -128 and RIPEMD, rump session of CRYPTO’04 E-print 2004

“Hash Functions in Cryptography†Master of Science thesis Joseph Sterling Grah submitted to University I Bergen June 2008.

Junko Nakajima and Mitsuramatsui “Performnce Analysis and Parallel Implementation of dedicated hash functions†Proc. Of EUROCRYPT 2002 Lecture Notes in Computer Science 2332 Springer pp165-180 2002

Narn-Yih Lee, Chein – Nan Wu, “Authenticated multiple key exchange protocols based on Elliptic curves and blinear pairings†Computers & Electrical Engineering Volume 34, Issue 1, January 2008, Pages 12-20

Smart N.P. “The Discrete Logarithm on Problem on Elliptic Curve of Trace one†Journa of Cryptology 1999 Vol. 12, No.3, Page 193-196.