Results 1  10
of
969,603
On the Efficient Generation of PrimeOrder Elliptic Curves∗
, 2009
"... Abstract. We consider the generation of primeorder elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the roots of a special type of class field polynomials with the most commonly used being the Hilbert and Weber one ..."
Abstract
 Add to MetaCart
Abstract. We consider the generation of primeorder elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the roots of a special type of class field polynomials with the most commonly used being the Hilbert and Weber
J. Cryptol. DOI: 10.1007/s0014500990372 On the Efficient Generation of PrimeOrder Elliptic Curves ∗
, 2008
"... Abstract. We consider the generation of primeorder elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the roots of a special type of class field polynomials with the most commonly used being the Hilbert and Weber one ..."
Abstract
 Add to MetaCart
Abstract. We consider the generation of primeorder elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the roots of a special type of class field polynomials with the most commonly used being the Hilbert and Weber
Comparing the Pairing Efficiency over CompositeOrder and PrimeOrder Elliptic Curves
"... Abstract. We provide software implementation timings for pairings over compositeorder and primeorder elliptic curves. Composite orders must be large enough to be infeasible to factor. They are modulus of 2 up to 5 large prime numbers in the literature. There exists size recommendations for twopri ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. We provide software implementation timings for pairings over compositeorder and primeorder elliptic curves. Composite orders must be large enough to be infeasible to factor. They are modulus of 2 up to 5 large prime numbers in the literature. There exists size recommendations for twoprime
Pairingfriendly elliptic curves of prime order
 In Selected Areas in Cryptography – SAC 2005
, 2006
"... Abstract. Previously known techniques to construct pairingfriendly curves of prime or nearprime order are restricted to embedding degree k � 6. More general methods produce curves over Fp where the bit length of p is often twice as large as that of the order r of the subgroup with embedding degree ..."
Abstract

Cited by 216 (13 self)
 Add to MetaCart
degree k; the best published results achieve ρ ≡ log(p) / log(r) ∼ 5/4. In this paper we make the first step towards surpassing these limitations by describing a method to construct elliptic curves of prime order and embedding degree k = 12. The new curves lead to very efficient implementation: non
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 512 (2 self)
 Add to MetaCart
Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k
On the (im)possibility of projecting property in primeorder setting
 In ASIACRYPT
, 2012
"... Abstract. Projecting bilinear pairings have frequently been used for designing cryptosystems since they were first derived from composite order bilinear groups. There have been only a few studies on the (im)possibility of projecting bilinear pairings. Groth and Sahai (EUROCRYPT 2008) showed that pro ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
that projecting bilinear pairings can be achieved in a primeorder group setting. They constructed both projecting asymmetric bilinear pairings and projecting symmetric bilinear pairings, where a bilinear pairing e is symmetric if it satisfies e(g, h) = e(h, g) for any group elements g and h; otherwise
Efficient Variants of the ICP Algorithm
 INTERNATIONAL CONFERENCE ON 3D DIGITAL IMAGING AND MODELING
, 2001
"... The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minim ..."
Abstract

Cited by 702 (5 self)
 Add to MetaCart
to the minimization strategy. We enumerate and classify many of these variants, and evaluate their effect on the speed with which the correct alignment is reached. In order to improve convergence for nearlyflat meshes with small features, such as inscribed surfaces, we introduce a new variant based on uniform
On the impossibility of informationally efficient markets
 AMERICAN ECONOMIC REVIEW
, 1980
"... ..."
Short signatures from the Weil pairing
, 2001
"... Abstract. We introduce a short signature scheme based on the Computational DiffieHellman assumption on certain elliptic and hyperelliptic curves. The signature length is half the size of a DSA signature for a similar level of security. Our short signature scheme is designed for systems where signa ..."
Abstract

Cited by 743 (28 self)
 Add to MetaCart
Abstract. We introduce a short signature scheme based on the Computational DiffieHellman assumption on certain elliptic and hyperelliptic curves. The signature length is half the size of a DSA signature for a similar level of security. Our short signature scheme is designed for systems where
Results 1  10
of
969,603