Igor E. Shparlinski

Igor E. Shparlinski

Auto-generated profile, based on publicly available information

Igor E. Shparlinski

School of Mathematics and Statistics, University of New South Wales, Sydney, Australia

Research Focus & Metrics

Academic Career Length

49Years (1978-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2002 in Journal of Cryptology
Verified
Journal Article
Closed access
PDF file
PNPhong Nguyen
Phong Nguyen
ISIgor Shparlinski
Igor Shparlinski

1 September 2003 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
PNPhong Q. Nguyen
Phong Q. Nguyen
ISIgor E. Shparlinski
Igor E. Shparlinski

1 June 2007 in International Journal of Quantum Information
Verified
Journal Article
Closed access
NSNitin Saxena
Nitin Saxena
SSSimone Severini
Simone Severini
ISIgor E. Shparlinski
Igor E. Shparlinski

1 January 2009 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
OAOmran Ahmadi
Omran Ahmadi
NANoga Alon
Noga Alon
IBIan F. Blake
Ian F. Blake
ISIgor E. Shparlinski
Igor E. Shparlinski

17 November 2012 in Japanese Journal of Mathematics
Verified
Journal Article
Closed access
PDF file
ISIgor E. Shparlinski
Igor E. Shparlinski

1 January 2011 in SIAM Journal on Discrete Mathematics
Verified
Journal Article
Closed access
AOAlina Ostafe
Alina Ostafe
ISIgor E. Shparlinski
Igor E. Shparlinski
We obtain some theoretical and experimental results concerning various properties (the number of fixed points, image distribution, cycle lengths) of the dynamical system naturally associated with Fermat quotients acting on the set $\{0,\dots,p-1\}$. In particular, we improve the lower bound of Vandiver [Bull. Amer. Math. Soc., 22 (1915), pp. 61–67] on the image size of Fermat quotients on the above set (from $p^{1/2}-1$ to $(1+o(1))p(\log p)^{-2}$). We also consider pseudorandom properties of Fermat quotients such as uniform distribution and linear complexity.