Sciweavers

ANTS
2006
Springer
95views Algorithms» more  ANTS 2006»
14 years 3 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
ANTS
2006
Springer
95views Algorithms» more  ANTS 2006»
14 years 3 months ago
Computing Pro-P Galois Groups
We describe methods for explicit computation of Galois groups of certain tamely ramified p-extensions. In the finite case this yields a short list of candidates for the Galois grou...
Nigel Boston, Harris Nover
ANTS
2006
Springer
93views Algorithms» more  ANTS 2006»
14 years 3 months ago
Testing Equivalence of Ternary Cubics
Let C be a smooth plane cubic curve with Jacobian E. We give a formula for the action of the 3-torsion of E on C, and explain how it is useful in studying the 3-Selmer group of an ...
Tom Fisher
ANTS
2006
Springer
118views Algorithms» more  ANTS 2006»
14 years 3 months ago
Computation of Locally Free Class Groups
We show that the locally free class group of an order in a semisimple algebra over a number field is isomorphic to a certain ray class group. This description is then used to prese...
Werner Bley, Robert Boltje
ANTS
2006
Springer
99views Algorithms» more  ANTS 2006»
14 years 3 months ago
The Asymptotics of Points of Bounded Height on Diagonal Cubic and Quartic Threefolds
For the families ax4 = by4 +z4 +v4 +w4 , a, b = 1, . . . , 100, and ax3 = by3 + z3 + v3 + w3 , a, b = 1, . . . , 100, of projective algebraic threefolds, we test numerically the co...
Andreas-Stephan Elsenhans, Jörg Jahnel
ANTS
2006
Springer
125views Algorithms» more  ANTS 2006»
14 years 3 months ago
Arithmetic of Generalized Jacobians
This paper aims at introducing generalized Jacobians as a new candidate for discrete logarithm (DL) based cryptography. The motivation for this work came from the observation that ...
Isabelle Déchène
ASIAN
2004
Springer
153views Algorithms» more  ASIAN 2004»
14 years 3 months ago
Chi-Square Matrix: An Approach for Building-Block Identification
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of sol...
Chatchawit Aporntewan, Prabhas Chongstitvatana
APPROX
2004
Springer
89views Algorithms» more  APPROX 2004»
14 years 3 months ago
The Sketching Complexity of Pattern Matching
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
ANTS
2004
Springer
95views Algorithms» more  ANTS 2004»
14 years 3 months ago
Using Primitive Subgroups to Do More with Fewer Bits
Abstract. This paper gives a survey of some ways to improve the efficiency of discrete log-based cryptography by using the restriction of scalars and the geometry and arithmetic of...
Karl Rubin, Alice Silverberg
ANTS
2004
Springer
103views Algorithms» more  ANTS 2004»
14 years 3 months ago
A Comparison of CEILIDH and XTR
We give a comparison of the performance of the recently proposed torus-based public key cryptosystem CEILIDH, and XTR. Underpinning both systems is the mathematics of the two dimen...
Robert Granger, Dan Page, Martijn Stam