The Resource Algorithmic Number Theory : 8th International Symposium, ANTS-VIII Banff, Canada, May 17-22, 2008 Proceedings, edited by Alf J. van der Poorten, Andreas Stein, (electronic resource)

Algorithmic Number Theory : 8th International Symposium, ANTS-VIII Banff, Canada, May 17-22, 2008 Proceedings, edited by Alf J. van der Poorten, Andreas Stein, (electronic resource)

Label
Algorithmic Number Theory : 8th International Symposium, ANTS-VIII Banff, Canada, May 17-22, 2008 Proceedings
Title
Algorithmic Number Theory
Title remainder
8th International Symposium, ANTS-VIII Banff, Canada, May 17-22, 2008 Proceedings
Statement of responsibility
edited by Alf J. van der Poorten, Andreas Stein
Creator
Contributor
Editor
Editor
Subject
Language
  • eng
  • eng
Summary
This book constitutes the refereed proceedings of the 8th International Algorithmic Number Theory Symposium, ANTS 2008, held in Banff, Canada, in May 2008. The 28 revised full papers presented together with 2 invited papers were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections on elliptic curves cryptology and generalizations, arithmetic of elliptic curves, integer factorization, K3 surfaces, number fields, point counting, arithmetic of function fields, modular forms, cryptography, and number theory
Member of
Is Subseries of
http://bibfra.me/vocab/relation/corporateauthor
v4qiSkg3iv8
Dewey number
512
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
  • Nm2sk-OBeaA
  • 3sRSkA1nHIc
Image bit depth
0
Language note
English
LC call number
QA76.9.A43
Literary form
non fiction
http://bibfra.me/vocab/lite/organizationName
Algorithmic Number Theory Symposium
http://library.link/vocab/relatedWorkOrContributorName
  • Algorithmic Number Theory Symposium
  • van der Poorten, Alf J.
  • Stein, Andreas.
Series statement
Theoretical Computer Science and General Issues
Series volume
5011
http://library.link/vocab/subjectName
  • Computer software
  • Computational complexity
  • Data encryption (Computer science)
  • Algebra
  • Number theory
  • Algorithms
  • Algorithm Analysis and Problem Complexity
  • Discrete Mathematics in Computer Science
  • Cryptology
  • Symbolic and Algebraic Manipulation
  • Number Theory
  • Algorithms
Label
Algorithmic Number Theory : 8th International Symposium, ANTS-VIII Banff, Canada, May 17-22, 2008 Proceedings, edited by Alf J. van der Poorten, Andreas Stein, (electronic resource)
Instantiates
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Color
not applicable
Content category
text
Content type code
txt
Contents
Invited Papers -- Running Time Predictions for Factoring Algorithms -- A New Look at an Old Equation -- Elliptic Curves Cryptology and Generalizations -- Abelian Varieties with Prescribed Embedding Degree -- Almost Prime Orders of CM Elliptic Curves Modulo p -- Efficiently Computable Distortion Maps for Supersingular Curves -- On Prime-Order Elliptic Curves with Embedding Degrees k?=?3, 4, and 6 -- Arithmetic of Elliptic Curves -- Computing in Component Groups of Elliptic Curves -- Some Improvements to 4-Descent on an Elliptic Curve -- Computing a Lower Bound for the Canonical Height on Elliptic Curves over Totally Real Number Fields -- Faster Multiplication in GF(2)[x] -- Integer Factorization -- Predicting the Sieving Effort for the Number Field Sieve -- Improved Stage 2 to P ± 1 Factoring Algorithms -- K3 Surfaces -- Shimura Curve Computations Via K3 Surfaces of Néron–Severi Rank at Least 19 -- K3 Surfaces of Picard Rank One and Degree Two -- Number Fields -- Number Fields Ramified at One Prime -- An Explicit Construction of Initial Perfect Quadratic Forms over Some Families of Totally Real Number Fields -- Functorial Properties of Stark Units in Multiquadratic Extensions -- Enumeration of Totally Real Number Fields of Bounded Root Discriminant -- Point Counting -- Computing Hilbert Class Polynomials -- Computing Zeta Functions in Families of C a,b Curves Using Deformation -- Computing L-Series of Hyperelliptic Curves -- Point Counting on Singular Hypersurfaces -- Arithmetic of Function Fields -- Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors -- Tabulation of Cubic Function Fields with Imaginary and Unusual Hessian -- Modular Forms -- Computing Hilbert Modular Forms over Fields with Nontrivial Class Group -- Hecke Operators and Hilbert Modular Forms -- Cryptography -- A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm -- An Improved Multi-set Algorithm for the Dense Subset Sum Problem -- Number Theory -- On the Diophantine Equation x 2?+?2 ? 5 ? 13 ? ?=?y n -- Non-vanishing of Dirichlet L-functions at the Central Point
Dimensions
unknown
Edition
1st ed. 2008.
Extent
1 online resource (IX, 458 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540794561
Level of compression
uncompressed
Media category
computer
Media type code
c
Other control number
10.1007/978-3-540-79456-1
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000440617
  • (SSID)ssj0000316166
  • (PQKBManifestationID)11285822
  • (PQKBTitleCode)TC0000316166
  • (PQKBWorkID)10263138
  • (PQKB)10209631
  • (DE-He213)978-3-540-79456-1
  • (EXLCZ)991000000000440617
Label
Algorithmic Number Theory : 8th International Symposium, ANTS-VIII Banff, Canada, May 17-22, 2008 Proceedings, edited by Alf J. van der Poorten, Andreas Stein, (electronic resource)
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Color
not applicable
Content category
text
Content type code
txt
Contents
Invited Papers -- Running Time Predictions for Factoring Algorithms -- A New Look at an Old Equation -- Elliptic Curves Cryptology and Generalizations -- Abelian Varieties with Prescribed Embedding Degree -- Almost Prime Orders of CM Elliptic Curves Modulo p -- Efficiently Computable Distortion Maps for Supersingular Curves -- On Prime-Order Elliptic Curves with Embedding Degrees k?=?3, 4, and 6 -- Arithmetic of Elliptic Curves -- Computing in Component Groups of Elliptic Curves -- Some Improvements to 4-Descent on an Elliptic Curve -- Computing a Lower Bound for the Canonical Height on Elliptic Curves over Totally Real Number Fields -- Faster Multiplication in GF(2)[x] -- Integer Factorization -- Predicting the Sieving Effort for the Number Field Sieve -- Improved Stage 2 to P ± 1 Factoring Algorithms -- K3 Surfaces -- Shimura Curve Computations Via K3 Surfaces of Néron–Severi Rank at Least 19 -- K3 Surfaces of Picard Rank One and Degree Two -- Number Fields -- Number Fields Ramified at One Prime -- An Explicit Construction of Initial Perfect Quadratic Forms over Some Families of Totally Real Number Fields -- Functorial Properties of Stark Units in Multiquadratic Extensions -- Enumeration of Totally Real Number Fields of Bounded Root Discriminant -- Point Counting -- Computing Hilbert Class Polynomials -- Computing Zeta Functions in Families of C a,b Curves Using Deformation -- Computing L-Series of Hyperelliptic Curves -- Point Counting on Singular Hypersurfaces -- Arithmetic of Function Fields -- Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors -- Tabulation of Cubic Function Fields with Imaginary and Unusual Hessian -- Modular Forms -- Computing Hilbert Modular Forms over Fields with Nontrivial Class Group -- Hecke Operators and Hilbert Modular Forms -- Cryptography -- A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm -- An Improved Multi-set Algorithm for the Dense Subset Sum Problem -- Number Theory -- On the Diophantine Equation x 2?+?2 ? 5 ? 13 ? ?=?y n -- Non-vanishing of Dirichlet L-functions at the Central Point
Dimensions
unknown
Edition
1st ed. 2008.
Extent
1 online resource (IX, 458 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540794561
Level of compression
uncompressed
Media category
computer
Media type code
c
Other control number
10.1007/978-3-540-79456-1
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000440617
  • (SSID)ssj0000316166
  • (PQKBManifestationID)11285822
  • (PQKBTitleCode)TC0000316166
  • (PQKBWorkID)10263138
  • (PQKB)10209631
  • (DE-He213)978-3-540-79456-1
  • (EXLCZ)991000000000440617

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 ...