126 search results - page 24 / 26 » On the Use of Weber Polynomials in Elliptic Curve Cryptograp... |
CHES
2004
Springer
14 years 23 days ago
2004
Springer
In this paper we propose a new side channel attack, where exponent recodings for public key cryptosystems such as RSA and ECDSA are considered. The known side channel attacks and c...
EUROCRYPT
2004
Springer
14 years 22 days ago
2004
Springer
Denoting by P = [k]G the elliptic-curve double-and-add multiplication of a public base point G by a secret k, we show that allowing an adversary access to the projective representa...
CHES
2003
Springer
14 years 17 days ago
2003
Springer
Field Programmable Gate Arrays (FPGAs) are becoming increasingly popular, especially for rapid prototyping. For implementations of cryptographic algorithms, not only the speed and ...
CRYPTO
2003
Springer
14 years 17 days ago
2003
Springer
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
Let C be a smooth plane cubic curve with Jacobian E. We give a formula for the action of the 3-torsion of E on C, and explain how it is useful in studying the 3-Selmer group of an ...