Attacking ElGamal based cryptographic algorithms using Pollard's rho algorithm

LAUR Repository

Show simple item record

dc.contributor.author El-Kassar, A. N.
dc.contributor.author Haraty, Ramzi A.
dc.contributor.author Otrok, Hadi
dc.date.accessioned 2017-04-05T08:15:47Z
dc.date.available 2017-04-05T08:15:47Z
dc.date.copyright 2005
dc.identifier.isbn 078038735X en_US
dc.identifier.issn 2161-5322
dc.identifier.uri http://hdl.handle.net/10725/5493
dc.description.abstract Summary form only given. In 1985 a powerful and practical public-key scheme was produced by ElGamal; his work was applied using large prime integers. El-Kassar et al. and El-Kassar and Haraty modified the ElGamal public-key encryption scheme from the domain of natural integers, Z, to two principal ideal domains, namely the domain of Gaussian integers, Z[i], and the domain of the rings of polynomials over finite fields, F[x], by extending the arithmetic needed for the modifications to these domains. In this work we implement the classical and modified ElGamal cryptosystem to compare and to test their functionality, reliability and security. To test the security of the algorithms we use a famous attack algorithm called Pollard's rho algorithm that works in the domain of natural integers. We enhance the Pollard's rho algorithm to work with the modified ElGamal cryptosystems. en_US
dc.description.sponsorship Arab Computer Society
dc.description.sponsorship IEEE Computer Society
dc.language.iso en en_US
dc.publisher IEEE en_US
dc.subject Computer systems -- Congresses
dc.subject Application software -- Congresses
dc.subject Technology transfer -- Congresses
dc.title Attacking ElGamal based cryptographic algorithms using Pollard's rho algorithm en_US
dc.type Conference Paper / Proceeding en_US
dc.author.school SOB en_US
dc.author.school SAS
dc.author.idnumber 199529190 en_US
dc.author.idnumber 199729410 en_US
dc.author.department Department of Information Technology and Operations Management (ITOM) en_US
dc.description.embargo N/A en_US
dc.description.physdesc xxiv, 150 pages
dc.publication.place Piscataway, N.J.
dc.keywords Testing en_US
dc.keywords Polynomials en_US
dc.keywords Galois fields en_US
dc.keywords Security en_US
dc.keywords Public key cryptography en_US
dc.keywords Arithmetic en_US
dc.keywords Art en_US
dc.keywords Protection en_US
dc.keywords Government en_US
dc.identifier.doi http://dx.doi.org/10.1109/AICCSA.2005.1387082 en_US
dc.identifier.ctation Haraty, R. A., Otrok, H., & Kassar, A. N. (2005). Attacking ElGamal based cryptographic algorithms using Pollard's rho algorithm. In Computer Systems and Applications, 2005. The 3rd ACS/IEEE International Conference on (p. 91). IEEE. en_US
dc.author.email abdulnassar.kassar@lau.edu.lb en_US
dc.author.email rharaty@lau.edu.lb en_US
dc.conference.date 3-6 January, 2005 en_US
dc.conference.place Cairo, Egypt
dc.conference.title The 3rd ACS/IEEE International Conference on Computer Systems and Applications en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php en_US
dc.identifier.url http://ieeexplore.ieee.org/abstract/document/1387082/ en_US
dc.orcid.id https://orcid.org/0000-0002-6978-3627
dc.orcid.id https://orcid.org/0000-0002-8423-8723
dc.author.affiliation Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account