44 search results - page 4 / 9 » Computing in Component Groups of Elliptic Curves |
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
Let p be a prime and let E(IFp) be an elliptic curve defined over the finite field IFp of p elements. For a given point G E(IFp) the linear congruential genarator on elliptic curv...
RECONFIG
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper describes an efficient arithmetic processor for elliptic curve cryptography. The proposed processor consists of special architectural components, the most important of...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
RSA is the most popular public-key cryptosystem on the Web today but long-term trends such as the proliferation of smaller, simpler devices and increasing security needs will make...
IACR
2011
12 years 7 months ago
2011
: Many identity-based digital signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher th...
ASIACRYPT
2003
Springer
14 years 18 days ago
2003
Springer
The best practical algorithm for class group computations in imaginary quadratic number fields (such as group structure, class number, discrete logarithm computations) is a varian...