Project Name: Modular Multiplication Core

Description

RSA is one of algorithm in cryptography system for authenticity, security, and integrity of information. There are two important operations in the RSA algorithm, they are modular multiplication and modular exponentiation. Modular multiplication is core of the algorithm and we will use Montgomery multiplication to realize it, because Montgomery multiplication is very efficient algorithm for hardware implementation.

We will develop the multiplication module and use it to design RSA core. In the first, we will develop 16 bits modular multiplication and it can be expand to larger word size

Current Status:

• We have learned the core from Sherif Taher and we will develop it by his proposal. For more information about development of modular multiplication please check here.

Maintainer(s):

• Ahmad Bagus Maskula - bagus@opencores.org
• Prabowo Rahutomo
• Andi Marlan

Mailing-list:

• cores@opencores.org_NOSPAM