Item description for Number Theoretic Methods in Cryptography: Complexity Lower Bounds (Progress in Computer Science and Applied Logic (PCS)) by Igor Shparlinski...
The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 9.21" Width: 6.14" Height: 0.56" Weight: 1 lbs.
Release Date Mar 19, 1999
Publisher Birkhäuser Basel
ISBN 3764358882 ISBN13 9783764358884
Availability 132 units. Availability accurate as of Jan 22, 2017 07:42.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.
More About Igor Shparlinski
Igor Shparlinski has an academic affiliation as follows - Macquarie University, Sydney.