Shparlinski, I. E. (2003). Cryptographic applications of analytic number theory: Complexity lower bounds and pseudorandomness. Basel ; Boston: Birkhäuser Verlag.
Chicago-stil citatShparlinski, Igor E. Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness. Basel ; Boston: Birkhäuser Verlag, 2003.
MLA-referensShparlinski, Igor E. Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness. Basel ; Boston: Birkhäuser Verlag, 2003.
Varning: dessa hänvisningar är inte alltid fullständigt riktiga.