(1998) Hardware Model of an Expandable RSA Cryptographic System. Masters thesis, King Fahd University of Petroleum and Minerals (KFUPM).

Preview	PDF (Thesis) MS_Thesis.pdf Download (3MB) | Preview
Preview	PDF (Abstract) MS_Abstract.pdf Download (22kB) | Preview
	Microsoft PowerPoint (Defense) MS_THESIS_Defense.PPT Download (407kB)

Abstract

Data security is an important aspect of information transmission and storage in an electronic form. Cryptographic systems are used to encrypt such information to guarantee its security. To retrieve such information, the encrypted form must be first decrypted. One of the most popular cryptographic systems is the RSA system. The security of the RSA-encrypted information largely depends on the size of the used encryption key. The larger the key size is the longer the encryption/decryption time will be. To cope with the continuous demand for larger key sizes, faster hardware implementations of the RSA algorithm has become an active area of research. One disadvantage of hardware implementations is their fixed key sizes. If the key size is to be increased, the hardware design should be fully replaced. The work reported here proposes an RSA hardware implementation that can be expanded as the key size gets larger. This implementation is modeled using VHDL in a parametrizable manner. Two other parameterized RSA hardware designs have also been VHDL modeled for comparison. The three models are compared for a 1024-bit key size and the results are analyzed. The complexity of the designs are compared and conclusions regarding optimal delay and area parameters are made.

Item Type:	Thesis (Masters)
Subjects:	Math Computer Electrical
Department:	College of Computing and Mathematics > Computer Engineering
Depositing User:	ADNAN ABDU GUTUB (gutub
Date Deposited:	17 May 2008 05:34
Last Modified:	01 Nov 2019 13:26
URI:	http://eprints.kfupm.edu.sa/id/eprint/1287