Skip to main content
PBS logo
 
 

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

Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness (Progress in Computer Science and Applied Logic (PCS))
Cryptographic Applications of Analytic Number Theory Complexity Lower Bounds and Pseudorandomness - Progress in Computer Science and Applied Logic PCS
Author: Igor Shparlinski
The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation. Key topics and features: various lower bounds on the complexity of some number theoretic and cryptographic problems, associated with classical schemes such as RSA, Diffie-Hellman, DSA...  more »
ISBN-13: 9783764366544
ISBN-10: 3764366540
Publication Date: 2/12/2003
Pages: 419
Edition: 1
Rating:
  ?
0 stars, based on 0 rating
Publisher: Birkhäuser Basel
Book Type: Hardcover
Members Wishing: 0
Reviews: Amazon | Write a Review



Back to the Top ↑
By using this Web site, you confirm that you have read, understood, and agreed to be bound by the Terms of Use. As an Amazon Associate we earn from qualifying purchases.
US Patent Number 7,877,315 | Copyright © 2004 - 2024 PaperBackSwap.com. All Rights Reserved.