|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-36076-6 |
| 003 |
DE-He213 |
| 005 |
20220114203034.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540360766
|9 978-3-540-36076-6
|
| 024 |
7 |
|
|a 10.1007/11792086
|2 doi
|
| 050 |
|
4 |
|a QA241-247.5
|
| 072 |
|
7 |
|a PBH
|2 bicssc
|
| 072 |
|
7 |
|a MAT022000
|2 bisacsh
|
| 072 |
|
7 |
|a PBH
|2 thema
|
| 082 |
0 |
4 |
|a 512.7
|2 23
|
| 245 |
1 |
0 |
|a Algorithmic Number Theory
|h [electronic resource] :
|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.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2006.
|
| 300 |
|
|
|a XII, 599 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 1611-3349 ;
|v 4076
|
| 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 -- 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 |
|a Number theory.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
|
0 |
|a Cryptography.
|
| 650 |
|
0 |
|a Data encryption (Computer science).
|
| 650 |
1 |
4 |
|a Number Theory.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Cryptology.
|
| 650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
| 700 |
1 |
|
|a Hess, Florian.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Pauli, Sebastian.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Pohst, Michael.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540826507
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540360759
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 1611-3349 ;
|v 4076
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11792086
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
