79 search results - page 11 / 16 » Cryptosystems Based on Elliptic Curve Pairing |
DCC
2000
IEEE
13 years 7 months ago
2000
IEEE
The first practical public key cryptosystem to be published, the Diffie-Hellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. T...
CHES
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
EWSN
2008
Springer
14 years 7 months ago
2008
Springer
Abstract. By using Elliptic Curve Cryptography (ECC), it has been recently shown that Public-Key Cryptography (PKC) is indeed feasible on resource-constrained nodes. This feasibili...
PAIRING
2010
Springer
13 years 5 months ago
2010
Springer
This paper describes the design of a fast software library for the computation of the optimal ate pairing on a Barreto–Naehrig elliptic curve. Our library is able to compute the ...
TC
2010
13 years 2 months ago
2010
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...