126 search results - page 3 / 26 » On the Use of Weber Polynomials in Elliptic Curve Cryptograp... |
EUROCRYPT
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert-Vanstone (GLV) method. Iijima, Matsuo, Chao and...
ISCAS
2002
IEEE
14 years 8 days ago
2002
IEEE
FPGAs are an attractive platform for elliptic curve cryptography hardware. Since field multiplication is the most critical operation in elliptic curve cryptography, we have studi...
IPL
2007
13 years 7 months ago
2007
The use of elliptic curve cryptosystems on embedded systems has been becoming widespread for some years. Therefore the resistance of such cryptosystems to side-channel attacks is ...
GMP
2003
IEEE
14 years 19 days ago
2003
IEEE
Elliptic curve cryptography is known for its complexity due to its discrete logarithm problem, and this gives advantage to the system used since the formula developed using this c...
MASCOTS
2001
13 years 8 months ago
2001
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...