Number Theoretic Methods in Cryptography: Complexity Lower Bounds (Progress in Computer Science and Applied Logic (PCS)) |
 enlarge | Author: Igor Shparlinski
Publisher: Birkhaeuser Basel
Category: Book
List Price: $125.00
Buy New: $94.00
You Save: $31.00 (25%)
New (16) Used (8) from $93.98
Sales Rank: 5750809
Media: Hardcover
Edition: 1
Pages: 192
Number Of Items: 1
Shipping Weight (lbs): 1
Dimensions (in): 9.2 x 6.1 x 0.6
ISBN: 3764358882
Dewey Decimal Number: 003.54
EAN: 9783764358884
Publication Date: March 19, 1999
Availability: Usually ships in 1-2 business days
Shipping: Expedited shipping available
Shipping: International shipping available
|
|
|
Editorial Reviews:
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 propsals for further research. Series: Progress in Computer Science and Applied Logic, Vol. 17
|
