76 search results - page 9 / 16 » Pipelining GF(P) Elliptic Curve Cryptography Computation |
RECONFIG
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper describes an efficient arithmetic processor for elliptic curve cryptography. The proposed processor consists of special architectural components, the most important of...
97
Voted
CHES
2005
Springer
15 years 3 months ago
2005
Springer
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
AAECC
2006
Springer
14 years 10 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...
CHES
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper is devoted to the design of fast parallel accelerators for the cryptographic Tate pairing in characteristic three over supersingular elliptic curves. We propos...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The non-repudiation as an essential requirement of many applications can be provided by the asymmetric key model. With the evolution of new applications such as mobile commerce, it...