Name
Abstract | ||
|---|---|---|
A new method for multiplication of large integersand designed for efficient software implementation is presented and compared with the well-known "schoolbook" method that is currently used for both software and hardware implementations of public-key cryptographic techniques. The comparison for the software-efficient method is made in terms of the required number of basic operations on small integers. It is shown that a significant performance gain is achieved by the new software-efficient method for integersfrom 192 to 1024 bitsin length, which isthe range of interest for all current public-key implementations. For 1024-bit integer multiplication, the savings over the schoolbook method is conservatively estimated to be about 33%. A new method for multiplication of large integers, which isanalogousto the new softwareefficient method but isdes igned for efficient hardware implementation, is also presented and compared to the schoolbook method in terms of the number of processor clock cycles required. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/3-540-45537-X_19 | Selected Areas in Cryptography |
Keywords | Field | DocType |
new softwareefficient method,schoolbook method,efficient hardware implementation,1024-bit integer multiplication,software-efficient method,hardware implementation,new method,public-key applications,fast multiplication,efficient software implementation,new software-efficient method,current public-key implementation,public key | Integer,Cryptography,Computer science,Parallel computing,Implementation,Software,Multiplication,Cycles per instruction,Word (computer architecture),Public-key cryptography | Conference |
ISBN | Citations | PageRank |
3-540-43066-0 | 1 | 0.37 |
References | Authors | |
1 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gurgen H. Khachatrian | 1 | 1 | 0.37 |
| Melsik K. Kuregian | 2 | 1 | 0.37 |
| Karen R. Ispiryan | 3 | 1 | 0.37 |
| James L. Massey | 4 | 1096 | 272.94 |