Can I read A low-complexity LUT-based squaring algorithm on EtoBox?

A low-complexity LUT-based squaring algorithm by Te-Jen Chang; Chia-Long Wu; Der-Chyuan Lou; Ching-Yin Chen is a Engineering article available to read on EtoBox.

What is A low-complexity LUT-based squaring algorithm about?

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.

Who reads A low-complexity LUT-based squaring algorithm?

Author

Te-Jen Chang; Chia-Long Wu; Der-Chyuan Lou; Ching-Yin Chen

Publisher

Elsevier Science; Elsevier ; Elsevier Ltd.; Elsevier BV (ISSN 0898-1221)

Published

2009

Language

EN

Field

Engineering (Physical Sciences)