Algorithmic number theory : 4th international symposium, ANTS-IV, Leiden, the Netherlands, July 2-7, 2000 : proceedings
Na minha lista:
| Autor Corporativo: | |
|---|---|
| Outros Autores: | |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colecção: | Lecture notes in computer science
1838 |
| Assuntos: | |
| Acesso em linha: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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, 4th international symposium, ANTS-IV, Leiden, the Netherlands, July 2-7, 2000, proceedings, Wieb Bosma (ed.), 2000, New York, Springer, 1 volume (IX-613 pages), Lecture notes in computer science, 3-540-67695-3 • Algorithmic Number Theory, Texte imprimé, 9783662179826 |
| LEADER | 04646nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 971309 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155205056 | ||
| 020 | |a 9783540449942 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 512.7 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a Algorithmic Number Theory Symposium |n (04 |d :2000 |c :Leiden, Pays-Bas). | |
| 245 | 1 | 0 | |a Algorithmic number theory : |b 4th international symposium, ANTS-IV, Leiden, the Netherlands, July 2-7, 2000 : proceedings |c [edited by] Wieb Bosma. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1838 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited 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]. | |
| 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 Nombres, Théorie des | ||
| 650 | |a Congés | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Bosma, Wieb. |4 pbd | |
| 776 | 0 | |0 051992426 |t Algorithmic number theory |o 4th international symposium, ANTS-IV, Leiden, the Netherlands, July 2-7, 2000 |o proceedings |f Wieb Bosma (ed.) |d 2000 |c New York |n Springer |p 1 volume (IX-613 pages) |s Lecture notes in computer science |z 3-540-67695-3 | |
| 776 | 0 | |t Algorithmic Number Theory |b Texte imprimé |z 9783662179826 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/10722028 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-PN47VPGH-1 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750653973 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/10722028 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754004090 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/10722028 |z Accès INSA CVL | |
| 997 | |0 971309 |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/ | ||