Sold Out
Book Categories |
Gauss Composition and Generalizations | 1 | |
Elliptic Curves - The Crossroads of Theory and Computation | 9 | |
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems | 20 | |
Using Elliptic Curves of Rank One towards the Undecidability of Hilbert's Tenth Problem over Rings of Algebraic Integers | 33 | |
On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields | 43 | |
On Arithmetically Equivalent Number Fields of Small Degree | 67 | |
A Survey of Discriminant Counting | 80 | |
A Higher-Rank Mersenne Problem | 95 | |
An Application of Siegel Modular Functions to Kronecker's Limit Formula | 108 | |
Computational Aspects of NUCOMP | 120 | |
Efficient Computation of Class Numbers of Real Abelian Number Fields | 134 | |
An Accelerated Buchmann Algorithm for Regulator Computation in Real Quadratic Fields | 148 | |
Some Genus 3 Curves with Many Points | 163 | |
Trinomials ax[superscript 7] + bx + c and ax[superscript 8] + bx + c with Galois Groups of Order 168 and 8 - 168 | 172 | |
Computations on Modular Jacobian Surfaces | 189 | |
Integral Points on Punctured Abelian Surfaces | 198 | |
Genus 2 Curves with (3,3)-Split Jacobian and Large Automorphism Group | 205 | |
Transportable Modular Symbols and the Intersection Pairing | 219 | |
Action of Modular Correspondence around CM Points | 234 | |
Curves Dy[superscript 2] = x[superscript 3] - x of Odd Analytic Rank | 244 | |
Comparing Invariants for Class Fields of Imaginary Quadratic Fields | 252 | |
A Database of Elliptic Curves - First Report | 267 | |
Isogeny Volcanoes and the SEA Algorithm | 276 | |
Fast Elliptic Curve Point Counting Using Gaussian Normal Basis | 292 | |
An Extension of Kedlaya's Algorithm to Artin-Schreier Curves in Characteristic 2 | 308 | |
Implementing the Tate Pairing | 324 | |
Smooth Orders and Cryptographic Applications | 338 | |
Chinese Remaindering for Algebraic Numbers in a Hidden Field | 349 | |
An Algorithm for Computing Weierstrass Points | 357 | |
New Optimal Tame Towers of Function Fields over Small Finite Fields | 372 | |
Periodic Continued Fractions in Elliptic Function Fields | 390 | |
Fixed Points and Two-Cycles of the Discrete Logarithm | 405 | |
Random Cayley Digraphs and the Discrete Logarithm | 416 | |
The Function Field Sieve Is Quite Special | 431 | |
MPQS with Three Large Primes | 446 | |
An Improved Baby Step Giant Step Algorithm for Point Counting of Hyperelliptic Curves over Finite Fields | 461 | |
Factoring N = pq[superscript 2] with the Elliptic Curve Method | 475 | |
A New Scheme for Computing with Algebraically Closed Fields | 491 | |
Additive Complexity and Roots of Polynomials over Number Fields and p-adic Fields | 506 | |
Author Index | 517 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionAlgorithmic Number Theory
X
This Item is in Your InventoryAlgorithmic Number Theory
X
You must be logged in to review the productsX
X
X
Add Algorithmic Number Theory, This book constitutes the refereed proceedings of the 5th International Algorithmic Number Theory Symposium, ANTS-V, held in Sydney, Australia, in July 2002. The 34 revised full papers presented together with 5 invited papers have gone through a thoro, Algorithmic Number Theory to the inventory that you are selling on WonderClubX
X
Add Algorithmic Number Theory, This book constitutes the refereed proceedings of the 5th International Algorithmic Number Theory Symposium, ANTS-V, held in Sydney, Australia, in July 2002. The 34 revised full papers presented together with 5 invited papers have gone through a thoro, Algorithmic Number Theory to your collection on WonderClub |