128 search results - page 10 / 26 » Fast Integer Multiplication using Modular Arithmetic |
ARITH
2007
IEEE
14 years 1 months ago
2007
IEEE
We describe a new method to perform the modular exponentiation operation, i.e., the computation of c = me mod n, where c, m, e and n are large integers. The new method uses the di...
ASAP
2004
IEEE
13 years 11 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
DAGSTUHL
2008
13 years 8 months ago
2008
Abstract. A so called staggered precision arithmetic is a special kind of a multiple precision arithmetic based on the underlying floating point data format (typically IEEE double ...
PKC
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithm...