Algebraic theory of quadratic numbers / Mak Trifković |
Autore | Trifković, Mak |
Pubbl/distr/stampa | New York : Springer, 2013 |
Descrizione fisica | XI, 197 p. ; 24 cm |
Disciplina | 512.7 |
Collana | Universitext |
Soggetto non controllato | Teoria dei numeri - Esposizione didattica |
ISBN | 978-1-4614-7716-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-990009793210403321 |
Trifković, Mak | ||
New York : Springer, 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithmic number theory / E. Bach, J. Shallit |
Autore | Bach, Eric |
Pubbl/distr/stampa | Cambridge : The Mit press, c1997 |
Descrizione fisica | ; 24 cm |
Disciplina | 512.7 |
Altri autori (Persone) | Shallit, Jeffrey |
Collana | Foundations of Computing Series |
Soggetto non controllato |
Teoria dei numeri
Algoritmi |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 1.: Efficient algorithms |
Record Nr. | UNINA-990008338040403321 |
Bach, Eric | ||
Cambridge : The Mit press, c1997 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithmic Number Theory [[electronic resource] ] : 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010, Proceedings / / edited by Guillaume Hanrot, Francois Morain, Emmanuel Thomé |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XI, 397 p. 15 illus.) |
Disciplina | 512.7 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Cryptography Data encryption (Computer science) Number theory Discrete Mathematics in Computer Science Cryptology Symbolic and Algebraic Manipulation Number Theory |
ISBN |
1-280-38804-8
9786613565969 3-642-14518-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited papers -- Putting the Hodge and Tate Conjectures to the Test -- Curves of Genus 3 with a Group of Automorphisms Isomorphic to S3 -- Learning with Errors over Rings -- Lattices and Spherical Designs -- Fixed Points for Discrete Logarithms -- Contributed papers -- Explicit Coleman Integration for Hyperelliptic Curves -- Smallest Reduction Matrix of Binary Quadratic Forms -- Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields -- On the Use of the Negation Map in the Pollard Rho Method -- An O(M(n) logn) Algorithm for the Jacobi Symbol -- New Families of ECM Curves for Cunningham Numbers -- Visualizing Elements of Sha[3] in Genus 2 Jacobians -- On Weil Polynomials of K3 Surfaces -- Class Invariants by the CRT Method -- Short Bases of Lattices over Number Fields -- On the Complexity of the Montes Ideal Factorization Algorithm -- Congruent Number Theta Coefficients to 1012 -- Pairing the Volcano -- A Subexponential Algorithm for Evaluating Large Degree Isogenies -- Huff’s Model for Elliptic Curves -- Efficient Pairing Computation with Theta Functions -- Small-Span Characteristic Polynomials of Integer Symmetric Matrices -- Decomposition Attack for the Jacobian of a Hyperelliptic Curve over an Extension Field -- Factoring Polynomials over Local Fields II -- On a Problem of Hajdu and Tengely -- Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures -- On the Extremality of an 80-Dimensional Lattice -- Computing Automorphic Forms on Shimura Curves over Fields with Arbitrary Class Number -- Improved Primality Proving with Eisenstein Pseudocubes -- Hyperbolic Tessellations Associated to Bianchi Groups. |
Record Nr. | UNISA-996465804803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic Number Theory [[electronic resource] ] : 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010, Proceedings / / edited by Guillaume Hanrot, Francois Morain, Emmanuel Thomé |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XI, 397 p. 15 illus.) |
Disciplina | 512.7 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Cryptography Data encryption (Computer science) Number theory Discrete Mathematics in Computer Science Cryptology Symbolic and Algebraic Manipulation Number Theory |
ISBN |
1-280-38804-8
9786613565969 3-642-14518-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited papers -- Putting the Hodge and Tate Conjectures to the Test -- Curves of Genus 3 with a Group of Automorphisms Isomorphic to S3 -- Learning with Errors over Rings -- Lattices and Spherical Designs -- Fixed Points for Discrete Logarithms -- Contributed papers -- Explicit Coleman Integration for Hyperelliptic Curves -- Smallest Reduction Matrix of Binary Quadratic Forms -- Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields -- On the Use of the Negation Map in the Pollard Rho Method -- An O(M(n) logn) Algorithm for the Jacobi Symbol -- New Families of ECM Curves for Cunningham Numbers -- Visualizing Elements of Sha[3] in Genus 2 Jacobians -- On Weil Polynomials of K3 Surfaces -- Class Invariants by the CRT Method -- Short Bases of Lattices over Number Fields -- On the Complexity of the Montes Ideal Factorization Algorithm -- Congruent Number Theta Coefficients to 1012 -- Pairing the Volcano -- A Subexponential Algorithm for Evaluating Large Degree Isogenies -- Huff’s Model for Elliptic Curves -- Efficient Pairing Computation with Theta Functions -- Small-Span Characteristic Polynomials of Integer Symmetric Matrices -- Decomposition Attack for the Jacobian of a Hyperelliptic Curve over an Extension Field -- Factoring Polynomials over Local Fields II -- On a Problem of Hajdu and Tengely -- Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures -- On the Extremality of an 80-Dimensional Lattice -- Computing Automorphic Forms on Shimura Curves over Fields with Arbitrary Class Number -- Improved Primality Proving with Eisenstein Pseudocubes -- Hyperbolic Tessellations Associated to Bianchi Groups. |
Record Nr. | UNINA-9910483761503321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithmic Number Theory [[electronic resource] ] : 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings / / edited by Florian Hess, Sebastian Pauli, Michael Pohst |
Edizione | [1st ed. 2006.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
Descrizione fisica | 1 online resource (XII, 599 p.) |
Disciplina | 512.7 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Number theory
Algorithms Computer science—Mathematics Data encryption (Computer science) Number Theory Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Cryptology Symbolic and Algebraic Manipulation |
Soggetto non controllato |
Algorithmic number theory
ANTS |
ISBN | 3-540-36076-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Computing Pro-P Galois Groups -- The Elliptic Curve Database for Conductors to 130000 -- On the Computation of the Coefficients of a Modular Form -- Cohen–Lenstra Heuristics of Quadratic Number Fields -- Algebraic Number Theory -- An Algorithm for Computing p-Class Groups of Abelian Number Fields -- Computation of Locally Free Class Groups -- Numerical Results on Class Groups of Imaginary Quadratic Fields -- Cyclic Polynomials Arising from Kummer Theory of Norm Algebraic Tori -- The Totally Real Primitive Number Fields of Discriminant at Most 109 -- A Modular Method for Computing the Splitting Field of a Polynomial -- Analytic and Elementary Number Theory -- On the Density of Sums of Three Cubes -- The Mertens Conjecture Revisited -- Fast Bounds on the Distribution of Smooth Numbers -- Use of Extended Euclidean Algorithm in Solving a System of Linear Diophantine Equations with Bounded Variables -- The Pseudosquares Prime Sieve -- Doubly-Focused Enumeration of Pseudosquares and Pseudocubes -- Lattices -- Practical Lattice Basis Sampling Reduction -- LLL on the Average -- On the Randomness of Bits Generated by Sufficiently Smooth Functions -- Curves and Varieties over Fields of Characteristic Zero -- Computing a Lower Bound for the Canonical Height on Elliptic Curves over ? -- Points of Low Height on Elliptic Curves and Surfaces I: Elliptic Surfaces over with Small d -- Shimura Curves for Level-3 Subgroups of the (2,3,7) Triangle Group, and Some Other Examples -- The Asymptotics of Points of Bounded Height on Diagonal Cubic and Quartic Threefolds -- Testing Equivalence of Ternary Cubics -- Classification of Genus 3 Curves in Special Strata of the Moduli Space -- Heegner Point Computations Via Numerical p-Adic Integration -- Symmetric Powers of Elliptic Curve L-Functions -- Determined Sequences, Continued Fractions, and Hyperelliptic Curves -- Computing CM Points on Shimura Curves Arising from Cocompact Arithmetic Triangle Groups -- Arithmetic of Generalized Jacobians -- Hidden Pairings and Trapdoor DDH Groups -- Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10 -- Fast Bilinear Maps from the Tate-Lichtenbaum Pairing on Hyperelliptic Curves -- High Security Pairing-Based Cryptography Revisited -- Efficiently Computable Endomorphisms for Hyperelliptic Curves -- Construction of Rational Points on Elliptic Curves over Finite Fields -- 20 Years of ECM -- Discrete Logarithms -- An Index Calculus Algorithm for Plane Curves of Small Degree -- Signature Calculus and Discrete Logarithm Problems -- Spectral Analysis of Pollard Rho Collisions -- Hard Instances of the Constrained Discrete Logarithm Problem. |
Record Nr. | UNISA-996466022603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic Number Theory [[electronic resource] ] : 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings / / edited by Florian Hess, Sebastian Pauli, Michael Pohst |
Edizione | [1st ed. 2006.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
Descrizione fisica | 1 online resource (XII, 599 p.) |
Disciplina | 512.7 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Number theory
Algorithms Computer science—Mathematics Data encryption (Computer science) Number Theory Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Cryptology Symbolic and Algebraic Manipulation |
Soggetto non controllato |
Algorithmic number theory
ANTS |
ISBN | 3-540-36076-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Computing Pro-P Galois Groups -- The Elliptic Curve Database for Conductors to 130000 -- On the Computation of the Coefficients of a Modular Form -- Cohen–Lenstra Heuristics of Quadratic Number Fields -- Algebraic Number Theory -- An Algorithm for Computing p-Class Groups of Abelian Number Fields -- Computation of Locally Free Class Groups -- Numerical Results on Class Groups of Imaginary Quadratic Fields -- Cyclic Polynomials Arising from Kummer Theory of Norm Algebraic Tori -- The Totally Real Primitive Number Fields of Discriminant at Most 109 -- A Modular Method for Computing the Splitting Field of a Polynomial -- Analytic and Elementary Number Theory -- On the Density of Sums of Three Cubes -- The Mertens Conjecture Revisited -- Fast Bounds on the Distribution of Smooth Numbers -- Use of Extended Euclidean Algorithm in Solving a System of Linear Diophantine Equations with Bounded Variables -- The Pseudosquares Prime Sieve -- Doubly-Focused Enumeration of Pseudosquares and Pseudocubes -- Lattices -- Practical Lattice Basis Sampling Reduction -- LLL on the Average -- On the Randomness of Bits Generated by Sufficiently Smooth Functions -- Curves and Varieties over Fields of Characteristic Zero -- Computing a Lower Bound for the Canonical Height on Elliptic Curves over ? -- Points of Low Height on Elliptic Curves and Surfaces I: Elliptic Surfaces over with Small d -- Shimura Curves for Level-3 Subgroups of the (2,3,7) Triangle Group, and Some Other Examples -- The Asymptotics of Points of Bounded Height on Diagonal Cubic and Quartic Threefolds -- Testing Equivalence of Ternary Cubics -- Classification of Genus 3 Curves in Special Strata of the Moduli Space -- Heegner Point Computations Via Numerical p-Adic Integration -- Symmetric Powers of Elliptic Curve L-Functions -- Determined Sequences, Continued Fractions, and Hyperelliptic Curves -- Computing CM Points on Shimura Curves Arising from Cocompact Arithmetic Triangle Groups -- Arithmetic of Generalized Jacobians -- Hidden Pairings and Trapdoor DDH Groups -- Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10 -- Fast Bilinear Maps from the Tate-Lichtenbaum Pairing on Hyperelliptic Curves -- High Security Pairing-Based Cryptography Revisited -- Efficiently Computable Endomorphisms for Hyperelliptic Curves -- Construction of Rational Points on Elliptic Curves over Finite Fields -- 20 Years of ECM -- Discrete Logarithms -- An Index Calculus Algorithm for Plane Curves of Small Degree -- Signature Calculus and Discrete Logarithm Problems -- Spectral Analysis of Pollard Rho Collisions -- Hard Instances of the Constrained Discrete Logarithm Problem. |
Record Nr. | UNINA-9910484102103321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithmic Number Theory [[electronic resource] ] : 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings / / edited by Duncan Buell |
Edizione | [1st ed. 2004.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
Descrizione fisica | 1 online resource (XII, 456 p.) |
Disciplina | 512.7 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Number theory
Algorithms Computer science—Mathematics Data encryption (Computer science) Number Theory Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Cryptology Symbolic and Algebraic Manipulation |
ISBN | 3-540-24847-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Computing Zeta Functions via p-Adic Cohomology -- Using Primitive Subgroups to Do More with Fewer Bits -- Elliptic Curves of Large Rank and Small Conductor -- Contributed Papers -- Binary GCD Like Algorithms for Some Complex Quadratic Rings -- On the Complexity of Computing Units in a Number Field -- Implementing the Arithmetic of C 3,4 Curves -- Pseudocubes and Primality Testing -- Elliptic Curves with a Given Number of Points -- Rational Divisors in Rational Divisor Classes -- Conjectures about Discriminants of Hecke Algebras of Prime Level -- Montgomery Scalar Multiplication for Genus 2 Curves -- Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves -- Elliptic Curves x 3 + y 3 = k of High Rank -- Proving the Primality of Very Large Numbers with fastECPP -- A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii’s Algorithm -- Function Field Sieve in Characteristic Three -- A Comparison of CEILIDH and XTR -- Stable Models of Elliptic Curves, Ring Class Fields, and Complex Multiplication -- An Algorithm for Computing Isomorphisms of Algebraic Function Fields -- A Method to Solve Cyclotomic Norm Equations -- Imaginary Cyclic Quartic Fields with Large Minus Class Numbers -- Nonic 3-adic Fields -- Montgomery Addition for Genus Two Curves -- Numerical Evaluation at Negative Integers of the Dedekind Zeta Functions of Totally Real Cubic Number Fields -- Salem Numbers of Trace -2 and Traces of Totally Positive Algebraic Integers -- Low-Dimensional Lattice Basis Reduction Revisited -- Computing Order Statistics in the Farey Sequence -- The Discrete Logarithm in Logarithmic l-Class Groups and Its Applications in K-theory -- Point Counting on Genus 3 Non Hyperelliptic Curves -- Algorithmic Aspects of Cubic Function Fields -- A Binary Recursive Gcd Algorithm -- Lagrange Resolvents Constructed from Stark Units -- Cryptanalysis of a Divisor Class Group Based Public-Key Cryptosystem. |
Record Nr. | UNISA-996466235603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic Number Theory [[electronic resource] ] : 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings / / edited by Duncan Buell |
Edizione | [1st ed. 2004.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
Descrizione fisica | 1 online resource (XII, 456 p.) |
Disciplina | 512.7 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Number theory
Algorithms Computer science—Mathematics Data encryption (Computer science) Number Theory Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Cryptology Symbolic and Algebraic Manipulation |
ISBN | 3-540-24847-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Computing Zeta Functions via p-Adic Cohomology -- Using Primitive Subgroups to Do More with Fewer Bits -- Elliptic Curves of Large Rank and Small Conductor -- Contributed Papers -- Binary GCD Like Algorithms for Some Complex Quadratic Rings -- On the Complexity of Computing Units in a Number Field -- Implementing the Arithmetic of C 3,4 Curves -- Pseudocubes and Primality Testing -- Elliptic Curves with a Given Number of Points -- Rational Divisors in Rational Divisor Classes -- Conjectures about Discriminants of Hecke Algebras of Prime Level -- Montgomery Scalar Multiplication for Genus 2 Curves -- Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves -- Elliptic Curves x 3 + y 3 = k of High Rank -- Proving the Primality of Very Large Numbers with fastECPP -- A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii’s Algorithm -- Function Field Sieve in Characteristic Three -- A Comparison of CEILIDH and XTR -- Stable Models of Elliptic Curves, Ring Class Fields, and Complex Multiplication -- An Algorithm for Computing Isomorphisms of Algebraic Function Fields -- A Method to Solve Cyclotomic Norm Equations -- Imaginary Cyclic Quartic Fields with Large Minus Class Numbers -- Nonic 3-adic Fields -- Montgomery Addition for Genus Two Curves -- Numerical Evaluation at Negative Integers of the Dedekind Zeta Functions of Totally Real Cubic Number Fields -- Salem Numbers of Trace -2 and Traces of Totally Positive Algebraic Integers -- Low-Dimensional Lattice Basis Reduction Revisited -- Computing Order Statistics in the Farey Sequence -- The Discrete Logarithm in Logarithmic l-Class Groups and Its Applications in K-theory -- Point Counting on Genus 3 Non Hyperelliptic Curves -- Algorithmic Aspects of Cubic Function Fields -- A Binary Recursive Gcd Algorithm -- Lagrange Resolvents Constructed from Stark Units -- Cryptanalysis of a Divisor Class Group Based Public-Key Cryptosystem. |
Record Nr. | UNINA-9910144154003321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithmic Number Theory [[electronic resource] ] : 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings / / edited by Claus Fieker, David R. Kohel |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (X, 522 p.) |
Disciplina | 512.7 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Number theory
Algorithms Computer science—Mathematics Numerical analysis Data encryption (Computer science) Number Theory Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Numeric Computing Cryptology |
ISBN | 3-540-45455-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 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. |
Record Nr. | UNINA-9910143900903321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithmic Number Theory [[electronic resource] ] : 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings / / edited by Claus Fieker, David R. Kohel |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (X, 522 p.) |
Disciplina | 512.7 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Number theory
Algorithms Computer science—Mathematics Numerical analysis Data encryption (Computer science) Number Theory Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Numeric Computing Cryptology |
ISBN | 3-540-45455-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 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. |
Record Nr. | UNISA-996465398803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|