Vor Ort
Merkzettel Warenkorb
  • Produktbild: Algorithmic Number Theory
  • Produktbild: Algorithmic Number Theory
Band 1423

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

Aus der Reihe Lecture Notes in Computer Science

99,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

05.06.1998

Abbildungen

X, 646 p.

Herausgeber

Joe P. Buhler

Verlag

Springer Berlin

Seitenzahl

646

Maße (L/B/H)

23,5/15,5/3,6 cm

Gewicht

978 g

Auflage

1998

Sprache

Englisch

ISBN

978-3-540-64657-0

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

05.06.1998

Abbildungen

X, 646 p.

Herausgeber

Joe P. Buhler

Verlag

Springer Berlin

Seitenzahl

646

Maße (L/B/H)

23,5/15,5/3,6 cm

Gewicht

978 g

Auflage

1998

Sprache

Englisch

ISBN

978-3-540-64657-0

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Algorithmic Number Theory
  • Produktbild: Algorithmic Number Theory
  • 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 relativequadratic 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.