Name
Abstract | ||
|---|---|---|
Montgomery modular multiplication is widely applied to public key cryptosystems like Rivest-Sharmir-Adleman (RSA) and elliptic curve cryptography (ECC). This work presents a word-based Booth encoded radix-4 Montgomery modular multiplication algorithm for low-latency scalable architecture. The data dependency resulting from the inherent right shifting of the intermediate results in the conventional radix-4 Montgomery modular multiplication algorithm is alleviated; thus the latency between the neighboring process elements (PEs) is exactly one cycle. The number of the equivalent operands in the accumulation is not increased with operand reduction scheme. Implementation results based on the same technology show that compared to other Booth encoded radix-4 Montgomery modular multipliers, the proposed design achieves at least 23% time reduction for accomplishing one 1024-bit Montgomery modular multiplication. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ISCAS.2012.6271962 | 2012 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS 2012) |
Keywords | Field | DocType |
elliptic curve cryptography,algorithm design and analysis,public key cryptography,kernel,encoding,hardware,computer architecture | Data dependency,Algorithm design,Computer science,Parallel computing,Operand,Arithmetic,Multiplier (economics),Kochanski multiplication,Modular design,Elliptic curve cryptography,Public-key cryptography | Conference |
ISSN | Citations | PageRank |
0271-4302 | 5 | 0.48 |
References | Authors | |
3 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shenghong Wang | 1 | 43 | 5.25 |
| Wen-ching Lin | 2 | 86 | 8.76 |
| Jheng-Hao Ye | 3 | 15 | 3.05 |
| Ming-der Shieh | 4 | 87 | 11.57 |