|
|
|
|
LEADER |
04095nmm a2200409 u 4500 |
001 |
EB000376491 |
003 |
EBX01000000000000000229543 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
130626 ||| eng |
020 |
|
|
|a 9783540360766
|
100 |
1 |
|
|a Hess, Florian
|e [editor]
|
245 |
0 |
0 |
|a Algorithmic Number Theory
|h Elektronische Ressource
|b 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings
|c edited by Florian Hess, Sebastian Pauli, Michael Pohst
|
250 |
|
|
|a 1st ed. 2006
|
260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2006, 2006
|
300 |
|
|
|a XII, 599 p
|b online resource
|
505 |
0 |
|
|a Computing CM Points on Shimura Curves Arising from Cocompact Arithmetic Triangle Groups -- Arithmetic of Generalized Jacobians -- Hidden Pairings and Trapdoor DDH Groups -- Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10 -- Fast Bilinear Maps from the Tate-Lichtenbaum Pairing on Hyperelliptic Curves -- High Security Pairing-Based Cryptography Revisited -- Efficiently Computable Endomorphisms for Hyperelliptic Curves -- Construction of Rational Points on Elliptic Curves over Finite Fields -- 20 Years of ECM -- Discrete Logarithms -- An Index Calculus Algorithm for Plane Curves of Small Degree -- Signature Calculus and Discrete Logarithm Problems -- Spectral Analysis of Pollard Rho Collisions -- Hard Instances of the Constrained Discrete Logarithm Problem
|
505 |
0 |
|
|a Invited Talks -- Computing Pro-P Galois Groups -- The Elliptic Curve Database for Conductors to 130000 -- On the Computation of the Coefficients of a Modular Form -- Cohen–Lenstra Heuristics of Quadratic Number Fields -- Algebraic Number Theory -- An Algorithm for Computing p-Class Groups of Abelian Number Fields -- Computation of Locally Free Class Groups -- Numerical Results on Class Groups of Imaginary Quadratic Fields -- Cyclic Polynomials Arising from Kummer Theory of Norm Algebraic Tori -- The Totally Real Primitive Number Fields of Discriminant at Most 109 -- A Modular Method for Computing the Splitting Field of a Polynomial -- Analytic and Elementary Number Theory -- On the Density of Sums of Three Cubes -- The Mertens Conjecture Revisited -- Fast Bounds on the Distribution of Smooth Numbers -- Use of Extended Euclidean Algorithm in Solving a System of Linear Diophantine Equations with Bounded Variables -- The Pseudosquares Prime Sieve --
|
505 |
0 |
|
|a Doubly-Focused Enumeration of Pseudosquares and Pseudocubes -- Lattices -- Practical Lattice Basis Sampling Reduction -- LLL on the Average -- On the Randomness of Bits Generated by Sufficiently Smooth Functions -- Curves and Varieties over Fields of Characteristic Zero -- Computing a Lower Bound for the Canonical Height on Elliptic Curves over ? -- Points of Low Height on Elliptic Curves and Surfaces I: Elliptic Surfaces over with Small d -- Shimura Curves for Level-3 Subgroups of the (2,3,7) Triangle Group, and Some Other Examples -- The Asymptotics of Points of Bounded Height on Diagonal Cubic and Quartic Threefolds -- Testing Equivalence of Ternary Cubics -- Classification of Genus 3 Curves in Special Strata of the Moduli Space -- Heegner Point Computations Via Numerical p-Adic Integration -- Symmetric Powers of Elliptic Curve L-Functions.-Determined Sequences, Continued Fractions, and Hyperelliptic Curves --
|
653 |
|
|
|a Number theory
|
653 |
|
|
|a Symbolic and Algebraic Manipulation
|
653 |
|
|
|a Computer science / Mathematics
|
653 |
|
|
|a Discrete Mathematics in Computer Science
|
653 |
|
|
|a Number Theory
|
653 |
|
|
|a Cryptography
|
653 |
|
|
|a Algorithms
|
653 |
|
|
|a Data encryption (Computer science)
|
653 |
|
|
|a Cryptology
|
653 |
|
|
|a Discrete mathematics
|
700 |
1 |
|
|a Pauli, Sebastian
|e [editor]
|
700 |
1 |
|
|a Pohst, Michael
|e [editor]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
490 |
0 |
|
|a Lecture Notes in Computer Science
|
028 |
5 |
0 |
|a 10.1007/11792086
|
856 |
4 |
0 |
|u https://doi.org/10.1007/11792086?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 512.7
|