Algorithmic Number Theory [electronic resource] : 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010. Proceedings / edited by Guillaume Hanrot, François Morain, Emmanuel Thomé.
Material type:
TextSeries: Lecture Notes in Computer Science ; 6197Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Description: XI, 397p. online resourceContent type: - text
- computer
- online resource
- 9783642145186
- Computer science
- Data encryption (Computer science)
- Computer software
- Computational complexity
- Algebra -- Data processing
- Algorithms
- Number theory
- Computer Science
- Algorithm Analysis and Problem Complexity
- Discrete Mathematics in Computer Science
- Data Encryption
- Symbolic and Algebraic Manipulation
- Number Theory
- Algorithms
- 005.1 23
- QA76.9.A43
E-BOOKS
| Home library | Call number | Materials specified | URL | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
| IMSc Library | Link to resource | Available | EBK9169 |
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.
There are no comments on this title.