Igor E. Shparlinski

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 52

Top Venues

CoRR

Finite Fields Their Appl.

Math. Comput.

SIAM J. Discret. Math.

Publications

Bryce Kerr, Ali Mohammadi, Igor E. Shparlinski
Additive Energy of Polynomial Images. SIAM J. Discret. Math. 38 (3) (2024)
Moubariz Z. Garaev, Igor E. Shparlinski
On some congruences and exponential sums. Finite Fields Their Appl. 98 (2024)
Siddharth Iyer, Igor E. Shparlinski
Character sums over elements of extensions of finite fields with restricted coordinates. Finite Fields Their Appl. 93 (2024)
Igor E. Shparlinski
Fixed points of the subset sum pseudorandom number generators. Des. Codes Cryptogr. 91 (7) (2023)
Andrzej Dabrowski, Jacek Pomykala, Igor E. Shparlinski
On oracle factoring of integers. J. Complex. 76 (2023)
Bernard Mans, Min Sha, Igor E. Shparlinski, Daniel Sutantyo
Functional graphs of families of quadratic polynomials. Math. Comput. 92 (343) (2023)
Michael Kaminski, Igor E. Shparlinski, Michel Waldschmidt
On sets of linear forms of maximal complexity. Comput. Complex. 32 (1) (2023)
Igor E. Shparlinski
-tuples in finite fields. Finite Fields Their Appl. 90 (2023)
László Mérai, Igor E. Shparlinski
Distribution of recursive matrix pseudorandom number generator modulo prime powers. Math. Comput. 93 (347) (2023)
Igor E. Shparlinski
Multiplicative Properties of Hilbert Cubes. SIAM J. Discret. Math. 36 (2) (2022)
Christian Bagshaw, Igor E. Shparlinski
Energy bounds, bilinear forms and their applications in function fields. Finite Fields Their Appl. 82 (2022)
Michael Kaminski, Igor E. Shparlinski
Sets of Linear Forms Which Are Hard to Compute. MFCS (2021)
Michael Kaminski, Igor E. Shparlinski, Michel Waldschmidt
On sets of linear forms of maximal complexity. CoRR (2021)
Igor E. Shparlinski, Qiang Wang
Exponential Sums with Sparse Polynomials over Finite Fields. SIAM J. Discret. Math. 35 (2) (2021)
Marek Karpinski, Igor E. Shparlinski
Noisy polynomial interpolation modulo prime powers. J. Complex. 64 (2021)
Igor E. Shparlinski
Geometric progressions in vector sumsets over finite fields. Finite Fields Their Appl. 68 (2020)
Marek Karpinski, Igor E. Shparlinski
Noisy polynomial interpolation modulo prime powers. CoRR (2020)
László Mérai, Igor E. Shparlinski
. Math. Comput. 89 (322) (2020)
Simon Macourt, Giorgis Petridis, Ilya D. Shkredov, Igor E. Shparlinski
Bounds of Trilinear and Trinomial Exponential Sums. SIAM J. Discret. Math. 34 (4) (2020)
Domingo Gómez-Pérez, László Mérai, Igor E. Shparlinski
On the complexity of exact counting of dynamically irreducible polynomials. J. Symb. Comput. 99 (2020)
Simon Macourt, Igor E. Shparlinski
Double sums of Kloosterman sums in finite fields. Finite Fields Their Appl. 60 (2019)
Bernard Mans, Min Sha, Igor E. Shparlinski, Daniel Sutantyo
On Functional Graphs of Quadratic Polynomials. Exp. Math. 28 (3) (2019)
Andrzej Dabrowski, Jacek Pomykala, Igor E. Shparlinski
On oracle factoring of integers. CoRR (2019)
Igor E. Shparlinski, Arne Winterhof
Codes correcting restricted errors. Des. Codes Cryptogr. 87 (4) (2019)
Carl Pomerance, Igor E. Shparlinski
Connected Components of the Graph Generated by Power Maps in Prime Finite Fields. Integers (2018)
Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski
Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields. Algorithmica 80 (2) (2018)
Domingo Gómez-Pérez, Igor E. Shparlinski
Arithmetic Properties of Integers in Chains and Reflections of g-ary Expansions. Exp. Math. 27 (2) (2018)
Igor E. Shparlinski
On Constructing Primitive Roots in Finite Fields With Advice. IEEE Trans. Inf. Theory 64 (11) (2018)
Marek Karpinski, László Mérai, Igor E. Shparlinski
Identity testing and interpolation from high powers of polynomials of large degree over finite fields. J. Complex. 49 (2018)
Igor E. Shparlinski, Arne Winterhof
Codes correcting restricted errors. CoRR (2018)
Igor E. Shparlinski, Andreas J. Weingartner
An explicit polynomial analogue of Romanoff's theorem. Finite Fields Their Appl. 44 (2017)
Jason Bell, Igor E. Shparlinski
Power series approximations to Fekete polynomials. J. Approx. Theory 222 (2017)
Domingo Gómez-Pérez, László Mérai, Igor E. Shparlinski
On the Complexity of Exact Counting of Dynamically Irreducible Polynomials. CoRR (2017)
Marek Karpinski, Igor E. Shparlinski
Identity Testing from High Powers of Polynomials of Large Degree over Finite Fields. CoRR (2017)
Igor E. Shparlinski
Ratios of Small Integers in Multiplicative Subgroups of Residue Rings. Exp. Math. 25 (3) (2016)
Igor E. Shparlinski
Dominating Sets in Circulant Graphs. CoRR (2016)
Phong Q. Nguyen, Igor E. Shparlinski
Counting Co-Cyclic Lattices. SIAM J. Discret. Math. 30 (3) (2016)
Igor E. Shparlinski
On small gaps between the elements of multiplicative subgroups of finite fields. Des. Codes Cryptogr. 80 (1) (2016)
Randell Heyman, Igor E. Shparlinski
Counting irreducible binomials over finite fields. Finite Fields Their Appl. 38 (2016)
Sergei V. Konyagin, Florian Luca, Bernard Mans, Luke Mathieson, Min Sha, Igor E. Shparlinski
Functional graphs of polynomials over finite fields. J. Comb. Theory, Ser. B 116 (2016)
Igor E. Shparlinski
On the additive energy of the distance set in finite fields. Finite Fields Their Appl. 42 (2016)
William D. Banks, Igor E. Shparlinski
On Gauss sums and the evaluation of Stechkin's constant. Math. Comput. 85 (301) (2016)
Andrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski
Optimal Quantum Algorithm for Polynomial Interpolation. ICALP (2016)
Phong Q. Nguyen, Igor E. Shparlinski
Counting Co-Cyclic Lattices. CoRR (2015)
Andrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski
Optimal quantum algorithm for polynomial interpolation. CoRR (2015)
Joachim von zur Gathen, Igor E. Shparlinski
Circulant graphs and GCD and LCM of subsets. Inf. Process. Lett. 115 (2) (2015)
Igor E. Shparlinski
Close values of shifted modular inversions and the decisional modular inversion hidden number problem. Adv. Math. Commun. 9 (2) (2015)
Jean Bourgain, Sergei V. Konyagin, Igor E. Shparlinski
Character sums and deterministic polynomial root finding in finite fields. Math. Comput. 84 (296) (2015)
Igor E. Shparlinski
Cayley Graphs Generated by Small Degree Polynomials over Finite Fields. SIAM J. Discret. Math. 29 (1) (2015)
Igor E. Shparlinski, Andrew V. Sutherland
On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average. LMS J. Comput. Math. 18 (1) (2015)
Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski
Polynomial Interpolation and Identity Testing from High Powers over Finite Fields. CoRR (2015)
Oscar García Morchon, Ronald Rietman, Igor E. Shparlinski, Ludo Tolhuizen
Results on polynomial interpolation with mixed modular operations and unknown moduli. IACR Cryptol. ePrint Arch. 2015 (2015)
Igor E. Shparlinski, Andrew V. Sutherland
On the Distribution of Atkin and Elkies Primes. Found. Comput. Math. 14 (2) (2014)
Domingo Gómez-Pérez, Alina Ostafe, Igor E. Shparlinski
Algebraic entropy, automorphisms and sparsity of algebraic dynamical systems and pseudorandom number generators. Math. Comput. 83 (287) (2014)
Zhixiong Chen, Igor E. Shparlinski, Arne Winterhof
Covering Sets for Limited-Magnitude Errors. IEEE Trans. Inf. Theory 60 (9) (2014)
Igor E. Shparlinski
Evasive properties of sparse graphs and some linear equations in primes. Theor. Comput. Sci. 547 (2014)
Oscar García Morchon, Ronald Rietman, Igor E. Shparlinski, Ludo Tolhuizen
Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values. Exp. Math. 23 (3) (2014)
Oscar García Morchon, Ronald Rietman, Igor E. Shparlinski, Ludo Tolhuizen
Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values. CoRR (2014)
Bernard Mans, Igor E. Shparlinski
Random Walks, Bisections and Gossiping in Circulant Graphs. Algorithmica 70 (2) (2014)
Joachim von zur Gathen, Igor E. Shparlinski
Circulant graphs and GCD and LCM of Subsets. CoRR (2014)
Randell Heyman, Igor E. Shparlinski
On shifted Eisenstein polynomials. Period. Math. Hung. 69 (2) (2014)
Ian F. Blake, Florian Luca, Igor E. Shparlinski
VSH and multiplicative modular relations between small primes with polynomial exponents. Appl. Algebra Eng. Commun. Comput. 25 (3) (2014)
San Ling, Igor E. Shparlinski, Huaxiong Wang
On the Multidimensional Distribution of the Naor-Reingold Pseudo-Random Function. Math. Comput. 83 (289) (2014)
Igor E. Shparlinski
Products with variables from low-dimensional affine spaces and shifted power identity testing in finite fields. J. Symb. Comput. 64 (2014)
Jean Bourgain, Sergei Konyagin, Igor E. Shparlinski
Character Sums and Deterministic Polynomial Root Finding in Finite Fields. CoRR (2013)
Igor E. Shparlinski
On the Product of Small Elkies Primes CoRR (2013)
Igor E. Shparlinski
Correcting noisy exponentiation black-boxes modulo a prime. Inf. Process. Lett. 113 (12) (2013)
Igor E. Shparlinski, Arne Winterhof
Distribution of values of polynomial Fermat quotients. Finite Fields Their Appl. 19 (1) (2013)
Randell Heyman, Igor E. Shparlinski
On the number of Eisenstein polynomials of bounded height. Appl. Algebra Eng. Commun. Comput. 24 (2) (2013)
Igor E. Shparlinski
Additive Decompositions of Subgroups of Finite Fields. SIAM J. Discret. Math. 27 (4) (2013)
Sergei Konyagin, Florian Luca, Bernard Mans, Luke Mathieson, Igor E. Shparlinski
Functional Graphs of Polynomials over Finite Fields. CoRR (2013)
Igor E. Shparlinski
On products of primes and almost primes in arithmetic progressions. Period. Math. Hung. 67 (1) (2013)
Reza Rezaeian Farashahi, Pierre-Alain Fouque, Igor E. Shparlinski, Mehdi Tibouchi, José Felipe Voloch
Indifferentiable deterministic hashing to elliptic and hyperelliptic curves. Math. Comput. 82 (281) (2013)
Zhixiong Chen, Igor E. Shparlinski, Arne Winterhof
Covering sets for limited-magnitude errors. CoRR (2013)
Igor E. Shparlinski
Evasive Properties of Sparse Graphs and Some Linear Equations in Primes CoRR (2013)
Joachim von zur Gathen, Igor E. Shparlinski
Generating safe primes. J. Math. Cryptol. 7 (4) (2013)
Jonas Kaszian, Pieter Moree, Igor E. Shparlinski
Periodic Structure of the Exponential Pseudorandom Number Generator. CoRR (2013)
Jaime Gutierrez, Álvar Ibeas, Domingo Gómez-Pérez, Igor E. Shparlinski
Predicting masked linear pseudorandom number generators over finite fields. Des. Codes Cryptogr. 67 (3) (2013)
David Harvey, Igor E. Shparlinski
Statistics of Different Reduction Types of Fermat Curves. Exp. Math. 22 (3) (2013)
William D. Banks, Francesco Pappalardi, Igor E. Shparlinski
On Group Structures Realized by Elliptic Curves over Arbitrary Finite Fields. Exp. Math. 21 (1) (2012)
Reza Rezaeian Farashahi, Igor E. Shparlinski
Pseudorandom Bits From Points on Elliptic Curves. IEEE Trans. Inf. Theory 58 (2) (2012)
Jean Bourgain, Moubariz Z. Garaev, Sergei Konyagin, Igor E. Shparlinski
On the Hidden Shifted Power Problem. SIAM J. Comput. 41 (6) (2012)
Alina Ostafe, Igor E. Shparlinski
Multiplicative character sums and products of sparse integers in residue classes. Period. Math. Hung. 64 (2) (2012)
Bernard Mans, Igor E. Shparlinski
Random Walks and Bisections in Random Circulant Graphs. LATIN (2012)
Antal Balog, Kevin A. Broughan, Igor E. Shparlinski
Sum-Products Estimates with Several Sets and Applications. Integers 12 (2012)
Alina Ostafe, Igor E. Shparlinski
On the power generator and its multivariate analogue. J. Complex. 28 (2) (2012)
San Ling, Igor E. Shparlinski, Ron Steinfeld, Huaxiong Wang
On the modular inversion hidden number problem. J. Symb. Comput. 47 (4) (2012)
Jorge Jiménez Urroz, Florian Luca, Igor E. Shparlinski
On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves. Math. Comput. 81 (278) (2012)
Reza Rezaeian Farashahi, Igor E. Shparlinski
On Group Structures Realized by Elliptic Curves over a Fixed Finite Field. Exp. Math. 21 (1) (2012)
Alina Ostafe, Igor E. Shparlinski
Pseudorandomness and Dynamics of Fermat Quotients. SIAM J. Discret. Math. 25 (1) (2011)
Igor E. Shparlinski
On the average distribution of pseudorandom numbers generated by nonlinear permutations. Math. Comput. 80 (274) (2011)
Simon R. Blackburn, Alina Ostafe, Igor E. Shparlinski
On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves CoRR (2011)
Simon R. Blackburn, Alina Ostafe, Igor E. Shparlinski
On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves. IACR Cryptol. ePrint Arch. 2011 (2011)
Jean Bourgain, Sergei Konyagin, Igor E. Shparlinski
On the Hidden Shifted Power Problem CoRR (2011)
Joachim von zur Gathen, Maurice Mignotte, Igor E. Shparlinski
Approximate polynomial GCD: Small degree and small height perturbations. J. Symb. Comput. 45 (8) (2010)
Alina Ostafe, Elena Pelican, Igor E. Shparlinski
On pseudorandom numbers from multivariate polynomial systems. Finite Fields Their Appl. 16 (5) (2010)
Koray Karabina, Alfred Menezes, Carl Pomerance, Igor E. Shparlinski
On the asymptotic effectiveness of Weil descent attacks. J. Math. Cryptol. 4 (2) (2010)
Alina Ostafe, Igor E. Shparlinski
On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators. Math. Comput. 79 (269) (2010)
Lev Glebsky, Igor E. Shparlinski
Short cycles in repeated exponentiation modulo a prime. Des. Codes Cryptogr. 56 (1) (2010)
Kevin A. Broughan, Florian Luca, Igor E. Shparlinski
Some Divisibility Properties of Binomial Coefficients and the Converse of Wolstenholme's Theorem. Integers 10 (2010)

Igor E. Shparlinski.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Igor E. Shparlinski