Algorithmic Number Theory 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Hanrot, Guillaume (Επιμελητής έκδοσης), Morain, François (Επιμελητής έκδοσης), Thomé, Emmanuel (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Σειρά:Lecture Notes in Computer Science, 6197
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03739nam a22005535i 4500
001 978-3-642-14518-6
003 DE-He213
005 20151204165310.0
007 cr nn 008mamaa
008 100708s2010 gw | s |||| 0|eng d
020 |a 9783642145186  |9 978-3-642-14518-6 
024 7 |a 10.1007/978-3-642-14518-6  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
082 0 4 |a 005.1  |2 23 
245 1 0 |a Algorithmic Number Theory  |h [electronic resource] :  |b 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010. Proceedings /  |c edited by Guillaume Hanrot, François Morain, Emmanuel Thomé. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 |a XI, 397 p. 15 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6197 
505 0 |a 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. 
650 0 |a Computer science. 
650 0 |a Data encryption (Computer science). 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Number theory. 
650 1 4 |a Computer Science. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Data Encryption. 
650 2 4 |a Symbolic and Algebraic Manipulation. 
650 2 4 |a Number Theory. 
650 2 4 |a Algorithms. 
700 1 |a Hanrot, Guillaume.  |e editor. 
700 1 |a Morain, François.  |e editor. 
700 1 |a Thomé, Emmanuel.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642145179 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6197 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-14518-6  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)