202 search results - page 10 / 41 » Hardware Factorization Based on Elliptic Curve Method |
ASIACRYPT
2006
Springer
14 years 10 days ago
2006
Springer
Abstract. It has been recently acknowledged [4, 6, 9] that the use of double bases representations of scalars n, that is an expression of the form n = e,s,t(-1)e As Bt can speed up...
CHES
2005
Springer
14 years 2 months ago
2005
Springer
Although identity based cryptography offers many functional advantages over conventional public key alternatives, the computational costs are significantly greater. The core comp...
CHES
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. This paper is devoted to the design of fast parallel accelerators for the cryptographic Tate pairing in characteristic three over supersingular elliptic curves. We propos...
JUCS
2008
13 years 8 months ago
2008
We present an algorithm that by using the and -1 Frobenius operators concurrently allows us to obtain a parallelized version of the classical -and-add scalar multiplication algor...
PKC
2004
Springer
14 years 1 months ago
2004
Springer
Let E be an elliptic curve defined over F2n . The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have t...