190 search results - page 26 / 38 » Supersingular Elliptic Curves in Cryptography |
140
click to vote
ISW
2010
Springer
14 years 9 months ago
2010
Springer
The concept of grouping proofs has been introduced by Juels to permit RFID tags to generate a verifiable proof that they have been scanned simultaneously, even when readers or tags...
106
click to vote
ASIACRYPT
2008
Springer
15 years 1 months ago
2008
Springer
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...
118
click to vote
PKC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
FC
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we formulate the concept of policy-based cryptography which makes it possible to perform policy enforcement in large-scale open environments like the Internet, with ...
ANTS
2006
Springer
15 years 3 months ago
2006
Springer
The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We ...