32 search results - page 6 / 7 » Faster Addition and Doubling on Elliptic Curves |
IACR
2011
12 years 5 months ago
2011
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...
TC
2010
13 years 19 hour ago
2010
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
SACRYPT
2005
Springer
13 years 10 months ago
2005
Springer
We present two left-to-right integer recodings which can be used to perform scalar multiplication with a fixed sequence of operations. These recodings make it possible to have a s...
ISCAS
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper a 173-bit type II ONB ECC processor Section II introduces the mathematical backgrounds for for inductive RFID applications is described. Compared with curve operation...
EUROCRYPT
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. The Joint Sparse Form is currently the standard representation system to perform multi-scalar multiplications of the form [n]P + m[Q]. We introduce the concept of Joint D...