126 search results - page 9 / 26 » On the Use of Weber Polynomials in Elliptic Curve Cryptograp... |
EUROCRYPT
2003
Springer
14 years 18 days ago
2003
Springer
Abstract. We generalize the Weil descent construction of the GHS attack to arbitrary Artin-Schreier extensions. We give a formula for the characteristic polynomial of Frobenius of ...
IJNSEC
2010
13 years 2 months ago
2010
Pseudo-random subsets of the set {1, 2, . . . , N} have many applications in the fields of network security, cryptography and other security issues. Recently, Dartyge and S
EUROCRYPT
2012
Springer
11 years 9 months ago
2012
Springer
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
IMA
2005
Springer
14 years 26 days ago
2005
Springer
In recent years cryptographic protocols based on the Weil and Tate pairings on elliptic curves have attracted much attention. A notable success in this area was the elegant solutio...
DATE
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract--Hardware/Software codesign of Elliptic Curve Cryptography has been extensively studied in recent years. However, most of these designs have focused on the computational a...