471 search results - page 19 / 95 » Faster Multiplication in GF(2)[x] |
ITNG
2007
IEEE
14 years 4 months ago
2007
IEEE
: There has been a lot of interest in recent years in the problems faced by cryptosystems due to side channel attacks. Algorithms for elliptic curve point scalar multiplication suc...
CHES
2000
Springer
14 years 2 months ago
2000
Springer
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
TC
2011
13 years 4 months ago
2011
—Single and double scalar multiplications are the most computational intensive operations in elliptic curve based cryptosystems. Improving the performance of these operations is ...
JSW
2007
13 years 9 months ago
2007
— The paper addresses software and firmware implementation of multiple-output Boolean functions based on cascades of Look-Up Tables (LUTs). A LUT cascade is described as a means ...
ARITH
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract. We present efficient squaring formulae based on the Toom-Cook multiplication algorithm. The latter always requires at least one non-trivial constant division in the inte...