Algorithmic Number Theory Third International Symposium, ANTS-III, Portland, Orgeon, USA, June 21-25, 1998, Proceedings /

This book constitutes the refereed proceedings of the Third International Symposium on Algorithmic Number Theory, ANTS-III, held in Portland, Oregon, USA, in June 1998. The volume presents 46 revised full papers together with two invited surveys. The papers are organized in chapters on gcd algorithm...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Buhler, Joe P. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
Έκδοση:1st ed. 1998.
Σειρά:Lecture Notes in Computer Science, 1423
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 05987nam a2200601 4500
001 978-3-540-69113-6
003 DE-He213
005 20191026192753.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 |a 9783540691136  |9 978-3-540-69113-6 
024 7 |a 10.1007/BFb0054849  |2 doi 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
050 4 |a QA76.63 
072 7 |a UY  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UY  |2 thema 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Algorithmic Number Theory  |h [electronic resource] :  |b Third International Symposium, ANTS-III, Portland, Orgeon, USA, June 21-25, 1998, Proceedings /  |c edited by Joe P. Buhler. 
250 |a 1st ed. 1998. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 1998. 
300 |a X, 646 p.  |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 1423 
505 0 |a Shimura curve computations -- The Decision Diffie-Hellman problem -- Parallel implementation of Schönhage's integer GCD algorithm -- The complete analysis of the binary Euclidean algorithm -- Cyclotomy primality proving - Recent developments -- Primality proving using elliptic curves: An update -- Bounding smooth integers (extended abstract) -- Factorization of the numbers of the form m 3 + c 2 m 2 + c 1 m + c 0 -- Modelling the yield of number field sieve polynomials -- A Montgomery-like square root for the Number Field Sieve -- Robert Bennion's "hopping sieve" -- Trading time for space in prime number sieves -- Do sums of 4 biquadrates have a positive density? -- New experimental results concerning the Goldbach conjecture -- Dense admissible sets -- An analytic approach to smooth polynomials over finite fields -- Generating a product of three primes with an unknown factorization -- On the performance of signature schemes based on elliptic curves -- NTRU: A ring-based public key cryptosystem -- Finding length-3 positive Cunningham chains and their cryptographic significance -- Reducing ideal arithmetic to linear algebra problems -- Evaluation of linear relations between vectors of a lattice in euclidean space -- An efficient parallel block-reduction algorithm -- Fast multiprecision evaluation of series of rational numbers -- A problem concerning a character sum -- Formal power series and their continued fraction expansion -- Imprimitive octic fields with small discriminants -- A table of totally complex number fields of small discriminants -- Generating arithmetically equivalent number fields with elliptic curves -- Computing the lead term of an abelian L-function -- Timing analysis of targeted hunter searches -- On successive minima of rings of algebraic integers -- Computation of relative quadratic class groups -- Generating class fields using Shimura reciprocity -- Irregularity of prime numbers over real quadratic fields -- Experimental results on class groups of real quadratic fields -- Computation of relative class numbers of imaginary cyclic fields of 2-power degrees -- Formal groups, elliptic curves, and some theorems of Couveignes -- A comparison of direct and indirect methods for computing Selmer groups of an elliptic curve -- An algorithm for approximate counting of points on algebraic sets over finite fields -- S-integral points on elliptic curves and Fermat's triple equations -- Speeding up Pollard's rho method for computing discrete logarithms -- A general method of constructing global function fields with many rational places -- Lattice basis reduction in function fields -- Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves -- Unit computation in purely cubic function fields of unit rank 1 -- An improved method of computing the regulator of a real quadratic function field -- The equivalence between elliptic curve and quadratic function field discrete logarithms in characteristic 2. 
520 |a This book constitutes the refereed proceedings of the Third International Symposium on Algorithmic Number Theory, ANTS-III, held in Portland, Oregon, USA, in June 1998. The volume presents 46 revised full papers together with two invited surveys. The papers are organized in chapters on gcd algorithms, primality, factoring, sieving, analytic number theory, cryptography, linear algebra and lattices, series and sums, algebraic number fields, class groups and fields, curves, and function fields. 
650 0 |a Computers. 
650 0 |a Number theory. 
650 0 |a Computer science-Mathematics. 
650 0 |a Algorithms. 
650 0 |a Data encryption (Computer science). 
650 1 4 |a Theory of Computation.  |0 http://scigraph.springernature.com/things/product-market-codes/I16005 
650 2 4 |a Number Theory.  |0 http://scigraph.springernature.com/things/product-market-codes/M25001 
650 2 4 |a Symbolic and Algebraic Manipulation.  |0 http://scigraph.springernature.com/things/product-market-codes/I17052 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
650 2 4 |a Cryptology.  |0 http://scigraph.springernature.com/things/product-market-codes/I28020 
650 2 4 |a Algorithms.  |0 http://scigraph.springernature.com/things/product-market-codes/M14018 
700 1 |a Buhler, Joe P.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662203286 
776 0 8 |i Printed edition:  |z 9783540646570 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 1423 
856 4 0 |u https://doi.org/10.1007/BFb0054849  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)