Inefficiency of common-multiplicand multiplication and exponentiation algorithms by performing binary complements

In order to speed up long integer modular multiplication and modular exponentiation computations that play the most important role of implementing public-key cryptographic systems, recently a result has been reported by developing a binary complement based approach on operands with larger Hamming we...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied mathematics and computation Ročník 189; číslo 1; s. 285 - 290
Hlavní autoři: Yen, Sung-Ming, Lien, Wei-Chih, Moon, SangJae
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY Elsevier Inc 01.06.2007
Elsevier
Témata:
Algebra
Arithmetic algorithm
Exact sciences and technology
Exponentiation
Mathematical analysis
Mathematics
Multiplication
Number theory
Numerical analysis
Numerical analysis. Scientific computation
Public-key cryptography
Sciences and techniques of general use
Multiplication
Exponentiation
Public-key cryptography
Arithmetic algorithm
Integer
Numerical analysis
Arithmetics
Algorithm performance
Applied mathematics
Cryptography
Algorithm
ISSN:0096-3003, 1873-5649
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In order to speed up long integer modular multiplication and modular exponentiation computations that play the most important role of implementing public-key cryptographic systems, recently a result has been reported by developing a binary complement based approach on operands with larger Hamming weight in their binary representations. It is claimed that this new proposal achieves extremely good performance improvement due to the possible extensive Hamming weight reduction. Furthermore, in the conclusion of this recent result, it is claimed that the larger the bit length of the operands is, the better the performance will be in their algorithms. However, in this paper it will be shown precisely that the considered binary complement based approach on operands can only lead to an extremely negligible Hamming weight reduction. Detailed and exact analysis result is contrary to their claim, i.e., performance improvement of the binary complement based algorithms decreases considerably for larger bit length of the operands.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2006.11.100