LEADER 05720nam 22007455 450 001 996465629503316 005 20220919154446.0 010 $a3-540-70632-1 024 7 $a10.1007/3-540-61581-4 035 $a(CKB)1000000000234504 035 $a(SSID)ssj0000321186 035 $a(PQKBManifestationID)11212657 035 $a(PQKBTitleCode)TC0000321186 035 $a(PQKBWorkID)10262443 035 $a(PQKB)11453029 035 $a(DE-He213)978-3-540-70632-8 035 $a(PPN)155233017 035 $a(EXLCZ)991000000000234504 100 $a20121227d1996 u| 0 101 0 $aeng 135 $aurnn#---mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithmic Number Theory$b[electronic resource] $eSecond International Symposium, ANTS-II, Talence, France, May 18 - 23, 1996, Proceedings /$fedited by Henri Cohen 205 $a1st ed. 1996. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1996. 215 $a1 online resource (X, 414 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1122 300 $aBibliographic Level Mode of Issuance: Monograph 311 1 $a3-540-61581-4 327 $aCounting rational points on curves and abelian varieties over finite fields -- Computing cubic fields in quasi-linear time -- Fast ideal arithmetic via lazy localization -- A comparative study of algorithms for computing continued fractions of algebraic numbers -- Computing ray class groups, conductors and discriminants -- Computing l-isogenies using the p-torsion -- On computing Hilbert class fields of prime degree -- On the reduction of composed relations from the number field sieve -- Checking the p-adic stark conjecture when p is archimedean -- A multiple polynomial general number field sieve -- Construction of high-rank elliptic curves over Q and Q(t) with non-trivial 2-torsion -- The height on an abelian variety -- On lattices over number fields -- Minimum discriminants of primitive sextic fields -- A new algorithm and refined bounds for extended gcd computation -- Application of thue equations to computing power integral bases in algebraic number fields -- Computing S-integral points on elliptic curves -- Probabilistic computation of the Smith normal form of a sparse integer matrix -- Ray class field constructions of curves over finite fields with many rational points -- Computing isogenies in F2n -- A computational technique for determining relative class numbers of CM-fields -- Old and new deterministic factoring algorithms -- Efficient algorithms for computing the Jacobi symbol -- The number field database on the World Wide web server http://hasse.mathematik.tu-muenchen.de/ -- An algorithm of subexponential type computing the class group of quadratic orders over principal ideal domains -- Computational aspects of Kummer theory -- On integral basis reduction in global function fields -- Computational aspects of curves of genus at least 2 -- The complexity of approximate optima for greatest common divisor computations -- Compact representation in real quadratic congruence function fields -- Discrete logarithms: The effectiveness of the index calculus method -- How difficult is it to solve a thue equation? -- Elliptic congruence function fields -- Algebraic geometry lattices and codes -- Computing discrete logarithms with the general number field sieve. 330 $aThis book constitutes the refereed post-conference proceedings of the Second International Algorithmic Number Theory Symposium, ANTS-II, held in Talence, France in May 1996. The 35 revised full papers included in the book were selected from a variety of submissions. They cover a broad spectrum of topics and report state-of-the-art research results in computational number theory and complexity theory. Among the issues addressed are number fields computation, Abelian varieties, factoring algorithms, finite fields, elliptic curves, algorithm complexity, lattice theory, and coding. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1122 606 $aComputers 606 $aAlgebra 606 $aAlgorithms 606 $aData encryption (Computer science) 606 $aComputer science?Mathematics 606 $aNumber theory 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aAlgebra$3https://scigraph.springernature.com/ontologies/product-market-codes/M11000 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aCryptology$3https://scigraph.springernature.com/ontologies/product-market-codes/I28020 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aNumber Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M25001 615 0$aComputers. 615 0$aAlgebra. 615 0$aAlgorithms. 615 0$aData encryption (Computer science). 615 0$aComputer science?Mathematics. 615 0$aNumber theory. 615 14$aTheory of Computation. 615 24$aAlgebra. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aCryptology. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumber Theory. 676 $a512/.7 702 $aCohen$b Henri$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aAlgorithmic Number Theory Symposium$d(2nd :$f1996 :$eTalence, France) 906 $aBOOK 912 $a996465629503316 996 $aAlgorithmic Number Theory$9772632 997 $aUNISA