A high-speed asic implementation of the RSA cryptosystem

Yeşil, Soner
This thesis presents the ASIC implementation of the RSA algorithm, which is one of the most widely used Public Key Cryptosystems (PKC) in the world. In RSA Cryptosystem, modular exponentiation of large integers is used for both encryption and decryption processes. The security of the RSA increases as the number of the bits increase. However, as the numbers become larger (1024-bit or higher) the challenge is to provide architectures, which can be implemented in hardware, operate at high clock speeds, use a minimum of resources and can be used in real-time applications. In this thesis, a semi-custom VLSI implementation of the RSA Cryptosystem is performed for both 512-bit and 1024-bit processes using 0.35æm AMI Semiconductor Standard Cell Libraries. By suiting the design into a systolic and regular architecture, the broadcasting signals and routing delays are minimized in the implementation. With this regular architecture, the results of 3ns clock period (627Kbps) using 87K gates (8.7mm2 with I/O pads) for the 512-bit implementation, and 4ns clock period (237Kps) using 132K gates (10.4mm2 with I/O pads) for the 1024-bit implementation have been achieved. These results are obtained for the worst-case conditions and they include the post-layout routing delays. The design is also verified in real time using the Xilinx V2000E FPGA on the Celoxica RC1000 Hardware. The 1024-bit VLSI implementation has been sent to IMEC for fabrication as a prototype chip through Europractice Multi-Project Wafer (MPW) runs.


An efficient RSA public key encryption scheme
Aboud, Sattar J.; AL-Fayoumi, Mohammad A.; Al-Fayoumi, Mustafa; Jabbar, Haidar S. (2008-04-09)
In this paper, we propose an efficient RSA public key encryption scheme, which is an improved version of original RSA scheme. The proposed RSA encryption scheme is based on linear group over the ring of integer mod a composite modulus n which is the product of two distinct prime numbers. In the proposed scheme the original message and the encrypted message are h x h square matrices with entities in z(n) indicated via l(h,z(n)). Since the original RSA Scheme is a block cipher in which the original message an...
Halıcı, Uğur (1991-07-01)
An optimistic scheme, called ODL, which uses dummy locks to test the validity of a transaction for concurrency control in distributed database systems, is suggested. The dummy locks are long-term locks; however, they do not conflict with any other lock. By the use of long-term dummy locks, the need for the information about the write sets of validated transactions is eliminated and during the validation test only the related sites are checked. Also, the transactions to be aborted are immediately recogniz...
A Hierarchical Architecture for Nonblocking Control of Discrete Event Systems
Schmidt, Klaus Verner; PERK, SEBASTIAN (2006-03-13)
This contribution investigates the hierarchical control of decentralized DES which are synchronized by shared events. A multi-level hierarchical control architecture providing hierarchical consistency is introduced. Moreover, it allows for composition of decentralized subsystems on the high-level of the hierarchy, and hence reduces the computational complexity of supervisory control synthesis for language inclusion specifications. In this context, a crucial issue is the nonblocking operation of the overall ...
A Control System Architecture for Control of Non-Affine in Control, Open-Loop Unstable Underactuated Systems
Marangoz, Alp; Kutay, Ali Türker (2017-07-25)
In this paper, a control system architecture for control of non-affine in control, open-loop unstable underactuated system is discussed. Passivization of the unactuated (internal) system dynamics achieved through perturbation of trajectories of the actuated states, which are calculated through adaptive dynamic inversion technique, based on Tikhonov's theorem. Performance of the controller is shown through simulation of two open-loop unstable and locally uncontrollable example problems.
A method for decentralized business process modeling
Türetken, Oktay; Demirörs, Onur; Department of Information Systems (2007)
This thesis study proposes a method for organizations to perform business process modeling in a decentralized and concurrent manner. The Plural method is based on the idea that organizations’ processes can be modeled by individuals actually performing the processes. Instead of having a central and devoted group of people to understand, analyze, model and improve processes, individuals are held responsible to model and improve their own processes concurrently. These individual models are then integrated to f...
Citation Formats
S. Yeşil, “A high-speed asic implementation of the RSA cryptosystem,” M.S. - Master of Science, Middle East Technical University, 2003.