.

A study of RSA cryptography algorithms. (c2002)

LAUR Repository

Show simple item record

dc.contributor.author Semaan, Nabil H.
dc.date.accessioned 2011-09-08T05:34:44Z
dc.date.available 2011-09-08T05:34:44Z
dc.date.issued 2011-09-08
dc.date.submitted 2002-03
dc.identifier.uri http://hdl.handle.net/10725/554
dc.description Includes bibliographical references (leaves 96-101). en_US
dc.description.abstract In this report, we provided a review of cryptography, smart card, and some algorithms. We also implement the algorithms: RSA for encryption and decryption of text, RSA for encryption and decryption of text using signature and secrecy, and a non-repudiation protocol. We empirically test these algorithms on a variety of key lengths and message sizes. We find that the algorithms executes very fast. The algorithm requires 0 (log n) linear time to run. Limitations were recorded while testing the algorithms. The letter v produces a wrong character in any place that it appears in the message. The algorithm caused an "overflow" error message on personal computers this problem was resolved by the Modular-Exponentiation algorithm. en_US
dc.language.iso en en_US
dc.subject Computer networks -- Security measures en_US
dc.subject Data encryption (Computer science) en_US
dc.subject Cryptography en_US
dc.subject Telecommunication -- Security measures en_US
dc.title A study of RSA cryptography algorithms. (c2002) en_US
dc.type Project en_US
dc.term.submitted Spring en_US
dc.author.school Arts and Sciences en_US
dc.author.idnumber 199914850 en_US
dc.author.commembers Dr. Ramzi Haraty en_US
dc.author.woa RA en_US
dc.author.department MS in Computer Science en_US
dc.description.physdesc 1 bound copy: x, 101 leaves; ill.; 30 cm. available at RNL. en_US
dc.author.division Computer Science en_US
dc.author.advisor Dr. Nash 'at Mansour en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR


Advanced Search

Browse

My Account