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

by IgorShparlinski (Author)

• New

  Hardcover
  2002

  $115.18

  The book introduces new techniques that imply rigorous lower bounds on the com- plexity of some number-theoretic and cryptographic problems. These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1.