A Comparitive Study of RSA based Cryptographic Algorithms

Ramzi A. Haraty, A. N. El-Kassar, Hadi Otrok

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

In 1978 a powerful and practical public-key scheme Hadi Otrokwas produced by RSA; there work was applied using 2 large random odd primes p and q, each roughly of the same size. El-Kassar and Awad modi-...ed the RSA 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...nite...elds, F[x], by extending the arithmetic needed for the modi...cations to these domains. In this work we implement the classical and modi...ed RSA cryptosystem to compare and to test their functionality, realiability and security. To test the security of the algorithms we implement an attack algorithm to solve the integer factorization problem.

Original languageBritish English
Title of host publication13th International Conference on Intelligent and Adaptive Systems and Software Engineering 2004, IASSE 2004
EditorsWalter Dosch, Narayan Debnath
Pages183-188
Number of pages6
ISBN (Electronic)9781618398383
StatePublished - 2004
Event13th International Conference on Intelligent and Adaptive Systems and Software Engineering, IASSE 2004 - Nice, France
Duration: 1 Jul 20043 Jul 2004

Publication series

Name13th International Conference on Intelligent and Adaptive Systems and Software Engineering 2004, IASSE 2004

Conference

Conference13th International Conference on Intelligent and Adaptive Systems and Software Engineering, IASSE 2004
Country/TerritoryFrance
CityNice
Period1/07/043/07/04

Fingerprint

Dive into the research topics of 'A Comparitive Study of RSA based Cryptographic Algorithms'. Together they form a unique fingerprint.

Cite this