Number Theoretic Methods in Cryptography: Complexity Lower Bounds by Igor Shparlinski

Number Theoretic Methods in Cryptography: Complexity Lower Bounds

Progress in Computer Science and Applied Logic

Igor Shparlinski

182 pages missing pub info (view editions)

nonfiction computer science health mathematics informative medium-paced
Powered by AI (Beta)
Loading...

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

Read more

Community Reviews

Loading...

Content Warnings

Loading...