Name
Abstract | ||
|---|---|---|
This paper describes a parallelized radix-4 scalable Montgomery multiplier implementation. The design does not require hardware multipliers, and uses parallelized multiplication to shorten the critical path. By left-shifting the sources rather than right-shifting the result, the latency between processing elements is shortened from two cycles to nearly one. The new design can perform 1024-bit modular exponentiation in 8.7 ms and 256-bit exponentiation in 0.36 ms using 5916 Virtex2 4-input lookup tables. This is comparable to radix-2 for long multiplies and nearly twice as fast for short ones. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/1284480.1284562 | IEEE Transactions on Very Large Scale Integration Systems |
Keywords | Field | DocType |
1024-bit modular exponentiation,long multiplies,parallelized multiplication,virtex2 4-input lookup table,hardware multiplier,critical path,256-bit exponentiation,radix-4 scalable montgomery multiplier,radix-4 scalable,montgomery multiplier implementation,new design,montgomery multiplication,cryptography | Lookup table,Computer science,Parallel computing,Multiplier (economics),Radix,Multiplication,Critical path method,Exponentiation,Scalability,Modular exponentiation | Conference |
Citations | PageRank | References |
5 | 0.52 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nathaniel Ross Pinckney | 1 | 155 | 10.34 |
| David Money Harris | 2 | 56 | 6.20 |