128 search results - page 7 / 26 » Fast Integer Multiplication using Modular Arithmetic |
RECONFIG
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper describes an efficient arithmetic processor for elliptic curve cryptography. The proposed processor consists of special architectural components, the most important of...
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract: This paper addresses the problem of equivalence verification of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have di...
CRYPTO
2003
Springer
14 years 17 days ago
2003
Springer
We present a new construction based on modular groups. A novel element of our construction is to embed each input into a sequence of matrices with determinant ±1, the product of w...
CTRSA
2003
Springer
14 years 17 days ago
2003
Springer
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8% to 8.5% over the best known general methods when using affine coordinate...
ASAP
1996
IEEE
13 years 11 months ago
1996
IEEE
We propose in this paper a new algorithm and architecture for performing divisions in residue number systems. Our algorithm is suitable for residue number systems with large modul...