The Resource Algorithmic Number Theory : 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings, edited by Claus Fieker, David R. Kohel, (electronic resource)

Algorithmic Number Theory : 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings, edited by Claus Fieker, David R. Kohel, (electronic resource)

Label
Algorithmic Number Theory : 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings
Title
Algorithmic Number Theory
Title remainder
5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings
Statement of responsibility
edited by Claus Fieker, David R. Kohel
Creator
Contributor
Editor
Editor
Subject
Language
  • eng
  • eng
Member of
http://bibfra.me/vocab/relation/corporateauthor
v4qiSkg3iv8
Dewey number
512/.7
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
  • NGSqbxlgNG8
  • Og5ZaKo8F2k
Image bit depth
0
Language note
English
LC call number
QA241-247.5
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingName
Algorithmic Number Theory Symposium
Nature of contents
dictionaries
http://bibfra.me/vocab/lite/organizationName
Algorithmic Number Theory Symposium
http://library.link/vocab/relatedWorkOrContributorName
  • Algorithmic Number Theory Symposium
  • Fieker, Claus.
  • Kohel, David R.
Series statement
Lecture Notes in Computer Science,
Series volume
2369
http://library.link/vocab/subjectName
  • Number theory
  • Computer software
  • Computational complexity
  • Electronic data processing
  • Data encryption (Computer science)
  • Algorithms
  • Number Theory
  • Algorithm Analysis and Problem Complexity
  • Discrete Mathematics in Computer Science
  • Numeric Computing
  • Cryptology
  • Algorithms
Label
Algorithmic Number Theory : 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings, edited by Claus Fieker, David R. Kohel, (electronic resource)
Instantiates
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references at the end of each chapters and index
Carrier category
online resource
Carrier category code
cr
Color
not applicable
Content category
text
Content type code
txt
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
Dimensions
unknown
Edition
1st ed. 2002.
Extent
1 online resource (X, 522 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540454557
Level of compression
uncompressed
Media category
computer
Media type code
c
Other control number
10.1007/3-540-45455-1
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000211773
  • (SSID)ssj0000321184
  • (PQKBManifestationID)11247373
  • (PQKBTitleCode)TC0000321184
  • (PQKBWorkID)10263231
  • (PQKB)10121310
  • (DE-He213)978-3-540-45455-7
  • (MiAaPQ)EBC3072339
  • (EXLCZ)991000000000211773
Label
Algorithmic Number Theory : 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings, edited by Claus Fieker, David R. Kohel, (electronic resource)
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references at the end of each chapters and index
Carrier category
online resource
Carrier category code
cr
Color
not applicable
Content category
text
Content type code
txt
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
Dimensions
unknown
Edition
1st ed. 2002.
Extent
1 online resource (X, 522 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540454557
Level of compression
uncompressed
Media category
computer
Media type code
c
Other control number
10.1007/3-540-45455-1
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000211773
  • (SSID)ssj0000321184
  • (PQKBManifestationID)11247373
  • (PQKBTitleCode)TC0000321184
  • (PQKBWorkID)10263231
  • (PQKB)10121310
  • (DE-He213)978-3-540-45455-7
  • (MiAaPQ)EBC3072339
  • (EXLCZ)991000000000211773

Library Locations

  • Architecture LibraryBorrow it
    Gould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US
    35.205706 -97.445050
  • Bizzell Memorial LibraryBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Boorstin CollectionBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Chinese Literature Translation ArchiveBorrow it
    401 W. Brooks St., RM 414, Norman, OK, 73019, US
    35.207487 -97.447906
  • Engineering LibraryBorrow it
    Felgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US
    35.205706 -97.445050
  • Fine Arts LibraryBorrow it
    Catlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US
    35.210371 -97.448244
  • Harry W. Bass Business History CollectionBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • History of Science CollectionsBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • John and Mary Nichols Rare Books and Special CollectionsBorrow it
    401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • Library Service CenterBorrow it
    2601 Technology Place, Norman, OK, 73019, US
    35.185561 -97.398361
  • Price College Digital LibraryBorrow it
    Adams Hall 102 307 West Brooks St., Norman, OK, 73019, US
    35.210371 -97.448244
  • Western History CollectionsBorrow it
    Monnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US
    35.209584 -97.445414
Processing Feedback ...