D. SRAVANA KUMAR, CH. SUNEETHA and A.CHANDRASEKHAR (2012) CRYPTOGRAPHIC PROTOCOLS USING ELLIPTIC CURVE OVER FINITE FIELDS

getCITED

Home Search Add Content Reports Help

Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations

Add to Bookstack | Show Bookstack | Change Bookstack

CRYPTOGRAPHIC PROTOCOLS USING ELLIPTIC CURVE OVER FINITE FIELDS

Post a Comment

CONTRIBUTORS:

	Author:	D. SRAVANA KUMAR
	Author:	CH. SUNEETHA
	Author:	A.CHANDRASEKHAR

JOURNAL:

International Journal of Engineering Science and Technology (IJEST), 4(1), 81 - 86.

YEAR:

2012

PUB TYPE:

Journal Article

SUBJECT(S):

Elliptic Curve Cryptography, public-key, secret key, encryption, decryption

DISCIPLINE:

Engineering and Applied Sciences

HTTP:

http://www.ijest.info/docs/IJEST12-04-01-097.pdf

LANGUAGE:

English

PUB ID:

103-500-270 (Last edited on 2012/01/31 23:18:08 US/Mountain)

SPONSOR(S):

ABSTRACT:
Cryptology is the study of techniques for ensuring the secrecy and authentication of the information. Public –key encryption schemes are secure only if the authenticity of the public-key is assured. Elliptic curve arithmetic can be used to develop a variety of elliptic curve cryptographic (ECC) schemes including key exchange, encryption and digital signature. The principal attraction of elliptic curve cryptography compared to RSA is that it offers equal security for a smaller key-size, thereby reducing the processing overhead. In the present paper we propose a new encryption algorithm using Elliptic Curve.

STATISTICS

Click on # to view
Citations		0
References		0
Comments		0
Quality		0/0.00
Interest		0/0.00
View(er)s		1/168

Quality
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Interest
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Prev | Next