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
Small isospectral and nonisometric orbifolds of dimension 2 and 3
TL;DR: In this paper, a construction due to Vigneras is revisited, where small pairs of orbifolds and manifolds of dimension 2 and 3 arising from arithmetic Fuchsian and Kleinian groups that are Laplace isospectral but nonisometric are constructed.
Book ChapterDOI
Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
TL;DR: In this paper, the authors proposed a signature and commitment scheme compatible with Lyubashevsky's Fiat-Shamir proofs with abort, currently the most efficient zero-knowledge proofs for lattices.
Proceedings ArticleDOI
On a modular algorithm for computing GCDs of polynomials over algebraic number fields
TL;DR: The gcd algorithm can be applied directly to polynomials that are not necessarily represented in terms of an algebraic integer, and the use of an algorithm for recovering a rational number from its modular residue so that the denominator bound need not be computed explicitly is suggested.
Journal ArticleDOI
Discriminants cubiques et progressions arithmétiques
Karim Belabas,Étienne Fouvry +1 more
TL;DR: In this paper, the density of discriminants of Galois sextic fields with group S3 was studied in an arithmetic progression, in the largest possible uniformity with respect to the modulus.
Destructive and constructive aspects of efficient algorithms and implementation of cryptographic hardware
TL;DR: This thesis investigates two aspects of cryptographic hardware: constructive applications that deal with general purpose secure devices and destructive applications that handle dedicated hardware attacks against cryptosystems, and proves that FPGA-based solutions are much more cost-effective and low power than software- based solutions.
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