Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness by Igor Shparlinski

Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness

Progress in Computer Science and Applied Logic

Igor Shparlinski

414 pages • missing pub info (view editions)

nonfiction computer science mathematics
Powered by AI (Beta)
Loading...

Description

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

Read more

Community Reviews

Loading...

Content Warnings

Loading...