190 search results - page 23 / 38 » Supersingular Elliptic Curves in Cryptography |
CHES
2004
Springer
15 years 5 months ago
2004
Springer
In the current work we propose a pipelining scheme for implementing Elliptic Curve Cryptosystems (ECC). The scalar multiplication is the dominant operation in ECC. It is computed b...
IAJIT
2006
14 years 11 months ago
2006
In this paper, a fast hardware architecture for elliptic curve cryptography computation in Galois Field GF(p) is proposed. The architecture is implemented for 160-bits, as its dat...
CHES
2004
Springer
15 years 5 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...
106
click to vote
AAECC
2006
Springer
14 years 11 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...
PKC
2009
Springer
16 years 9 days ago
2009
Springer
Recently, the new Multibase Non-Adjacent Form (mbNAF) method was introduced and shown to speed up the execution of the scalar multiplication with an efficient use of multiple bases...