0
Your cart

Your cart is empty

Books > Computing & IT > Applications of computing > Databases > Data security & data encryption

Not currently available

Cryptographic Applications of Analytic Number Theory - Complexity Lower Bounds and Pseudorandomness (Hardcover, 2003 ed.) Loot Price: R2,675
Discovery Miles 26 750
Cryptographic Applications of Analytic Number Theory - Complexity Lower Bounds and Pseudorandomness (Hardcover, 2003 ed.): Igor...

Cryptographic Applications of Analytic Number Theory - Complexity Lower Bounds and Pseudorandomness (Hardcover, 2003 ed.)

Igor Shparlinski

Series: Progress in Computer Science and Applied Logic, 22

 (sign in to rate)
Loot Price R2,675 Discovery Miles 26 750 | Repayment Terms: R251 pm x 12*

Bookmark and Share

Supplier out of stock. If you add this item to your wish list we will let you know when it becomes available.

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."

General

Imprint: Birkhauser Verlag AG
Country of origin: Switzerland
Series: Progress in Computer Science and Applied Logic, 22
Release date: December 2002
First published: 2003
Authors: Igor Shparlinski
Dimensions: 235 x 155 x 23mm (L x W x T)
Format: Hardcover
Pages: 414
Edition: 2003 ed.
ISBN-13: 978-3-7643-6654-4
Categories: Books > Science & Mathematics > Mathematics > Number theory > General
Books > Science & Mathematics > Mathematics > Applied mathematics > General
Books > Computing & IT > Applications of computing > Databases > Data security & data encryption
Promotions
LSN: 3-7643-6654-0
Barcode: 9783764366544

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Management Of Information Security
Michael Whitman, Herbert Mattord Paperback R1,471 R1,389 Discovery Miles 13 890
Data Empire - How Information Shaped…
Roopika Risam Paperback R480 R375 Discovery Miles 3 750
Digital Watermarking and Steganography…
Frank Y. Shih Hardcover R970 R907 Discovery Miles 9 070
Rethinking the Regulation of…
Syren Johnstone Hardcover R4,040 Discovery Miles 40 400
Ethereum - Understanding Blockchain…
Paul Paxton Hardcover R560 R523 Discovery Miles 5 230
Utilizing Blockchain Technologies in…
S. B. Goyal, Nijalingappa Pradeep, … Hardcover R6,288 Discovery Miles 62 880
Alice and Bob Learn Application Security
T Janca Paperback R1,045 R787 Discovery Miles 7 870
Cryptocurrencies - An Essential…
Herbert Jones Hardcover R676 R616 Discovery Miles 6 160
Cryptocurrency for Beginners - How to…
Zeph Pascall Hardcover R758 Discovery Miles 7 580
Computer & Internet Security - A…
Wenliang Du Hardcover R1,901 Discovery Miles 19 010
Limitations and Future Applications of…
Neeraj Kumar, Alka Agrawal, … Hardcover R6,288 Discovery Miles 62 880
Technical Articles about the Voynich…
National Security Agency Hardcover R689 Discovery Miles 6 890

See more

Partners