12 search results - page 2 / 3 » Generating More MNT Elliptic Curves |
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
Elliptic curve cryptosystems are nowadays widely used in the design of many security devices. Nevertheless, since not every elliptic curve is useful for cryptographic purposes, me...
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...
ISW
2010
Springer
13 years 3 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...
FPL
2008
Springer
13 years 6 months ago
2008
Springer
Cryptanalysis of symmetric and asymmetric ciphers is a challenging task due to the enormous amount of involved computations. To tackle this computational complexity, usually the e...
CRYPTO
2003
Springer
13 years 10 months ago
2003
Springer
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...