Name
Abstract | ||
|---|---|---|
The computation of large modular multi-exponentiation is a time-consuming arithmetic operation used in cryptography. The standard squaring algorithm is well-known and the Guajardo-Paar algorithm fixes the improper carry handling bug produced by the standard squaring algorithm, but produces error-indexing bug. In this paper, a novel squaring algorithm is proposed, which stores base products in the Look-Up Table before the squaring computation and base size comparison method. The proposed algorithm can not only evaluate squaring efficiently but also avoid bugs produced in other proposed algorithms (the Guajardo-Paar algorithm and the Yang-Heih-Laih algorithm). The performance of the proposed algorithm is 1.615 times faster than the standard squaring algorithm and much faster than other algorithms. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.camwa.2008.11.018 | Computers & Mathematics with Applications |
Keywords | Field | DocType |
squaring,modular multiplication,look-up table,stores base product,guajardo-paar algorithm fix,yang-heih-laih algorithm,base size comparison method,time-consuming arithmetic operation,public-key cryptosystem,proposed algorithm,fast algorithm design,large modular multi-exponentiation,guajardo-paar algorithm,information security,indexation,look up table | Lookup table,Cryptography,Modular arithmetic,Arithmetic,Algorithm,Information security,Public key cryptosystem,FSA-Red Algorithm,Modular design,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
57 | 9 | Computers and Mathematics with Applications |
Citations | PageRank | References |
2 | 0.38 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Te-Jen Chang | 1 | 47 | 5.72 |
| Chia-Long Wu | 2 | 68 | 9.36 |
| Der-Chyuan Lou | 3 | 468 | 37.88 |
| Ching-Yin Chen | 4 | 2 | 0.38 |