000 04411nam a22006015i 4500
001 978-3-540-44994-2
003 DE-He213
005 20240423132502.0
007 cr nn 008mamaa
008 121227s2000 gw | s |||| 0|eng d
020 _a9783540449942
_9978-3-540-44994-2
024 7 _a10.1007/10722028
_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] :
_b4th International Symposium, ANTS-IV Leiden, The Netherlands, July 2-7, 2000 Proceedings /
_cedited by Wieb Bosma.
250 _a1st ed. 2000.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2000.
300 _aIX, 612 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 ;
_v1838
505 0 _aInvited Talks -- The Complexity of Some Lattice Problems -- Rational Points Near Curves and Small Nonzero / x 3 ? y 2/ via Lattice Reduction -- Coverings of Curves of Genus 2 -- Lattice Reduction in Cryptology: An Update -- Contributed Papers -- Construction of Secure C ab Curves Using Modular Curves -- Curves over Finite Fields with Many Rational Points Obtained by Ray Class Field Extensions -- New Results on Lattice Basis Reduction in Practice -- Baby-Step Giant-Step Algorithms for Non-uniform Distributions -- On Powers as Sums of Two Cubes -- Factoring Polynomials over ?-Adic Fields -- Strategies in Filtering in the Number Field Sieve -- Factoring Polynomials over Finite Fields and Stable Colorings of Tournaments -- Computing Special Values of Partial Zeta Functions -- Construction of Tables of Quartic Number Fields -- Counting Discriminants of Number Fields of Degree up to Four -- On Reconstruction of Algebraic Numbers -- Dissecting a Sieve to Cut Its Need for Space -- Counting Points on Hyperelliptic Curves over Finite Fields -- Modular Forms for GL(3) and Galois Representations -- Modular Symbols and Hecke Operators -- Fast Jacobian Group Arithmetic on C ab Curves -- Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem -- A One Round Protocol for Tripartite Diffie–Hellman -- On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields -- Component Groups of Quotients of J 0(N) -- Fast Computation of Relative Class Numbers of CM-Fields -- On Probable Prime Testing and the Computation of Square Roots mod n -- Improving Group Law Algorithms for Jacobians of Hyperelliptic Curves -- Central Values of Artin L-Functions for Quaternion Fields -- The Pseudoprimes up to 1013 -- Computing the Number of Goldbach Partitions up to 5 108 -- NumericalVerification of the Brumer-Stark Conjecture -- Explicit Models of Genus 2 Curves with Split CM -- Reduction in Purely Cubic Function Fields of Unit Rank One -- Factorization in the Composition Algebras -- A Fast Algorithm for Approximately Counting Smooth Numbers -- Computing All Integer Solutions of a General Elliptic Equation -- A Note on Shanks’s Chains of Primes -- Asymptotically Fast Discrete Logarithms in Quadratic Number Fields -- Asymptotically Fast GCD Computation in ?[i].
650 0 _aNumber theory.
650 0 _aCryptography.
650 0 _aData encryption (Computer science).
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 1 4 _aNumber Theory.
650 2 4 _aCryptology.
650 2 4 _aAlgorithms.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aBosma, Wieb.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540676959
776 0 8 _iPrinted edition:
_z9783662179826
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1838
856 4 0 _uhttps://doi.org/10.1007/10722028
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188265
_d188265