Shparlinski, I. (2003). Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness. Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-8037-4
Chicago Style (17th ed.) CitationShparlinski, Igor. Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness. Basel: Birkhäuser Basel, 2003. https://doi.org/10.1007/978-3-0348-8037-4.
MLA (9th ed.) CitationShparlinski, Igor. Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness. Birkhäuser Basel, 2003. https://doi.org/10.1007/978-3-0348-8037-4.
Warning: These citations may not always be 100% accurate.