2967 search results - page 428 / 594 » Cryptology |
148
Voted
PAIRING
2007
Springer
15 years 12 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...
145
click to vote
PAIRING
2007
Springer
15 years 12 months ago
2007
Springer
We provide the first explicit construction of genus 2 curves over finite fields whose Jacobians are ordinary, have large prime-order subgroups, and have small embedding degree. ...
134
click to vote
PAIRING
2007
Springer
15 years 12 months ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
168
click to vote
PAIRING
2007
Springer
15 years 12 months ago
2007
Springer
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
154
click to vote
PKC
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. Direct anonymous attestation (DAA) is an anonymous authentication scheme adopted by the Trusted Computing Group in its specifications for trusted computing platforms. Th...