Results 1  10
of
29
Elliptic Curves And Primality Proving
 Math. Comp
, 1993
"... The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm. ..."
Abstract

Cited by 162 (22 self)
 Add to MetaCart
The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm.
Modular data: the algebraic combinatorics of conformal field theory, preprint math.QA/0103044
"... This paper is primarily intended as an introduction for mathematicians to some of the rich algebraic combinatorics arising in for instance conformal field theory (CFT). It is essentially selfcontained, apart from some of the background motivation (Section I) and examples (Section III) which are inc ..."
Abstract

Cited by 32 (5 self)
 Add to MetaCart
This paper is primarily intended as an introduction for mathematicians to some of the rich algebraic combinatorics arising in for instance conformal field theory (CFT). It is essentially selfcontained, apart from some of the background motivation (Section I) and examples (Section III) which are included to give the reader a sense of the context.
Planar coincidences for Nfold symmetry
, 2005
"... The coincidence problem for planar patterns with Nfold symmetry is considered. For the Nfold symmetric module with N < 46, all isometries of the plane are classified that result in coincidences of finite index. This is done by reformulating the problem in terms of algebraic number fields and using ..."
Abstract

Cited by 16 (11 self)
 Add to MetaCart
The coincidence problem for planar patterns with Nfold symmetry is considered. For the Nfold symmetric module with N < 46, all isometries of the plane are classified that result in coincidences of finite index. This is done by reformulating the problem in terms of algebraic number fields and using prime factorization. The more complicated case N ≥ 46 is briefly discussed and N = 46 is described explicitly. The results of the coincidence problem also solve the problem of colour lattices in two dimensions and its natural generalization to colour modules.
Class Field Theory in Characteristic p, its Origin and Development
 the Proceedings of the International Conference on Class Field Theory (Tokyo
, 2002
"... Today's notion of "global field" comprises number fields (algebraic, of finite degree) and function fields (algebraic, of dimension 1, finite base field). They have many similar arithmetic properties. The systematic study of these similarities seems to have been started by Dedekind (1857). A new imp ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
Today's notion of "global field" comprises number fields (algebraic, of finite degree) and function fields (algebraic, of dimension 1, finite base field). They have many similar arithmetic properties. The systematic study of these similarities seems to have been started by Dedekind (1857). A new impetus was given by the seminal thesis of E. Artin (1921, published in 1924). In this exposition I shall report on the development during the twenties and thirties of our century, with emphasis on the emergence of class field theory for function elds. The names of F.K.Schmidt, H. Hasse, E. Witt, C. Chevalley (among others) are closely connected with that development.
Implementation Of The AtkinGoldwasserKilian Primality Testing Algorithm
 Rapport de Recherche 911, INRIA, Octobre
, 1988
"... . We describe a primality testing algorithm, due essentially to Atkin, that uses elliptic curves over finite fields and the theory of complex multiplication. In particular, we explain how the use of class fields and genus fields can speed up certain phases of the algorithm. We sketch the actual impl ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
. We describe a primality testing algorithm, due essentially to Atkin, that uses elliptic curves over finite fields and the theory of complex multiplication. In particular, we explain how the use of class fields and genus fields can speed up certain phases of the algorithm. We sketch the actual implementation of this test and its use on testing large primes, the records being two numbers of more than 550 decimal digits. Finally, we give a precise answer to the question of the reliability of our computations, providing a certificate of primality for a prime number. IMPLEMENTATION DU TEST DE PRIMALITE D' ATKIN, GOLDWASSER, ET KILIAN R'esum'e. Nous d'ecrivons un algorithme de primalit'e, principalement du `a Atkin, qui utilise les propri'et'es des courbes elliptiques sur les corps finis et la th'eorie de la multiplication complexe. En particulier, nous expliquons comment l'utilisation du corps de classe et du corps de genre permet d'acc'el'erer les calculs. Nous esquissons l'impl'ementati...
Unramified quaternion extensions of quadratic number fields
 J. Théor. N. Bordeaux
, 1997
"... The first mathematician who studied quaternion extensions (H8extensions for short) was Dedekind [6]; he gave Q ( (2 + √ 2)(3 + √ 6) ) as an example. The ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
The first mathematician who studied quaternion extensions (H8extensions for short) was Dedekind [6]; he gave Q ( (2 + √ 2)(3 + √ 6) ) as an example. The
Heegner points, Heegner cycles, and congruences
, 2000
"... We define certain objects associated to a modular elliptic curve E and a discriminant D satisfying suitable conditions. These objects interpolate special values of the complex Lfunctions associated to E over the quadratic field Q( p D), in the same way that Bernouilli numbers interpolate specia ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
We define certain objects associated to a modular elliptic curve E and a discriminant D satisfying suitable conditions. These objects interpolate special values of the complex Lfunctions associated to E over the quadratic field Q( p D), in the same way that Bernouilli numbers interpolate special values of Dirichlet Lseries. Following an approach of Mazur and Tate [MT], one can make conjectures about congruences satised by these objects which are resonant with the usual Birch and SwinnertonDyer conjectures. These conjectures exhibit some surprising features not apparent in the classical case.
Topological Conjugacy of Linear Endomorphisms of the 2Torus
 Trans. Amer. Math. Soc
, 1997
"... . We describe two complete sets of numerical invariants of topological conjugacy for linear endomorphisms of the twodimensional torus, i.e., continuous maps from the torus to itself which are covered by linear maps of the plane. The trace and determinant are part of both complete sets, and two can ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
. We describe two complete sets of numerical invariants of topological conjugacy for linear endomorphisms of the twodimensional torus, i.e., continuous maps from the torus to itself which are covered by linear maps of the plane. The trace and determinant are part of both complete sets, and two candidates are proposed for a third (and last) invariant which, in both cases, can be understood from the topological point of view. One of our invariants is in fact the ideal class of the LatimerMacDuffeeTaussky theory, reformulated in more elementary terms and interpreted as describing some topology. Merely, one has to look at how closed curves on the torus intersect their image under the endomorphism. Part of the intersection information (the intersection number counted with multiplicity) can be captured by a binary quadratic form associated to the map, so that we can use the classical theories initiated by Lagrange and Gauss. To go beyond the intersection number, and shortcut the classifi...
On the exponent of the group of points on elliptic curves in extension fields
 Intern. Math. Research Notices
"... Let E be an elliptic curve defined over Fq, a finite field of q elements. Furthermore, we consider ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Let E be an elliptic curve defined over Fq, a finite field of q elements. Furthermore, we consider
Solvability by Radicals from an Algorithmic Point of View
, 2001
"... Any textbook on Galois theory contains a proof that a polynomial equation with solvable Galois group can be solved by radicals. From a practical point of view, we need to nd suitable representations of the group and the roots of the polynomial. We first reduce the problem to that of cyclic extension ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Any textbook on Galois theory contains a proof that a polynomial equation with solvable Galois group can be solved by radicals. From a practical point of view, we need to nd suitable representations of the group and the roots of the polynomial. We first reduce the problem to that of cyclic extensions of prime degree and then work out the radicals, using the work of Girstmair. We give numerical examples of Abelian and nonAbelian solvable equations and apply the general framework to the construction of Hilbert Class fields of imaginary quadratic fields.