You have Guest access.
Log In
Guillaume Hanrot, François Morain and Emmanuel Thomé
Front matter
1
Putting the Hodge and Tate Conjectures to the Test
2
Curves of Genus 3 with a Group of Automorphisms Isomorphic to S3
3
Learning with Errors over Rings
4-5
Lattices and Spherical Designs
6-15
Fixed Points for Discrete Logarithms
16-31
Explicit Coleman Integration for Hyperelliptic Curves
32-49
Smallest Reduction Matrix of Binary Quadratic Forms And Cryptographic Applications
50-65
Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields
66-82
On the Use of the Negation Map in the Pollard Rho Method
83-95
An O(M(n) logn) Algorithm for the Jacobi Symbol
96-109
New Families of ECM Curves for Cunningham Numbers
110-125
Visualizing Elements of Sha[3] in Genus 2 Jacobians
126-141
On Weil Polynomials of K3 Surfaces
142-156
Class Invariants by the CRT Method
157-173
Short Bases of Lattices over Number Fields
174-185
On the Complexity of the Montes Ideal Factorization Algorithm
186-200
Congruent Number Theta Coefficients to 1012
201-218
Pairing the Volcano
219-233
A Subexponential Algorithm for Evaluating Large Degree Isogenies
234-250
Huff’s Model for Elliptic Curves
251-269
Efficient Pairing Computation with Theta Functions
270-284
Small-Span Characteristic Polynomials of Integer Symmetric Matrices
285-300
Decomposition Attack for the Jacobian of a Hyperelliptic Curve over an Extension Field
301-315
Factoring Polynomials over Local Fields II
316-330
On a Problem of Hajdu and Tengely
331-339
Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures
340-356
On the Extremality of an 80-Dimensional Lattice
357-371
Computing Automorphic Forms on Shimura Curves over Fields with Arbitrary Class Number
372-384
Improved Primality Proving with Eisenstein Pseudocubes
385-396
Hyperbolic Tessellations Associated to Bianchi Groups
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info