Open AccessBook
A Course in Computational Algebraic Number Theory
Reads0
Chats0
TLDR
The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods.Abstract:
A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.read more
Citations
More filters
Posted Content
Sharp Quantum vs. Classical Query Complexity Separations
TL;DR: A black-box problem that requires exponentially many queries in the classical bounded-error case, but can be solved exactly in the quantum case with a single query (and a polynomial number of auxiliary operations).
Journal ArticleDOI
Small generators of number fields
TL;DR: In this article, the existence of small generators of number fields was studied and it was shown that there are infinitely many number fields K of degree n with a generator α such that the height of α satisfies δ with δ.
Book ChapterDOI
Efficient explicit formulae for genus 2 hyperelliptic curves over prime fields and their implementations
Xinxin Fan,Guang Gong +1 more
TL;DR: Experimental results show that the algorithms can save up to 13% of the time to perform a scalar multiplication on a general genus 2 hyperelliptic curve over a prime field, when compared with the best known general methods.
Journal ArticleDOI
Computing fundamental domains for the Bruhat–Tits tree for , -adic automorphic forms, and the canonical embedding of Shimura curves
Cameron Franc,Marc Masdeu +1 more
TL;DR: In this paper, the Bruhat-Tits tree is used to compute spaces of rigid modular forms of arbitrary even weight, and how to evaluate such forms to high precision using overconvergent methods.
Dissertation
Isogeny graphs, modular polynomials, and applications
TL;DR: In this article, the authors give an algorithm to compute Hilbert modular polynomials for ordinary abelian varieties with maximal realmultiplication, which is the fastest known algorithm for curves satisfying the right properties.
References
More filters
Book
A Course of Modern Analysis
TL;DR: The volume now gives a somewhat exhaustive account of the various ramifications of the subject, which are set out in an attractive manner and should become indispensable, not only as a textbook for advanced students, but as a work of reference to those whose aim is to extend the knowledge of analysis.
Journal ArticleDOI
Modular multiplication without trial division
TL;DR: A method for multiplying two integers modulo N while avoiding division by N, a representation of residue classes so as to speed modular multiplication without affecting the modular addition and subtraction algorithms.
Book
Advanced Topics in the Arithmetic of Elliptic Curves
TL;DR: In this article, the authors continue the study of elliptic curves by presenting six important, but somewhat more specialized topics: Elliptic and modular functions for the full modular group.
Journal ArticleDOI
Improved methods for calculating vectors of short length in a lattice, including a complexity analysis
U. Fincke,Michael Pohst +1 more
TL;DR: In this paper, the authors show that searching through an ellipsoid is in many cases much more efficient than enumerating all vectors of Z'.. in a suitable box.
Journal ArticleDOI
Lattice basis reduction: improved practical algorithms and solving subset sum problems
Claus-Peter Schnorr,M. Euchner +1 more
TL;DR: Empirical tests show that the strongest of these algorithms solves almost all subset sum problems with up to 66 random weights of arbitrary bit length within at most a few hours on a UNISYS 6000/70 or within a couple of minutes on a SPARC1 + computer.
Related Papers (5)
A method for obtaining digital signatures and public-key cryptosystems
Graduate Texts in Mathematics
Rajendra Bhatia,Glen Bredon,Wolfgang Walter,Joseph J. Rotman,M. Ram Murty,Jane Gilman,Peter Walters,Martin Golubitsky,Ioannis Karatzas,Henri Cohen,Raoul Bott,Gaisi Takeuti,Béla Bollobás,John M. Lee,Jiří Matoušek,Saunders Mac Lane,John L. Kelley,B. A. Dubrovin,Tom M. Apostol,John Stillwell,William Arveson +20 more