Efficient Low-latency High-Radix Montgomery Modular Multipliers by Precomputation

Citation Author(s):
Tao
Wu
Shenzhen Research Institute of Sun Yat-sen University
Submitted by:
Tao Wu
Last updated:
Wed, 08/25/2021 - 20:44
DOI:
10.21227/m5xb-2k51
License:
Creative Commons Attribution
141 Views
Categories:
IoT
Security
Keywords:
Montgomery algorithm, modular multiplication, precomputation
0
0 ratings - Please login to submit your rating.
CITE SHARE/EMBED

Abstract 

The data are four Xilinx ISE projects for Montgomery modualr multiplication and modular exponentiation.

Instructions: 

There are 4 directions in the data, the first 2 of which are Montgomery modular multiplications, and the last 2 of which are modular exponentiations.

Dataset Files

LOGIN TO ACCESS DATASET FILES
Open Access dataset files are accessible to all logged in  users. Don't have a login?  Create a free IEEE account.  IEEE Membership is not required.

QUESTIONS?

Login to Send Author a Private Message

Report a problem with this Dataset