Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/7277
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSagheer, Ali-
dc.date.accessioned2022-10-27T17:58:41Z-
dc.date.available2022-10-27T17:58:41Z-
dc.date.issued2012-02-01-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/7277-
dc.description.abstractThe 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 techniquesen_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectElliptic Curves Cryptographyen_US
dc.subjectDiscrete Logarithm Problem; Elliptic Curve Discrete Logarithm Problemen_US
dc.subjectElGamal;en_US
dc.subjectMenezes-Vanstoneen_US
dc.titleElliptic Curves Cryptographic Techniquesen_US
dc.typeArticleen_US
Appears in Collections:قسم علوم الحاسبات

Files in This Item:
File Description SizeFormat 
444444444444444444.pdf276.4 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.