209 search results - page 28 / 42 » Supersingular Curves in Cryptography |
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
–The many-to-one traffic pattern dominates in sensor networks, where a large number of sensor nodes send data to one sink. A sensor node may only communicate with a small portion...
PAIRING
2007
Springer
14 years 2 months ago
2007
Springer
In this paper we describe an efficient implementation of the Tate and Ate pairings using Barreto-Naehrig pairing-friendly curves, on both a standard 32-bit PC and on a 32-bit smart...
CHES
2004
Springer
14 years 1 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...
ASIACRYPT
2003
Springer
14 years 1 months ago
2003
Springer
The Weil and Tate pairings have been used recently to build new schemes in cryptography. It is known that the Weil pairing takes longer than twice the running time of the Tate pair...
IAJIT
2006
13 years 7 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...