Sciweavers

35 search results - page 3 / 7
» Generating Elliptic Curves of Prime Order
Sort
View
ANTS
1998
Springer
139views Algorithms» more  ANTS 1998»
13 years 11 months ago
Generating Arithmetically Equivalent Number Fields with Elliptic Curves
In this note we address the question whether for a given prime number p, the zeta-function of a number field always determines the p-part of its class number. The answer is known t...
Bart de Smit
ASAP
2010
IEEE
315views Hardware» more  ASAP 2010»
13 years 5 months ago
A compact FPGA-based architecture for elliptic curve cryptography over prime fields
Abstract--This paper proposes an FPGA-based applicationspecific elliptic curve processor over a prime field. This research targets applications for which compactness is more import...
Jo Vliegen, Nele Mentens, Jan Genoe, An Braeken, S...
PAIRING
2007
Springer
108views Cryptology» more  PAIRING 2007»
14 years 1 months ago
Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
We provide the first explicit construction of genus 2 curves over finite fields whose Jacobians are ordinary, have large prime-order subgroups, and have small embedding degree. ...
David Freeman
EUROCRYPT
2010
Springer
14 years 5 days ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
ANTS
2006
Springer
95views Algorithms» more  ANTS 2006»
13 years 11 months ago
Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10
We present a general framework for constructing families of elliptic curves of prime order with prescribed embedding degree. We demonstrate this method by constructing curves with ...
David Freeman