000 | 04970nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-540-36076-6 | ||
003 | DE-He213 | ||
005 | 20240423125659.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2006 gw | s |||| 0|eng d | ||
020 |
_a9783540360766 _9978-3-540-36076-6 |
||
024 | 7 |
_a10.1007/11792086 _2doi |
|
050 | 4 | _aQA241-247.5 | |
072 | 7 |
_aPBH _2bicssc |
|
072 | 7 |
_aMAT022000 _2bisacsh |
|
072 | 7 |
_aPBH _2thema |
|
082 | 0 | 4 |
_a512.7 _223 |
245 | 1 | 0 |
_aAlgorithmic Number Theory _h[electronic resource] : _b7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings / _cedited by Florian Hess, Sebastian Pauli, Michael Pohst. |
250 | _a1st ed. 2006. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2006. |
|
300 |
_aXII, 599 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v4076 |
|
505 | 0 | _aInvited 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 -- 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 -- 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. | |
650 | 0 | _aNumber theory. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aCryptography. | |
650 | 0 | _aData encryption (Computer science). | |
650 | 1 | 4 | _aNumber Theory. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aCryptology. |
650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
700 | 1 |
_aHess, Florian. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aPauli, Sebastian. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aPohst, Michael. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540360759 |
776 | 0 | 8 |
_iPrinted edition: _z9783540826507 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v4076 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/11792086 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c180576 _d180576 |