Sciweavers

421 search results - page 61 / 85
» Ant algorithms
Sort
View
ANTS
2000
Springer
96views Algorithms» more  ANTS 2000»
14 years 2 months ago
Coverings of Curves of Genus 2
We shall discuss the idea of finding all rational points on a curve C by first finding an associated collection of curves whose rational points cover those of C. This classical ...
E. Victor Flynn
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
2006
Springer
105views Algorithms» more  ANTS 2006»
14 years 1 months ago
A Modular Method for Computing the Splitting Field of a Polynomial
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
Guénaël Renault, Kazuhiro Yokoyama
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
ANTS
2010
Springer
252views Algorithms» more  ANTS 2010»
14 years 1 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