| 000 | 04826nam a22006255i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-45455-7 | ||
| 003 | DE-He213 | ||
| 005 | 20240423132508.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s2002 gw | s |||| 0|eng d | ||
| 020 |
_a9783540454557 _9978-3-540-45455-7 |
||
| 024 | 7 |
_a10.1007/3-540-45455-1 _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] : _b5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings / _cedited by Claus Fieker, David R. Kohel. |
| 250 | _a1st ed. 2002. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2002. |
|
| 300 |
_aX, 522 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 ; _v2369 |
|
| 505 | 0 | _aInvited Talks -- Gauss Composition and Generalizations -- Elliptic Curves — The Crossroads of Theory and Computation -- The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems -- Using Elliptic Curves of Rank One towards the Undecidability of Hilbert’s Tenth Problem over Rings of Algebraic Integers -- On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields -- Number Theory -- On Arithmetically Equivalent Number Fields of Small Degree -- A Survey of Discriminant Counting -- A Higher-Rank Mersenne Problem -- An Application of Siegel Modular Functions to Kronecker’s Limit Formula -- Computational Aspects of NUCOMP -- Efficient Computation of Class Numbers of Real Abelian Number Fields -- An Accelerated Buchmann Algorithm for Regulator Computation in Real Quadratic Fields -- Arithmetic Geometry -- Some Genus 3 Curves with Many Points -- Trinomials ax 7 + bx + c and ax 8 + bx + c with Galois Groups of Order 168 and 8 · 168 -- Computations on Modular Jacobian Surfaces -- Integral Points on Punctured Abelian Surfaces -- Genus 2 Curves with (3, 3)-Split Jacobian and Large Automorphism Group -- Transportable Modular Symbols and the Intersection Pairing -- Elliptic Curves and CM -- Action of Modular Correspondences around CM Points -- Curves Dy 2 = x 3 — x of Odd Analytic Rank -- Comparing Invariants for Class Fields of Imaginary Quadratic Fields -- A Database of Elliptic Curves — First Report -- Point Counting -- Isogeny Volcanoes and the SEA Algorithm -- Fast Elliptic Curve Point Counting Using Gaussian Normal Basis -- An Extension of Kedlaya’s Algorithm to Artin-Schreier Curves in Characteristic 2 -- Cryptography -- Implementing the Tate Pairing -- Smooth Orders and Cryptographic Applications -- Chinese Remaindering for Algebraic Numbers in a Hidden Field.-Function Fields -- An Algorithm for Computing Weierstrass Points -- New Optimal Tame Towers of Function Fields over Small Finite Fields -- Periodic Continued Fractions in Elliptic Function Fields -- Discrete Logarithms and Factoring -- Fixed Points and Two-Cycles of the Discrete Logarithm -- Random Cayley Digraphs and the Discrete Logarithm -- The Function Field Sieve Is Quite Special -- MPQS with Three Large Primes -- An Improved Baby Step Giant Step Algorithm for Point Counting of Hyperelliptic Curves over Finite Fields -- Factoring N = pq 2 with the Elliptic Curve Method -- Gröbner Bases -- A New Scheme for Computing with Algebraically Closed Fields -- Complexity -- Additive Complexity and Roots of Polynomials over Number Fields and -adic Fields. | |
| 650 | 0 | _aNumber theory. | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 |
_aComputer science _xMathematics. |
|
| 650 | 0 | _aDiscrete mathematics. | |
| 650 | 0 | _aNumerical analysis. | |
| 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 | _aNumerical Analysis. |
| 650 | 2 | 4 | _aCryptology. |
| 700 | 1 |
_aFieker, Claus. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aKohel, David R. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540438632 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783662210642 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2369 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-45455-1 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 912 | _aZDB-2-BAE | ||
| 942 | _cSPRINGER | ||
| 999 |
_c188383 _d188383 |
||