209 search results - page 32 / 42 » Supersingular Curves in Cryptography |
CHES
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this article we present a low-cost coprocessor for smartcards which supports all necessary mathematical operations for a fast calculation of the Elliptic Curve Digital...
AAECC
2006
Springer
13 years 8 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
IACR
2011
12 years 7 months ago
2011
: Many identity-based digital signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher th...
CHES
2009
Springer
14 years 8 months ago
2009
Springer
Elliptic Curve Cryptography implementations are known to be vulnerable to various side-channel attacks and fault injection attacks, and many countermeasures have been proposed. How...
ACISP
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. In this article we introduce redundant trinomials to represent elements of finite fields of characteristic 2. This paper develops applications to cryptography, especial...