Sciweavers

12 search results - page 2 / 3
» Choosing the correct elliptic curve in the CM method
Sort
View
IEICET
2008
147views more  IEICET 2008»
13 years 6 months ago
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves w...
Xibin Lin, Changan Zhao, Fangguo Zhang, Yanming Wa...
ICISC
2004
108views Cryptology» more  ICISC 2004»
13 years 7 months ago
Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
We consider the generation of prime order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
Elisavet Konstantinou, Aristides Kontogeorgis, Yan...
SACRYPT
2005
Springer
112views Cryptology» more  SACRYPT 2005»
13 years 11 months ago
Pairing-Friendly Elliptic Curves of Prime Order
Previously known techniques to construct pairing-friendly curves of prime or near-prime order are restricted to embedding degree k 6. More general methods produce curves over Fp wh...
Paulo S. L. M. Barreto, Michael Naehrig
BMVC
2001
13 years 8 months ago
A Buyer's Guide to Euclidean Elliptical Cylindrical and Conical Surface Fitting
The ability to construct CAD or other object models from edge and range data has a fundamental meaning in building a recognition and positioning system. While the problem of model...
Petko Faber, Robert B. Fisher
WAIFI
2010
Springer
194views Mathematics» more  WAIFI 2010»
13 years 11 months ago
Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
A cryptographic pairing evaluates as an element of a finite extension field, and the evaluation itself involves a considerable amount of extension field arithmetic. It is recogn...
Naomi Benger, Michael Scott