Sciweavers

1484 search results - page 65 / 297
» Ants meeting algorithms
Sort
View
ANTS
1998
Springer
139views Algorithms» more  ANTS 1998»
14 years 2 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
ANTS
2010
Springer
252views Algorithms» more  ANTS 2010»
14 years 2 months ago
On a Problem of Hajdu and Tengely
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ...
Samir Siksek, Michael Stoll
ANTS
2010
Springer
246views Algorithms» more  ANTS 2010»
14 years 2 months ago
Visualizing Elements of Sha[3] in Genus 2 Jacobians
Abstract. Mazur proved that any element ξ of order three in the Shafarevich-Tate group of an elliptic curve E over a number field k can be made visible in an abelian surface A in...
Nils Bruin, Sander R. Dahmen
ANTS
2006
Springer
125views Algorithms» more  ANTS 2006»
14 years 1 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
ANTS
2006
Springer
101views Algorithms» more  ANTS 2006»
14 years 1 months ago
High Security Pairing-Based Cryptography Revisited
The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We ...
Robert Granger, Dan Page, Nigel P. Smart