Abstract

#Abstract 02/11/2016

Encryption is an essential part of modern technological infrastructure at both a hardware and software level. We are interested in exploring the different effects of modular multiplication algorithms with regard to RSA encryption. The algorithms we want to compare are Carry Save Adder, Montgomery Modular Multiplication, and possibly Interleaved Modular Multiplication [1]. Our exploration will require the design of the RSA algorithm and several modular multiplication implementations and comparing the results. We will compare latency, size, maximum operating frequency, and correctness based off the encryption key.

[1] D. Amanor, "Efficient Hardware Architectures for Modular Multiplication", Masters Thesis, The University of Applied Sciences Offenburg, Germany, 2005.

#Abstract 02/19/2016

Encryption is an essential part of modern technological infrastructure at both a hardware and software level. We are interested in exploring the difference in performance of the RSA encryption/decryption algorithm which uses modular multiplication. Our exploration will require the use of previously generated and verified keys and the implementation of the two modular multiplication designs and comparing the results. These implementations will use the Montgomery algorithm and the VHDL default exponentiation operator. We will compare latency, size, maximum operating frequency, and correctness based off the encryption key.