Vor Ort
Merkzettel Warenkorb
  • Produktbild: Cryptographic Applications of Analytic Number Theory
  • Produktbild: Cryptographic Applications of Analytic Number Theory
Band 22 - 10%

Cryptographic Applications of Analytic Number Theory Complexity Lower Bounds and Pseudorandomness

Aus der Reihe Progress in Computer Science and Applied Logic
10% sparen

95,99 € UVP 106,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

03.10.2013

Abbildungen

IX, 414 p.

Verlag

Springer Basel

Seitenzahl

414

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

645 g

Sprache

Englisch

ISBN

978-3-0348-9415-9

Beschreibung

Rezension

From the reviews:

“Igor Shparlinski is a very prolific mathematician and computer scientist … . The book is written at a very high level, suitable for graduate students and researchers in computer science and mathematics. … book has a unique perspective, and is not really comparable to other books in the area. … book contains many deep results, and the mathematically-sophisticated reader can find much that is novel. … this is an impressive work that will be of significant interest to researchers in cryptography and algorithmic number theory.” (Jeffrey Shallit, SIGACT News, Vol. 41 (3), September, 2010)

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

03.10.2013

Abbildungen

IX, 414 p.

Verlag

Springer Basel

Seitenzahl

414

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

645 g

Sprache

Englisch

ISBN

978-3-0348-9415-9

Herstelleradresse

Springer Nature c/o IBS
Benzstrasse 21
48619 Heek
DE

Email: Tanja.Keller@springer.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: Cryptographic Applications of Analytic Number Theory
  • Produktbild: Cryptographic Applications of Analytic Number Theory
  • I Preliminaries.- 1 Basic Notation and Definitions.- 2 Polynomials and Recurrence Sequences.- 3 Exponential Sums.- 4 Distribution and Discrepancy.- 5 Arithmetic Functions.- 6 Lattices and the Hidden Number Problem.- 7 Complexity Theory.- II Approximation and Complexity of the Discrete Logarithm.- 8 Approximation of the Discrete Logarithm Modulop.- 9 Approximation of the Discrete Logarithm Modulop -1.- 10 Approximation of the Discrete Logarithm by Boolean Functions.- 11 Approximation of the Discrete Logarithm by Real Polynomials.- III Approximation and Complexity of the Diffie-Hellman Secret Key.- 12 Polynomial Approximation and Arithmetic Complexity of the.- Diffie-Hellman Secret Key.- 13 Boolean Complexity of the Diffie-Hellman Secret Key.- 14 Bit Security of the Diffie-Hellman Secret Key.- IV Other Cryptographic Constructions.- 15 Security Against the Cycling Attack on the RSA and Timed-release Crypto.- 16 The Insecurity of the Digital Signature Algorithm with Partially Known Nonces.- 17 Distribution of the ElGamal Signature.- 18 Bit Security of the RSA Encryption and the Shamir Message Passing Scheme.- 19 Bit Security of the XTR and LUC Secret Keys.- 20 Bit Security of NTRU.- 21 Distribution of the RSA and Exponential Pairs.- 22 Exponentiation and Inversion with Precomputation.- V Pseudorandom Number Generators.- 23 RSA and Blum-Blum-Shub Generators.- 24 Naor-Reingold Function.- 25 1/M Generator.- 26 Inversive, Polynomial and Quadratic Exponential Generators.- 27 Subset Sum Generators.- VI Other Applications.- 28 Square-Freeness Testing and Other Number-Theoretic Problems.- 29 Trade-off Between the Boolean and Arithmetic Depths of ModulopFunctions.- 30 Polynomial Approximation, Permanents and Noisy Exponentiation in Finite Fields.- 31 Special Polynomials and BooleanFunctions.- VII Concluding Remarks and Open Questions.