FEEDBACK Smiley face
Normal view MARC view ISBD view

Algorithmic Number Theory [electronic resource] :5th International Symposium, ANTS-V Sydney, Australia, July 7–12, 2002 Proceedings /

Contributor(s): Fieker, Claus [editor.] | Kohel, David R [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 2369Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2002.Description: X, 522 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540454557.Subject(s): Mathematics | Data encryption (Computer science) | Algorithms | Numerical analysis | Computer science -- Mathematics | Number theory | Mathematics | Number Theory | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Numeric Computing | Data Encryption | AlgorithmsOnline resources: Click here to access online
Contents:
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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in