Number Theoretic Methods in Cryptography: Complexity Lower...

Buy Number Theoretic Methods in Cryptography: Complexity Lower... here, one of many Cryptography books offered for sale at discount prices here at Rbookshop.com. We greatly appreciate your patronage at Rbookshop and look forward to offering you great products and prices now and in the future.

You Are Here: Home > Computer Books > Cryptography > Item 531

	Number Theoretic Methods in Cryptography: Complexity Lower...
	by Igor Shparlinski Sales Rank: 5088320	$125.00 At Amazon on 9-26-2008.

*Features* Cover Type: Hard Cover with 192 pages Published by: Birkh�user Basel Edition: 1st Edition March 19, 1999 Written in: English ISBN 10 Number: 3764358882 ISBN 13 Number: 978-3764358884 Book Dimensions: 9.2 x 6.1 x 0.6 inches Weighs: 1 pounds *Product Review* "This volume gives a thorough treatment of the complexity of the discrete logarithm problem in a prime field, as well as related problems. The final chapter on further directions gives an interesting selection of problems." --Zentralblatt Math *Product Description* 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. Back To Top
Number Theoretic Methods in Cryptography: Complexity Lower... ~~List Price: $125.00~~ Available from Amazon Price: $125.00 Updated on 9-26-2008.

NOTICE: All prices, availability, and specifications
are subject to verification by their respective retailers.

We offer Number Theoretic Methods in Cryptography: Complexity Lower... and other related Cryptography Books here at Rbookshop.com. To view more books about Cryptography please use the previous and next buttons near the top of this page.