Name
Abstract | ||
|---|---|---|
The RSA algorithm is the most used public key cipher algorithm. Since it was presented in 1977, designers have proposed several architectures and implementations to improve its performance using different techniques and devices. In all cases, Montgomery's modular multiplication algorithm is the best option when trying to design an efficient RSA. In this paper, we present a high-radix Montgomery's algorithm implementation. The main advantages of this approach are the scalability and modularity, which allow finding the best tradeoff between area and performance depending on the application. The system is able to process different RSA key lengths without needing to reconfigure it. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/FCCM.2011.37 | Field-Programmable Custom Computing Machines |
Keywords | DocType | ISBN |
high-radix montgomery,modular multiplication algorithm,different technique,efficient rsa,public key cipher algorithm,rsa coprocessor,algorithm implementation,key size,best tradeoff,different rsa key length,rsa algorithm,best option,configurable high speed,algorithm design,hardware,cryptography,public key,computer architecture,algorithm design and analysis,coprocessors,modular multiplication,public key cryptography,field programmable gate array,fpga,field programmable gate arrays | Conference | 978-0-7695-4301-7 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Enrique Castillo | 1 | 555 | 59.86 |
| J. Castillo | 2 | 0 | 0.34 |
| J. Cano | 3 | 21 | 3.28 |
| Pablo Huerta | 4 | 93 | 8.91 |
| J. I. Martínez | 5 | 7 | 1.71 |