55 search results - page 8 / 11 » Scan-based attack against elliptic curve cryptosystems |
ITCC
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper presents a high performance and scalable elliptic curve processor which is designed to be resistant against timing attacks. The point multiplication algorithm (double-a...
IJNSEC
2006
13 years 7 months ago
2006
To enhance applications of smart cards, Miyazaki and Takaragi proposed a (t, n) threshold digital signature scheme based on the security of elliptic curve discrete logarithm (ECDL...
TIT
2010
13 years 2 months ago
2010
Hoffstein and Silverman suggested the use of low Hamming weight product (LHWP) exponents to accelerate group exponentiation while maintaining the security level. With LHWP exponent...
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
Edwards recently introduced a new normal form for elliptic curves. Every elliptic curve over a non-binary field is birationally equivalent to a curve in Edwards form over an exten...
INDOCRYPT
2004
Springer
14 years 25 days ago
2004
Springer
The Montgomery multiplication is often used for an efficient implementations of public-key cryptosystems. This algorithm occasionally needs an extra subtraction in the final step,...