Algorithmic number theory : 5th international symposium, ANTS-V, Sydney, Australia, July 7-12, 2002 : proceedings
Zapisane w:
| Korporacja: | |
|---|---|
| Kolejni autorzy: | , |
| Format: | Livre numérique |
| Język: | Anglais |
| Wydane: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seria: | Lecture notes in computer science
2369 |
| Hasła przedmiotowe: | |
| Dostęp online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Komentarz: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithmic number theory, 5th international symposium, ANTS-V, Sydney, Australia, July 7-12, 2002, proceedings, Claus Fieker, David R. Kohel (eds.), Berlin, Springer, 2002, 1 vol. (X-515 p.), Lecture notes in computer science, 3-540-43863-7 • Algorithmic Number Theory, Texte imprimé, 9783662210642 |
| LEADER | 04979nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 972140 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155219065 | ||
| 020 | |a 9783540454557 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Algorithmic Number Theory Symposium |n (05 |d :2002 |c :Sydney). | |
| 245 | 1 | 0 | |a Algorithmic number theory : |b 5th international symposium, ANTS-V, Sydney, Australia, July 7-12, 2002 : proceedings |c [edited by] Claus Fieker, David R. Kohel. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2369 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Chiffrement (informatique) | ||
| 650 | |a Analyse numérique | ||
| 650 | |a Nombres, Théorie des | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Kohel, David R., |d 1966- |4 pbd | |
| 700 | 1 | |a Fieker, Claus, |d 1969- |4 pbd | |
| 776 | 0 | |0 069494622 |t Algorithmic number theory |o 5th international symposium, ANTS-V, Sydney, Australia, July 7-12, 2002 |o proceedings |f Claus Fieker, David R. Kohel (eds.) |c Berlin |n Springer |d 2002 |p 1 vol. (X-515 p.) |s Lecture notes in computer science |z 3-540-43863-7 | |
| 776 | 0 | |t Algorithmic Number Theory |b Texte imprimé |z 9783662210642 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-45455-1 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-NW9QHB9R-R |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750644818 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-45455-1 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753995840 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-45455-1 |z Accès INSA CVL | |
| 997 | |0 972140 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||