000			03856nam a22005895i 4500
001			978-3-642-14518-6
003			DE-He213
005			20160624102145.0
007			cr nn 008mamaa
008			100708s2010 gw | s |||| 0|eng d
020			_a9783642145186 _9978-3-642-14518-6
024	7		_a10.1007/978-3-642-14518-6 _2doi
050		4	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
082	0	4	_a005.1 _223
245	1	0	_aAlgorithmic Number Theory _h[electronic resource] : _b9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010. Proceedings / _cedited by Guillaume Hanrot, François Morain, Emmanuel Thomé.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
300			_aXI, 397p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v6197
505	0		_aInvited 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	_aComputer science.
650		0	_aData encryption (Computer science).
650		0	_aComputer software.
650		0	_aComputational complexity.
650		0	_aAlgebra _xData processing.
650		0	_aAlgorithms.
650		0	_aNumber theory.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aData Encryption.
650	2	4	_aSymbolic and Algebraic Manipulation.
650	2	4	_aNumber Theory.
650	2	4	_aAlgorithms.
700	1		_aHanrot, Guillaume. _eeditor.
700	1		_aMorain, François. _eeditor.
700	1		_aThomé, Emmanuel. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642145179
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v6197
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-14518-6
942			_2EBK9169 _cEBK
999			_c38463 _d38463