Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness: 22 (Progress in Computer Science and Applied Logic, 22) - Image 1

£72.77

Birkhauser Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness: 22 (Progress in Computer Science and Applied Logic, 22)

Name: Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness: 22 (Progress in Computer Science and Applied Logic, 22)
Brand: Birkhauser
Price: 72.77 GBP
Availability: InStock

Security

It has never been this cheap. We have no record of a lower price.

£73 today · cheaper than every other day in the last 3 months

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 86 days • 86 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 86 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £83 (61 days, 70.9%)

Price range: £73 - £83

Price levels: 2 different prices over 86 days

Description

The book introduces new techniques that imply rigorous lower bounds on the com plexity of some number-theoretic and cryptographic problems. It also establishes certain attractive pseudorandom properties of various cryptographic primitives. These methods and techniques are based on bounds of character sums and num bers of solutions of some polynomial equations over finite fields and residue rings. Other number theoretic techniques such as sieve methods and lattice reduction algorithms are used as well. The book also contains a number of open problems and proposals for further research. The emphasis is on obtaining unconditional rigorously proved statements. The bright side of this approach is that the results do not depend on any assumptions or conjectures. On the downside, the results are much weaker than those which are widely believed to be true. We obtain several lower bounds, exponential in terms of logp, on the degrees and orders of o polynomials; o algebraic functions; o Boolean functions; o linear recurrence sequences; coinciding with values of the discrete logarithm modulo a prime p at sufficiently many points (the number of points can be as small as pI/2+O:). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the rightmost bit of the discrete logarithm and defines whether the argument is a quadratic residue.

Product Specifications

Brand: Birkhauser
Format: hardcover
ASIN: 3764366540
Category: Books > Subjects > Computing & Internet > Networking & Security > Security
Domain: Amazon UK
Release Date: 11 December 2002
Listed Since: 17 December 2006

Barcode

No barcode data available

Birkhauser Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness: 22 (Progress in Computer Science and Applied Logic, 22)

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness: 22 (Progress in Computer Science and Applied Logic, 22)

Quantum Computational Number Theory

Computational Excursions in Analysis and Number Theory (CMS Books in Mathematics)

Coding, Cryptography and Combinatorics: 23 (Progress in Computer Science and Applied Logic, 23)

An Introduction to Number Theory: 232 (Graduate Texts in Mathematics, 232)

Applications of Finite Fields: 199 (The Springer International Series in Engineering and Computer Science, 199)

Cryptography and Computational Number Theory: Workshop in Singapore, 1999: v. 20 (Progress in Theoretical Computer Science)

Combinatorics and Finite Fields: Difference Sets, Polynomials, Pseudorandomness and Applications: 23 (Radon Series on Computational and Applied Mathematics, 23)

Diophantine Approximation on Linear Algebraic Groups: Transcendence Properties of the Exponential Function in Several Variables: 326 (Grundlehren der mathematischen Wissenschaften, 326)

Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)

Many Rational Points: Coding Theory and Algebraic Geometry: 564 (Mathematics and Its Applications, 564)

Effective Polynomial Computation: 241 (The Springer International Series in Engineering and Computer Science, 241)

Effective Polynomial Computation: 241 (The Springer International Series in Engineering and Computer Science, 241)

Elliptic Curves and Their Applications to Cryptography: An Introduction

Additive Number Theory: Festschrift In Honor of the Sixtieth Birthday of Melvyn B. Nathanson

Introduction to Finite Fields and their Applications

Modern Cryptography, Probabilistic Proofs and Pseudorandomness: 17 (Algorithms and Combinatorics, 17)

Open Problems in Mathematics and Computational Science

Complexity in Information Theory

Computation, Cryptography, and Network Security

Eisenstein Series and Applications: 258 (Progress in Mathematics, 258)

Steps into Analytic Number Theory: A Problem-Based Introduction (Problem Books in Mathematics)

Not Always Buried Deep: A Second Course in Elementary Number Theory (Monograph Books)

Analytic and Elementary Number Theory: A Tribute to Mathematical Legend Paul Erdos: 1 (Developments in Mathematics, 1)