Read Anywhere and on Any Device!

Subscribe to Read | $0.00

Join today and start reading your favorite books for Free!

Read Anywhere and on Any Device!

  • Download on iOS
  • Download on Android
  • Download on iOS

Number Theoretic Methods in Cryptography: Complexity Lower Bounds (Progress in Computer Science and Applied Logic (PCS))

Number Theoretic Methods in Cryptography: Complexity Lower Bounds (Progress in Computer Science and Applied Logic (PCS))

Igor E. Shparlinski
0/5 ( ratings)
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.
Pages
192
Format
Hardcover
Publisher
Springer
Release
February 15, 1999
ISBN
3764358882
ISBN 13
9783764358884

Number Theoretic Methods in Cryptography: Complexity Lower Bounds (Progress in Computer Science and Applied Logic (PCS))

Igor E. Shparlinski
0/5 ( ratings)
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.
Pages
192
Format
Hardcover
Publisher
Springer
Release
February 15, 1999
ISBN
3764358882
ISBN 13
9783764358884

Rate this book!

Write a review?

loader