Gutub, Adnan (1998) Hardware Model of an Expandable RSA Cryptographic System. Masters thesis, King Fahd University of Petroleum and Minerals (KFUPM).
|Microsoft PowerPoint (Defense)|
Official URL: http://library.kfupm.edu.sa/lib-downloads/1393212....
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)|
|Divisions:||College Of Computer Sciences and Engineering > Computer Engineering Dept|
|Deposited By:||ADNAN ABDUL-AZIZ M. GUTUB (gutub|
|Deposited On:||17 May 2008 08:34|
|Last Modified:||25 Apr 2011 08:20|
Repository Staff Only: item control page