Summary

International Symposium on Nonlinear Theory and its Applications

2008

Session Number:C4L-F

Session:

Number:C4L-F1

RSA Encryption / Decryption Using Repeated Modulus Method

Hasan Amin Oseily,  Ali Massoud Haidar,  

pp.-

Publication Date:2008/9/7

Online ISSN:2188-5079

DOI:10.34385/proc.42.C4L-F1

PDF download (204.7KB)

Summary:
This paper proposes the implementation of RSA encryption / decryption algorithm using the simplification of repeated modulus in order to improve the performance. This algorithm will be compared with that based on Ancient Indian Vedic Mathematics and the traditional algorithm based on the straight division algorithm (sequential subtraction, multiplication, shifting..). The recently proposed hierarchical overlay multiplier architecture is used in the RSA circuitry for multiplication operation; the Carry save adder is used. The most significant aspect of the paper is the development of a division architecture based on straight division algorithm but with repeated operation of identical modulus and embedding it in RSA encryption / decryption circuitry for efficiency improvement. The examples show that RSA circuitry implemented using repeated identical modulus algorithm with division and multiplication is efficient in terms of speed compared to its implementation using conventional multiplication and division architectures.