DocumentCode
2044756
Title
Elliptic curves cryptographic techniques
Author
Sagheer, A.M.
Author_Institution
Dept. of Inf. Syst., Univ. of Anbar, Ramadi, Iraq
fYear
2012
fDate
12-14 Dec. 2012
Firstpage
1
Lastpage
7
Abstract
The security issues are very important for information technology applications now a day such as ATM and Smart cards. One of the recent public key cryptosystems is Elliptic Curves Cryptography. The group of the elliptic curve points forms an Abelian group, that is a suitable choice for constructing the Elliptic Curve Discrete Logarithm Problem (ECDLP). This led to create cipher system based on the difficulty of its solution. That is open a new windows for treatment with special groups and new operations. This paper provides three proposed techniques as a modification of ElGamal cryptosystem based on the elliptic curves, as well as, implement these techniques, compute the computational complexity of these methods compared to the original methods, compare these methods with the original methods in running time of several messages have different sizes. A great reduction in calculation time is resulted, also these techniques makes the cipher text more confused than cipher text which resulted from original techniques.
Keywords
computational complexity; group theory; public key cryptography; ATM; Abelian group; ECDLP; ElGamal cryptosystem; computational complexity; elliptic curve discrete logarithm problem; elliptic curves cryptography; public key cryptosystem; security issue; smart card; Discrete Logarithm Problem; ElGamal; Elliptic Curve Discrete Logarithm Problem; Elliptic Curves Cryptography; Menezes-Vanstone;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing and Communication Systems (ICSPCS), 2012 6th International Conference on
Conference_Location
Gold Coast, QLD
Print_ISBN
978-1-4673-2392-5
Electronic_ISBN
978-1-4673-2391-8
Type
conf
DOI
10.1109/ICSPCS.2012.6507952
Filename
6507952
Link To Document