default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th ANTS 2006: Berlin, Germany
- Florian Hess, Sebastian Pauli, Michael E. Pohst:
Algorithmic Number Theory, 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings. Lecture Notes in Computer Science 4076, Springer 2006, ISBN 3-540-36075-1
Invited Talks
- Nigel Boston, Harris Nover
:
Computing Pro-P Galois Groups. 1-10 - John Cremona:
The Elliptic Curve Database for Conductors to 130000. 11-29 - Bas Edixhoven:
On the Computation of the Coefficients of a Modular Form. 30-39 - Étienne Fouvry, Jürgen Klüners:
Cohen-Lenstra Heuristics of Quadratic Number Fields. 40-55
Algebraic Number Theory
- Miho Aoki, Takashi Fukuda:
An Algorithm for Computing p-Class Groups of Abelian Number Fields. 56-71 - Werner Bley, Robert Boltje:
Computation of Locally Free Class Groups. 72-86 - Michael J. Jacobson Jr., Shantha Ramachandran, Hugh C. Williams:
Numerical Results on Class Groups of Imaginary Quadratic Fields. 87-101 - Masanari Kida:
Cyclic Polynomials Arising from Kummer Theory of Norm Algebraic Tori. 102-113 - Gunter Malle:
The Totally Real Primitive Number Fields of Discriminant at Most 109. 114-123 - Guénaël Renault, Kazuhiro Yokoyama:
A Modular Method for Computing the Splitting Field of a Polynomial. 124-140
Analytic and Elementary Number Theory
- Jean-Marc Deshouillers, François Hennecart, Bernard Landreau:
On the Density of Sums of Three Cubes. 141-155 - Tadej Kotnik, Herman te Riele:
The Mertens Conjecture Revisited. 156-167 - Scott T. Parsell, Jonathan Sorenson:
Fast Bounds on the Distribution of Smooth Numbers. 168-181 - Parthasarathy Ramachandran:
Use of Extended Euclidean Algorithm in Solving a System of Linear Diophantine Equations with Bounded Variables. 182-192 - Jonathan Sorenson:
The Pseudosquares Prime Sieve. 193-207 - Kjell Wooding, Hugh C. Williams:
Doubly-Focused Enumeration of Pseudosquares and Pseudocubes. 208-221
Lattices
- Johannes Buchmann, Christoph Ludwig:
Practical Lattice Basis Sampling Reduction. 222-237 - Phong Q. Nguyen, Damien Stehlé:
LLL on the Average. 238-256 - Damien Stehlé:
On the Randomness of Bits Generated by Sufficiently Smooth Functions. 257-274
Curves and Varieties over Fields of Characteristic Zero
- John Cremona, Samir Siksek:
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q. 275-286 - Noam D. Elkies:
Points of Low Height on Elliptic Curves and Surfaces I: Elliptic Surfaces over \mathbb P1 with Small d. 287-301 - Noam D. Elkies:
Shimura Curves for Level-3 Subgroups of the (2, 3, 7) Triangle Group, and Some Other Examples. 302-316 - Andreas-Stephan Elsenhans, Jörg Jahnel:
The Asymptotics of Points of Bounded Height on Diagonal Cubic and Quartic Threefolds. 317-332 - Tom Fisher:
Testing Equivalence of Ternary Cubics. 333-345 - Martine Girard, David R. Kohel:
Classification of Genus 3 Curves in Special Strata of the Moduli Space. 346-360 - Matthew Greenberg:
Heegner Point Computations Via Numerical p-Adic Integration. 361-376 - Phil Martin, Mark Watkins:
Symmetric Powers of Elliptic Curve L-Functions. 377-392 - Alfred J. van der Poorten:
Determined Sequences, Continued Fractions, and Hyperelliptic Curves. 393-405 - John Voight:
Computing CM Points on Shimura Curves Arising from Cocompact Arithmetic Triangle Groups. 406-420
Curves over Finite Fields and Applications
- Isabelle Déchène:
Arithmetic of Generalized Jacobians. 421-435 - Alexander W. Dent, Steven D. Galbraith:
Hidden Pairings and Trapdoor DDH Groups. 436-451 - David Freeman:
Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10. 452-465 - Gerhard Frey, Tanja Lange:
Fast Bilinear Maps from the Tate-Lichtenbaum Pairing on Hyperelliptic Curves. 466-479 - Robert Granger, Dan Page, Nigel P. Smart:
High Security Pairing-Based Cryptography Revisited. 480-494 - David R. Kohel, Benjamin A. Smith:
Efficiently Computable Endomorphisms for Hyperelliptic Curves. 495-509 - Andrew Shallue, Christiaan E. van de Woestijne:
Construction of Rational Points on Elliptic Curves over Finite Fields. 510-524 - Paul Zimmermann, Bruce Dodson:
20 Years of ECM. 525-542
Discrete Logarithms
- Claus Diem:
An Index Calculus Algorithm for Plane Curves of Small Degree. 543-557 - Ming-Deh A. Huang, Wayne Raskind:
Signature Calculus and Discrete Logarithm Problems. 558-572 - Stephen D. Miller, Ramarathnam Venkatesan:
Spectral Analysis of Pollard Rho Collisions. 573-581 - Ilya Mironov, Anton Mityagin, Kobbi Nissim:
Hard Instances of the Constrained Discrete Logarithm Problem. 582-598
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-23 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
