Shparlinski, I. E. (2003). Cryptographic applications of analytic number theory: Complexity lower bounds and pseudorandomness. Basel ; Boston: Birkhäuser Verlag.
Dyfyniad Arddull ChicagoShparlinski, Igor E. Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness. Basel ; Boston: Birkhäuser Verlag, 2003.
Dyfyniad MLAShparlinski, Igor E. Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness. Basel ; Boston: Birkhäuser Verlag, 2003.
Rhybudd: Mae'n bosib nad yw'r dyfyniadau hyn bob amser yn 100% cywir.