-
Handbook of
Applied Cryptography. CRC Press. Lam;
Shparlinski; Wang; Xing (2001). Lam, Kwok-Yan;
Shparlinski, Igor; Wang, Huaxiong; Xing,
Chaoping (eds.)....
-
designing a fast
algorithm to
construct primitive roots. von zur
Gathen &
Shparlinski 1998, pp. 15–24 "There is no
convenient formula for
computing [the least...
- function, used to
count rough numbers Smooth number p. 130,
Naccache and
Shparlinski 2009. Weisstein, Eric W. "Rough Number". MathWorld. Finch's definition...
-
verified by
looking at the
information on the page
provided by the browser.
Shparlinski, Igor E. (2013), "Additive
Combinatorics over
Finite Fields: New Results...
-
Originally a
privately circulated handwritten note. Naccache, David;
Shparlinski, Igor (17
October 2008). "Divisibility,
Smoothness and Cryptographic...
- "A note on
Agrawal conjecture" (PDF). Allender, Eric; Saks, Michael;
Shparlinski, Igor (2001). "A
Lower Bound for Primality".
Journal of
Computer and...
- 1090/S0894-0347-06-00549-2. S2CID 8529007. Bourgain, Jean; Konyagin,
Sergei V.;
Shparlinski, Igor E. (2015). "Character sums and
deterministic polynomial root finding...
-
Reports 85183. S2CID 120604553. Karpinski, Marek; van der Poorten, Alf;
Shparlinski, Igor (2000). "Zero
testing of p-adic and
modular polynomials". Theoretical...
-
Mathematics (3rd ed.),
Princeton University Press, p. 352. See, e.g.,
Shparlinski, Igor (2013),
Cryptographic Applications of
Analytic Number Theory: Complexity...
- ISSN 0065-1036. Zbl 0821.11038. Everest, Graham; van der Poorten, Alf;
Shparlinski, Igor; Ward,
Thomas (2003).
Recurrence sequences.
Mathematical Surveys...
