Igor E. Shparlinski

301 papers A* 8A 3B 16C 6Misc 10Journal 225Unranked 22
YearRankTypeTitle / Venue / Authors
2026 J jnl
Mean value theorems for short rational exponential sums.
Finite Fields Their Appl.
Doowon Koh, Igor E. Shparlinski
2025 J jnl
Sums of multidimensional Kloosterman sums.
Period. Math. Hung.
Igor E. Shparlinski
2024 J jnl
Additive Energy of Polynomial Images.
SIAM J. Discret. Math.
Bryce Kerr, Ali Mohammadi, Igor E. Shparlinski
2024 J jnl
Character sums over elements of extensions of finite fields with restricted coordinates.
Finite Fields Their Appl.
Siddharth Iyer, Igor E. Shparlinski
2024 J jnl
On some congruences and exponential sums.
Finite Fields Their Appl.
Moubariz Z. Garaev, Igor E. Shparlinski
2023 J jnl
Bohr sets generated by polynomials and Coppersmith's method in many variables.
CoRR
Riley Baird, Bryce Kerr, Igor E. Shparlinski
2023 J jnl
Distribution of recursive matrix pseudorandom number generator modulo prime powers.
Math. Comput.
László Mérai, Igor E. Shparlinski
2023 J jnl
Fixed points of the subset sum pseudorandom number generators.
Des. Codes Cryptogr.
Igor E. Shparlinski
2023 J jnl
Functional graphs of families of quadratic polynomials.
Math. Comput.
Bernard Mans, Min Sha, Igor E. Shparlinski, Daniel Sutantyo
2023 J jnl
On oracle factoring of integers.
J. Complex.
Andrzej Dabrowski, Jacek Pomykala, Igor E. Shparlinski
2023 J jnl
On sets of linear forms of maximal complexity.
Comput. Complex.
Michael Kaminski, Igor E. Shparlinski, Michel Waldschmidt
2023 J jnl
On the number of Diophantine
Finite Fields Their Appl.
Igor E. Shparlinski
2022 J jnl
Energy bounds, bilinear forms and their applications in function fields.
Finite Fields Their Appl.
Christian Bagshaw, Igor E. Shparlinski
2022 J jnl
Multiplicative Properties of Hilbert Cubes.
SIAM J. Discret. Math.
Igor E. Shparlinski
2021 J jnl
Exponential Sums with Sparse Polynomials over Finite Fields.
SIAM J. Discret. Math.
Igor E. Shparlinski, Qiang Wang
2021 J jnl
Noisy polynomial interpolation modulo prime powers.
J. Complex.
Marek Karpinski, Igor E. Shparlinski
2021 J jnl
On sets of linear forms of maximal complexity.
CoRR
Michael Kaminski, Igor E. Shparlinski, Michel Waldschmidt
2021 B conf
Sets of Linear Forms Which Are Hard to Compute.
MFCS
Michael Kaminski, Igor E. Shparlinski
2020 — book
75 Years of Mathematics of Computation
75 Years of Mathematics of Computation
Susanne C. Brenner, Igor E. Shparlinski, Chi-Wang Shu, Daniel B. Szyld
2020 J jnl
Bounds of Trilinear and Trinomial Exponential Sums.
SIAM J. Discret. Math.
Simon Macourt, Giorgis Petridis, Ilya D. Shkredov, Igor E. Shparlinski
2020 J jnl
Distribution of short subsequences of inversive congruential pseudorandom numbers modulo 2
Math. Comput.
László Mérai, Igor E. Shparlinski
2020 J jnl
Geometric progressions in vector sumsets over finite fields.
Finite Fields Their Appl.
Igor E. Shparlinski
2020 J jnl
Noisy polynomial interpolation modulo prime powers.
CoRR
Marek Karpinski, Igor E. Shparlinski
2020 J jnl
On the complexity of exact counting of dynamically irreducible polynomials.
J. Symb. Comput.
Domingo Gómez-Pérez, László Mérai, Igor E. Shparlinski
2019 J jnl
Codes correcting restricted errors.
Des. Codes Cryptogr.
Igor E. Shparlinski, Arne Winterhof
2019 J jnl
Double sums of Kloosterman sums in finite fields.
Finite Fields Their Appl.
Simon Macourt, Igor E. Shparlinski
2019 J jnl
On Functional Graphs of Quadratic Polynomials.
Exp. Math.
Bernard Mans, Min Sha, Igor E. Shparlinski, Daniel Sutantyo
2019 J jnl
On oracle factoring of integers.
CoRR
Andrzej Dabrowski, Jacek Pomykala, Igor E. Shparlinski
2018 J jnl
Arithmetic Properties of Integers in Chains and Reflections of g-ary Expansions.
Exp. Math.
Domingo Gómez-Pérez, Igor E. Shparlinski
2018 J jnl
Codes correcting restricted errors.
CoRR
Igor E. Shparlinski, Arne Winterhof
2018 J jnl
Connected Components of the Graph Generated by Power Maps in Prime Finite Fields.
Integers
Carl Pomerance, Igor E. Shparlinski
2018 J jnl
Identity testing and interpolation from high powers of polynomials of large degree over finite fields.
J. Complex.
Marek Karpinski, László Mérai, Igor E. Shparlinski
2018 J jnl
On Constructing Primitive Roots in Finite Fields With Advice.
IEEE Trans. Inf. Theory
Igor E. Shparlinski
2018 J jnl
Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields.
Algorithmica
Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski
2017 J jnl
An explicit polynomial analogue of Romanoff's theorem.
Finite Fields Their Appl.
Igor E. Shparlinski, Andreas J. Weingartner
2017 J jnl
Identity Testing from High Powers of Polynomials of Large Degree over Finite Fields.
CoRR
Marek Karpinski, Igor E. Shparlinski
2017 J jnl
On the Complexity of Exact Counting of Dynamically Irreducible Polynomials.
CoRR
Domingo Gómez-Pérez, László Mérai, Igor E. Shparlinski
2017 J jnl
Power series approximations to Fekete polynomials.
J. Approx. Theory
Jason P. Bell, Igor E. Shparlinski
2016 J jnl
Counting Co-Cyclic Lattices.
SIAM J. Discret. Math.
Phong Q. Nguyen, Igor E. Shparlinski
2016 J jnl
Counting irreducible binomials over finite fields.
Finite Fields Their Appl.
Randell Heyman, Igor E. Shparlinski
2016 J jnl
Dominating Sets in Circulant Graphs.
CoRR
Igor E. Shparlinski
2016 J jnl
Functional graphs of polynomials over finite fields.
J. Comb. Theory B
Sergei V. Konyagin, Florian Luca, Bernard Mans, Luke Mathieson, Min Sha, Igor E. Shparlinski
2016 J jnl
On Gauss sums and the evaluation of Stechkin's constant.
Math. Comput.
William D. Banks, Igor E. Shparlinski
2016 J jnl
On small gaps between the elements of multiplicative subgroups of finite fields.
Des. Codes Cryptogr.
Igor E. Shparlinski
2016 J jnl
On the additive energy of the distance set in finite fields.
Finite Fields Their Appl.
Igor E. Shparlinski
2016 A* conf
Optimal Quantum Algorithm for Polynomial Interpolation.
ICALP
Andrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski
2016 J jnl
Ratios of Small Integers in Multiplicative Subgroups of Residue Rings.
Exp. Math.
Igor E. Shparlinski
2015 J jnl
Cayley Graphs Generated by Small Degree Polynomials over Finite Fields.
SIAM J. Discret. Math.
Igor E. Shparlinski
2015 J jnl
Character sums and deterministic polynomial root finding in finite fields.
Math. Comput.
Jean Bourgain, Sergei V. Konyagin, Igor E. Shparlinski
2015 J jnl
Circulant graphs and GCD and LCM of subsets.
Inf. Process. Lett.
Joachim von zur Gathen, Igor E. Shparlinski
2015 J jnl
Close values of shifted modular inversions and the decisional modular inversion hidden number problem.
Adv. Math. Commun.
Igor E. Shparlinski
2015 J jnl
Counting Co-Cyclic Lattices.
CoRR
Phong Q. Nguyen, Igor E. Shparlinski
2015 J jnl
On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average.
LMS J. Comput. Math.
Igor E. Shparlinski, Andrew V. Sutherland
2015 J jnl
Optimal quantum algorithm for polynomial interpolation.
CoRR
Andrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski
2015 J jnl
Polynomial Interpolation and Identity Testing from High Powers over Finite Fields.
CoRR
Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski
2015 J jnl
Results on polynomial interpolation with mixed modular operations and unknown moduli.
IACR Cryptol. ePrint Arch.
Oscar García Morchon, Ronald Rietman, Igor E. Shparlinski, Ludo Tolhuizen
2014 J jnl
Algebraic entropy, automorphisms and sparsity of algebraic dynamical systems and pseudorandom number generators.
Math. Comput.
Domingo Gómez-Pérez, Alina Ostafe, Igor E. Shparlinski
2014 J jnl
Circulant graphs and GCD and LCM of Subsets.
CoRR
Joachim von zur Gathen, Igor E. Shparlinski
2014 J jnl
Covering Sets for Limited-Magnitude Errors.
IEEE Trans. Inf. Theory
Zhixiong Chen, Igor E. Shparlinski, Arne Winterhof
2014 J jnl
Evasive properties of sparse graphs and some linear equations in primes.
Theor. Comput. Sci.
Igor E. Shparlinski
2014 J jnl
Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values.
CoRR
Oscar García Morchon, Ronald Rietman, Igor E. Shparlinski, Ludo Tolhuizen
2014 J jnl
Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values.
Exp. Math.
Oscar García Morchon, Ronald Rietman, Igor E. Shparlinski, Ludo Tolhuizen
2014 J jnl
On shifted Eisenstein polynomials.
Period. Math. Hung.
Randell Heyman, Igor E. Shparlinski
2014 J jnl
On the Distribution of Atkin and Elkies Primes.
Found. Comput. Math.
Igor E. Shparlinski, Andrew V. Sutherland
2014 J jnl
On the Multidimensional Distribution of the Naor-Reingold Pseudo-Random Function.
Math. Comput.
San Ling, Igor E. Shparlinski, Huaxiong Wang
2014 — ch.
Periodic structure of the exponential pseudorandom number generator.
Applied Algebra and Number Theory
Jonas Kaszian, Pieter Moree, Igor E. Shparlinski
2014 J jnl
Products with variables from low-dimensional affine spaces and shifted power identity testing in finite fields.
J. Symb. Comput.
Igor E. Shparlinski
2014 J jnl
Random Walks, Bisections and Gossiping in Circulant Graphs.
Algorithmica
Bernard Mans, Igor E. Shparlinski
2014 J jnl
VSH and multiplicative modular relations between small primes with polynomial exponents.
Appl. Algebra Eng. Commun. Comput.
Ian F. Blake, Florian Luca, Igor E. Shparlinski
2013 — ch.
Additive Combinatorics over Finite Fields: New Results and Applications.
Finite Fields and Their Applications
Igor E. Shparlinski
2013 J jnl
Additive Decompositions of Subgroups of Finite Fields.
SIAM J. Discret. Math.
Igor E. Shparlinski
2013 — ch.
Algebraic dynamical systems over finite fields.
Handbook of Finite Fields
Igor E. Shparlinski
2013 J jnl
Character Sums and Deterministic Polynomial Root Finding in Finite Fields.
CoRR
Jean Bourgain, Sergei Konyagin, Igor E. Shparlinski
2013 J jnl
Correcting noisy exponentiation black-boxes modulo a prime.
Inf. Process. Lett.
Igor E. Shparlinski
2013 J jnl
Covering sets for limited-magnitude errors.
CoRR
Zhixiong Chen, Igor E. Shparlinski, Arne Winterhof
2013 J jnl
Distribution of values of polynomial Fermat quotients.
Finite Fields Their Appl.
Igor E. Shparlinski, Arne Winterhof
2013 J jnl
Evasive Properties of Sparse Graphs and Some Linear Equations in Primes
CoRR
Igor E. Shparlinski
2013 J jnl
Functional Graphs of Polynomials over Finite Fields.
CoRR
Sergei Konyagin, Florian Luca, Bernard Mans, Luke Mathieson, Igor E. Shparlinski
2013 J jnl
Generating safe primes.
J. Math. Cryptol.
Joachim von zur Gathen, Igor E. Shparlinski
2013 J jnl
Indifferentiable deterministic hashing to elliptic and hyperelliptic curves.
Math. Comput.
Reza Rezaeian Farashahi, Pierre-Alain Fouque, Igor E. Shparlinski, Mehdi Tibouchi, José Felipe Voloch
2013 — book
Number Theory and Related Fields, In Memory of Alf van der Poorten
Jonathan M. Borwein, Igor E. Shparlinski, Wadim Zudilin
2013 J jnl
On products of primes and almost primes in arithmetic progressions.
Period. Math. Hung.
Igor E. Shparlinski
2013 J jnl
On the Product of Small Elkies Primes
CoRR
Igor E. Shparlinski
2013 J jnl
On the number of Eisenstein polynomials of bounded height.
Appl. Algebra Eng. Commun. Comput.
Randell Heyman, Igor E. Shparlinski
2013 J jnl
Periodic Structure of the Exponential Pseudorandom Number Generator.
CoRR
Jonas Kaszian, Pieter Moree, Igor E. Shparlinski
2013 J jnl
Predicting masked linear pseudorandom number generators over finite fields.
Des. Codes Cryptogr.
Jaime Gutierrez, Álvar Ibeas, Domingo Gómez-Pérez, Igor E. Shparlinski
2013 J jnl
Statistics of Different Reduction Types of Fermat Curves.
Exp. Math.
David Harvey, Igor E. Shparlinski
2012 J jnl
Multiplicative character sums and products of sparse integers in residue classes.
Period. Math. Hung.
Alina Ostafe, Igor E. Shparlinski
2012 J jnl
On Group Structures Realized by Elliptic Curves over Arbitrary Finite Fields.
Exp. Math.
William D. Banks, Francesco Pappalardi, Igor E. Shparlinski
2012 J jnl
On Group Structures Realized by Elliptic Curves over a Fixed Finite Field.
Exp. Math.
Reza Rezaeian Farashahi, Igor E. Shparlinski
2012 J jnl
On the Hidden Shifted Power Problem.
SIAM J. Comput.
Jean Bourgain, Moubariz Z. Garaev, Sergei Konyagin, Igor E. Shparlinski
2012 J jnl
On the modular inversion hidden number problem.
J. Symb. Comput.
San Ling, Igor E. Shparlinski, Ron Steinfeld, Huaxiong Wang
2012 J jnl
On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves.
Math. Comput.
Jorge Jiménez Urroz, Florian Luca, Igor E. Shparlinski
2012 J jnl
On the power generator and its multivariate analogue.
J. Complex.
Alina Ostafe, Igor E. Shparlinski
2012 J jnl
Pseudorandom Bits From Points on Elliptic Curves.
IEEE Trans. Inf. Theory
Reza Rezaeian Farashahi, Igor E. Shparlinski
2012 B conf
Random Walks and Bisections in Random Circulant Graphs.
LATIN
Bernard Mans, Igor E. Shparlinski
2012 J jnl
Sum-Products Estimates with Several Sets and Applications.
Integers
Antal Balog, Kevin A. Broughan, Igor E. Shparlinski
2011 — ch.
Computational Diffie-Hellman Problem.
Encyclopedia of Cryptography and Security (2nd Ed.)
Igor E. Shparlinski
2011 J jnl
On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves
CoRR
Simon R. Blackburn, Alina Ostafe, Igor E. Shparlinski
2011 J jnl
On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves.
IACR Cryptol. ePrint Arch.
Simon R. Blackburn, Alina Ostafe, Igor E. Shparlinski
2011 J jnl
On the Hidden Shifted Power Problem
CoRR
Jean Bourgain, Sergei Konyagin, Igor E. Shparlinski
2011 J jnl
On the average distribution of pseudorandom numbers generated by nonlinear permutations.
Math. Comput.
Igor E. Shparlinski
2011 J jnl
Pseudorandomness and Dynamics of Fermat Quotients.
SIAM J. Discret. Math.
Alina Ostafe, Igor E. Shparlinski
2010 J jnl
Approximate polynomial GCD: Small degree and small height perturbations.
J. Symb. Comput.
Joachim von zur Gathen, Maurice Mignotte, Igor E. Shparlinski
2010 J jnl
Discrete Logarithms, Diffie-Hellman, and Reductions.
IACR Cryptol. ePrint Arch.
Neal Koblitz, Alfred Menezes, Igor E. Shparlinski
2010 J jnl
Indifferentiable Deterministic Hashing to Elliptic and Hyperelliptic Curves.
IACR Cryptol. ePrint Arch.
Reza Rezaeian Farashahi, Pierre-Alain Fouque, Igor E. Shparlinski, Mehdi Tibouchi, José Felipe Voloch
2010 J jnl
On pseudorandom numbers from multivariate polynomial systems.
Finite Fields Their Appl.
Alina Ostafe, Elena Pelican, Igor E. Shparlinski
2010 J jnl
On the Distribution of Orbits of PGL
SIAM J. Discret. Math.
Igor E. Shparlinski
2010 J jnl
On the asymptotic effectiveness of Weil descent attacks.
J. Math. Cryptol.
Koray Karabina, Alfred Menezes, Carl Pomerance, Igor E. Shparlinski
2010 J jnl
On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators.
Math. Comput.
Alina Ostafe, Igor E. Shparlinski
2010 J jnl
On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences.
Adv. Math. Commun.
Alina Ostafe, Igor E. Shparlinski, Arne Winterhof
2010 J jnl
On the number of distinct elliptic curves in some families.
Des. Codes Cryptogr.
Reza Rezaeian Farashahi, Igor E. Shparlinski
2010 J jnl
Pseudorandom Bits From Points on Elliptic Curves
CoRR
Reza Rezaeian Farashahi, Igor E. Shparlinski
2010 J jnl
Pseudorandom numbers and hash functions from iterations of multivariate polynomials.
Cryptogr. Commun.
Alina Ostafe, Igor E. Shparlinski
2010 J jnl
Short cycles in repeated exponentiation modulo a prime.
Des. Codes Cryptogr.
Lev Glebsky, Igor E. Shparlinski
2010 J jnl
Some Divisibility Properties of Binomial Coefficients and the Converse of Wolstenholme's Theorem.
Integers
Kevin A. Broughan, Florian Luca, Igor E. Shparlinski
2009 — ch.
Divisibility, Smoothness and Cryptographic Applications.
Algebraic Aspects of Digital Communications
David Naccache, Igor E. Shparlinski
2009 — conf
Elliptic Twin Prime Conjecture.
IWCC
John B. Friedlander, Igor E. Shparlinski
2009 J jnl
On character sums with distances on the upper half plane over a finite field.
Finite Fields Their Appl.
Nicholas M. Katz, Igor E. Shparlinski, Maosheng Xiong
2009 J jnl
On hashing into elliptic curves.
J. Math. Cryptol.
Reza Rezaeian Farashahi, Igor E. Shparlinski, José Felipe Voloch
2009 J jnl
On the density of some special primes.
J. Math. Cryptol.
John B. Friedlander, Igor E. Shparlinski
2009 J jnl
On the embedding degree of reductions of an elliptic curve.
Inf. Process. Lett.
Alina Carmen Cojocaru, Igor E. Shparlinski
2009 J jnl
On the values of Kloosterman sums.
IEEE Trans. Inf. Theory
Igor E. Shparlinski
2009 J jnl
Subset sum pseudorandom numbers: fast generation and distribution.
J. Math. Cryptol.
Joachim von zur Gathen, Igor E. Shparlinski
2008 B conf
Approximate Polynomial gcd: Small Degree and Small Height Perturbations.
LATIN
Joachim von zur Gathen, Igor E. Shparlinski
2008 J jnl
Bilinear character sums over elliptic curves.
Finite Fields Their Appl.
Igor E. Shparlinski
2008 — conf
Classical and Quantum Algorithms for Exponential Congruences.
TQC
Wim van Dam, Igor E. Shparlinski
2008 J jnl
Divisibility, Smoothness and Cryptographic Applications
CoRR
David Naccache, Igor E. Shparlinski
2008 J jnl
Divisibility, Smoothness and Cryptographic Applications.
IACR Cryptol. ePrint Arch.
David Naccache, Igor E. Shparlinski
2008 J jnl
Exponential sums and prime divisors of sparse integers.
Period. Math. Hung.
Igor E. Shparlinski
2008 J jnl
On RSA moduli with almost half of the bits prescribed.
Discret. Appl. Math.
Sidney W. Graham, Igor E. Shparlinski
2008 J jnl
On the Convex Closure of the Graph of Modular Inversions.
Exp. Math.
Mizan R. Khan, Igor E. Shparlinski, Christian L. Yankov
2008 J jnl
On the elliptic curve analogue of the sum-product problem.
Finite Fields Their Appl.
Igor E. Shparlinski
2008 B conf
Pseudorandom Graphs from Elliptic Curves.
LATIN
Igor E. Shparlinski
2007 J jnl
A computational introduction to number theory and algebra.
Math. Comput.
Igor E. Shparlinski
2007 J jnl
Bounds on the Fourier coefficients of the weighted sum function.
Inf. Process. Lett.
Igor E. Shparlinski
2007 J jnl
Character sums with subsequence sums.
Period. Math. Hung.
Sanka Balasuriya, Igor E. Shparlinski
2007 J jnl
Chinese Remaindering with Multiplicative Noise.
Theory Comput. Syst.
Igor E. Shparlinski, Ron Steinfeld
2007 J jnl
Communication complexity of some number theoretic functions.
Appl. Math. Lett.
Igor E. Shparlinski
2007 J jnl
Distribution of Roots of Polynomial Congruences.
Int. J. Math. Math. Sci.
Igor E. Shparlinski
2007 J jnl
Distribution of some sequences of points on elliptic curves.
J. Math. Cryptol.
Tanja Lange, Igor E. Shparlinski
2007 J jnl
Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131].
Discret. Math.
Simon R. Blackburn, Igor E. Shparlinski
2007 J jnl
On finite fields for pairing based cryptography.
Adv. Math. Commun.
Florian Luca, Igor E. Shparlinski
2007 J jnl
Prime Divisors Of Some Recurrence Sequence.
Period. Math. Hung.
Sanka Balasuriya, Florian Luca, Igor E. Shparlinski
2007 J jnl
Quantum period reconstruction of approximate sequences.
Inf. Process. Lett.
Igor E. Shparlinski, Arne Winterhof
2007 J jnl
Statistical distribution and collisions of VSH.
J. Math. Cryptol.
Ian F. Blake, Igor E. Shparlinski
2006 — conf
Bounds on the Fourier Coefficients of the Weighted Sum Function.
Complexity of Boolean Functions
Igor E. Shparlinski
2006 J jnl
Catalan and Apéry numbers in residue classes.
J. Comb. Theory A
Moubariz Z. Garaev, Florian Luca, Igor E. Shparlinski
2006 J jnl
Character sums and nonlinear recurrence sequences.
Discret. Math.
Simon R. Blackburn, Igor E. Shparlinski
2006 J jnl
Complexity of inverting the Euler function.
Math. Comput.
Scott Contini, Ernie Croot, Igor E. Shparlinski
2006 B conf
Constructions of Approximately Mutually Unbiased Bases.
LATIN
Igor E. Shparlinski, Arne Winterhof
2006 J jnl
Elliptic Curves with Low Embedding Degree.
J. Cryptol.
Florian Luca, Igor E. Shparlinski
2006 J jnl
Exponential sums with Dickson polynomials.
Finite Fields Their Appl.
Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski
2006 J jnl
GCD of Random Linear Combinations.
Algorithmica
Joachim von zur Gathen, Igor E. Shparlinski
2006 J jnl
On RSA Moduli with Prescribed Bit Patterns.
Des. Codes Cryptogr.
Igor E. Shparlinski
2006 C conf
On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences.
SETA
Igor E. Shparlinski, Arne Winterhof
2006 J jnl
On the Lower Bound of the Linear Complexity Over BBF_p of Sidelnikov Sequences.
IEEE Trans. Inf. Theory
Moubariz Z. Garaev, Florian Luca, Igor E. Shparlinski, Arne Winterhof
2006 J jnl
On the bit security of the Diffie-Hellman key.
Appl. Algebra Eng. Commun. Comput.
Ian F. Blake, Theodoulos Garefalakis, Igor E. Shparlinski
2006 J jnl
On the nonlinearity of linear recurrence sequences.
Appl. Math. Lett.
Igor E. Shparlinski, Arne Winterhof
2006 J jnl
On the set of distances between two sets over finite fields.
Int. J. Math. Math. Sci.
Igor E. Shparlinski
2006 J jnl
Reconstructing noisy polynomial evaluation in residue rings.
J. Algorithms
Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski
2006 J jnl
Testing set proportionality and the Ádám isomorphism of circulant graphs.
J. Discrete Algorithms
Don Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyen, Igor E. Shparlinski
2005 J jnl
A hidden number problem in small subgroups.
Math. Comput.
Igor E. Shparlinski, Arne Winterhof
2005 J jnl
Collisions in Fast Generation of Ideal Classes and Points on Hyperelliptic and Elliptic Curves.
Appl. Algebra Eng. Commun. Comput.
Tanja Lange, Igor E. Shparlinski
2005 — ch.
Diffie-Hellman Problem.
Encyclopedia of Cryptography and Security
Igor E. Shparlinski
2005 J jnl
Elliptic Curves with Low Embedding Degree.
IACR Cryptol. ePrint Arch.
Florian Luca, Igor E. Shparlinski
2005 J jnl
Noisy interpolation of sparse polynomials in finite fields.
Appl. Algebra Eng. Commun. Comput.
Igor E. Shparlinski, Arne Winterhof
2005 Misc conf
On Stern's Attack Against Secret Truncated Linear Congruential Generators.
ACISP
Scott Contini, Igor E. Shparlinski
2005 J jnl
On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves.
Des. Codes Cryptogr.
Florian Hess, Igor E. Shparlinski
2005 J jnl
On the linear complexity of bounded integer sequences over different moduli.
Inf. Process. Lett.
Igor E. Shparlinski, Arne Winterhof
2005 J jnl
On the singularity of generalised Vandermonde matrices over finite fields.
Finite Fields Their Appl.
Igor E. Shparlinski
2005 J jnl
Predicting nonlinear pseudorandom number generators.
Math. Comput.
Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski
2005 J jnl
Prime divisors of palindromes.
Period. Math. Hung.
William D. Banks, Igor E. Shparlinski
2005 J jnl
Prime divisors of some shifted products.
Int. J. Math. Math. Sci.
Éric Levieil, Florian Luca, Igor E. Shparlinski
2005 Misc conf
Quantum Noisy Rational Function Reconstruction.
COCOON
Sean Hallgren, Alexander Russell, Igor E. Shparlinski
2005 J jnl
Report on global methods for combinatorial isoperimetric problems.
Math. Comput.
Igor E. Shparlinski
2004 — conf
A Nonuniform Algorithm for the Hidden Number Problem in Subgroups.
Public Key Cryptography
Igor E. Shparlinski, Arne Winterhof
2004 B conf
Bisecting and Gossiping in Circulant Graphs.
LATIN
Bernard Mans, Igor E. Shparlinski
2004 J jnl
Classical and quantum function reconstruction via character evaluation.
J. Complex.
Alexander Russell, Igor E. Shparlinski
2004 J jnl
Complexity of Inverting the Euler Function
Electron. Colloquium Comput. Complex.
Scott Contini, Ernie Croot, Igor E. Shparlinski
2004 B conf
GCD of Random Linear Forms.
ISAAC
Joachim von zur Gathen, Igor E. Shparlinski
2004 — conf
New Results on the Hardness of Diffie-Hellman Bits.
Public Key Cryptography
María Isabel González Vasco, Mats Näslund, Igor E. Shparlinski
2004 J jnl
Noisy Chinese remaindering in the Lee norm.
J. Complex.
Igor E. Shparlinski, Ron Steinfeld
2004 J jnl
Number Theoretic Designs for Directed Regular Graphs of Small Diameter.
SIAM J. Discret. Math.
William D. Banks, Alessandro Conflitti, Igor E. Shparlinski
2004 J jnl
On Decimations of l-Sequences.
SIAM J. Discret. Math.
Mark Goresky, Andrew Klapper, Ram Murty, Igor E. Shparlinski
2004 B conf
On reducing a system of equations to a single equation.
ISSAC
Gudmund Skovbjerg Frandsen, Igor E. Shparlinski
2004 J jnl
On the multidimensional distribution of the subset sum generator of pseudorandom numbers.
Math. Comput.
Alessandro Conflitti, Igor E. Shparlinski
2004 J jnl
On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA.
Inf. Process. Lett.
Igor E. Shparlinski
2004 A* conf
Polynomial interpolation from multiples.
SODA
Joachim von zur Gathen, Igor E. Shparlinski
2004 B conf
Predicting Subset Sum Pseudorandom Generators.
Selected Areas in Cryptography
Joachim von zur Gathen, Igor E. Shparlinski
2004 Misc conf
Secure Bilinear Diffie-Hellman Bits.
ACISP
Steven D. Galbraith, Herbie J. Hopkins, Igor E. Shparlinski
2004 J jnl
Security of polynomial transformations of the Diffie-Hellman key.
Finite Fields Their Appl.
Igor E. Shparlinski
2003 B conf
An authentication scheme based on roots of sparse polynomials.
ITW
Joachim von zur Gathen, Amin Shokrollahi, Igor E. Shparlinski
2003 J jnl
Complexity of some arithmetic problems for binary polynomials.
Comput. Complex.
Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor E. Shparlinski
2003 — book
Cryptographic applications of analytic number theory - complexity lower bounds and pseudorandomness.
Igor E. Shparlinski
2003 — conf
Dynamical Systems Generated by Rational Functions.
AAECC
Harald Niederreiter, Igor E. Shparlinski
2003 J jnl
Finding Points on Curves over Finite Fields.
SIAM J. Comput.
Joachim von zur Gathen, Igor E. Shparlinski, Alistair Sinclair
2003 J jnl
Hidden Number Problem in Small Subgroups.
IACR Cryptol. ePrint Arch.
Igor E. Shparlinski, Arne Winterhof
2003 J jnl
Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation.
Math. Comput.
Nick Howgrave-Graham, Phong Q. Nguyen, Igor E. Shparlinski
2003 J jnl
Linear Complexity of the Discrete Logarithm.
Des. Codes Cryptogr.
Sergei Konyagin, Tanja Lange, Igor E. Shparlinski
2003 — conf
On the Bit Security of NTRUEncrypt.
Public Key Cryptography
Mats Näslund, Igor E. Shparlinski, William Whyte
2003 J jnl
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators.
IEEE Trans. Inf. Theory
Jaime Gutierrez, Igor E. Shparlinski, Arne Winterhof
2003 J jnl
On the maximal difference between an element and its inverse modulo
Period. Math. Hung.
Mizan R. Khan, Igor E. Shparlinski
2003 C conf
Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity.
IMACC
Harald Niederreiter, Igor E. Shparlinski
2003 C conf
Predicting the Inversive Generator.
IMACC
Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski
2003 J jnl
Prime divisors of sparse integers.
Period. Math. Hung.
Igor E. Shparlinski
2003 — book
Recurrence Sequences.
Graham Everest, Alfred J. van der Poorten, Igor E. Shparlinski, Thomas Ward
2003 J jnl
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces.
Des. Codes Cryptogr.
Phong Q. Nguyen, Igor E. Shparlinski
2003 A* conf
Unconditional proof of tightness of Johnson bound.
SODA
Venkatesan Guruswami, Igor E. Shparlinski
2002 Misc conf
A Variant of NTRU with Non-invertible Polynomials.
INDOCRYPT
William D. Banks, Igor E. Shparlinski
2002 — conf
Chinese Remaindering for Algebraic Numbers in a Hidden Field.
ANTS
Igor E. Shparlinski, Ron Steinfeld
2002 A* conf
Hidden Number Problem with the Trace and Bit Security of XTR and LUC.
CRYPTO
Wen-Ching W. Li, Mats Näslund, Igor E. Shparlinski
2002 J jnl
Non-approximability of the Permanent of Structured Matrices over Finite Fields
Electron. Colloquium Comput. Complex.
Bruno Codenotti, Igor E. Shparlinski
2002 J jnl
On the Uniformity of Distribution of the ElGamal Signature.
Appl. Algebra Eng. Commun. Comput.
Igor E. Shparlinski
2002 J jnl
On the hardness of approximating the permanent of structured matrices.
Comput. Complex.
Bruno Codenotti, Igor E. Shparlinski, Arne Winterhof
2002 J jnl
On the spectral Ádám property for circulant graphs.
Discret. Math.
Bernard Mans, Francesco Pappalardi, Igor E. Shparlinski
2002 J jnl
Secure Bilinear Diffie-Hellman Bits.
IACR Cryptol. ePrint Arch.
Steven D. Galbraith, Herbie J. Hopkins, Igor E. Shparlinski
2002 J jnl
Security of most significant bits of g
Inf. Process. Lett.
Igor E. Shparlinski
2002 J jnl
Security of the most significant bits of the Shamir message passing scheme.
Math. Comput.
María Isabel González Vasco, Igor E. Shparlinski
2002 — conf
Selective Forgery of RSA Signatures with Fixed-Pattern Padding.
Public Key Cryptography
Arjen K. Lenstra, Igor E. Shparlinski
2002 — conf
Smooth Orders and Cryptographic Applications.
ANTS
Carl Pomerance, Igor E. Shparlinski
2002 B conf
The Hidden Number Problem in Extension Fields and Its Applications.
LATIN
María Isabel González Vasco, Mats Näslund, Igor E. Shparlinski
2002 J jnl
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces.
J. Cryptol.
Phong Q. Nguyen, Igor E. Shparlinski
2001 J jnl
A Lower Bound for Primality.
J. Comput. Syst. Sci.
Eric Allender, Michael E. Saks, Igor E. Shparlinski
2001 — ed.
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 14th International Symposium, AAECC-14, Melbourne, Australia November 26-30, 2001, Proceedings
AAECC
Serdar Boztas, Igor E. Shparlinski
2001 J jnl
Circuit and Decision Tree Complexity of Some Number Theoretic Problems.
Inf. Comput.
Anna Bernasconi, Carsten Damm, Igor E. Shparlinski
2001 — conf
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems.
FSTTCS
Erion Plaku, Igor E. Shparlinski
2001 J jnl
On Some Properties of the Shrinking Generator.
Des. Codes Cryptogr.
Igor E. Shparlinski
2001 J jnl
On Some Uniformity of Distribution Properties of ESIGN.
Electron. Notes Discret. Math.
Edwin El Mahassni, Igor E. Shparlinski
2001 J jnl
On the Distribution of Diffie-Hellman Triples with Sparse Exponents.
SIAM J. Discret. Math.
John B. Friedlander, Igor E. Shparlinski
2001 — conf
On the Generalised Hidden Number Problem and Bit Security of XTR.
AAECC
Igor E. Shparlinski
2001 A conf
On the Insecurity of a Server-Aided RSA Protocol.
ASIACRYPT
Phong Q. Nguyen, Igor E. Shparlinski
2001 J jnl
On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves.
Des. Codes Cryptogr.
Igor E. Shparlinski, Joseph H. Silverman
2001 J jnl
On the Linear Complexity of the Power Generator.
Des. Codes Cryptogr.
Igor E. Shparlinski
2001 — conf
On the Security of Lenstra's Variant of DSA without Long Inversions.
Public Key Cryptography
Arjen K. Lenstra, Igor E. Shparlinski
2001 C conf
On the Uniformity of Distribution of Congruential Generators over Elliptic Curves.
SETA
Edwin El Mahassni, Igor E. Shparlinski
2001 A* conf
On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme.
CRYPTO
Dan Boneh, Igor E. Shparlinski
2001 J jnl
On the distribution of inversive congruential pseudorandom numbers in parts of the period.
Math. Comput.
Harald Niederreiter, Igor E. Shparlinski
2001 J jnl
On the distribution of the power generator.
Math. Comput.
John B. Friedlander, Igor E. Shparlinski
2001 J jnl
On the uniformity of distribution of the RSA pairs.
Math. Comput.
Igor E. Shparlinski
2001 J jnl
Period of the power generator and small values of Carmichael's function.
Math. Comput.
John B. Friedlander, Carl Pomerance, Igor E. Shparlinski
2001 A* conf
Sparse polynomial approximation in finite fields.
STOC
Igor E. Shparlinski
2001 — conf
The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces.
CaLC
Edwin El Mahassni, Phong Q. Nguyen, Igor E. Shparlinski
2000 Misc conf
An Extremely Small and Efficient Identification Scheme.
ACISP
William D. Banks, Daniel Lieman, Igor E. Shparlinski
2000 — conf
An Identification Scheme Based on Sparse Polynomials.
Public Key Cryptography
William D. Banks, Daniel Lieman, Igor E. Shparlinski
2000 B conf
Communication Complexity and Fourier Coefficients of the Diffie-Hellman Key.
LATIN
Igor E. Shparlinski
2000 J jnl
Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications.
J. Algorithms
Igor E. Shparlinski
2000 Misc conf
Cryptographic Applications of Sparse Polynomials over Finite Rings.
ICISC
William D. Banks, Daniel Lieman, Igor E. Shparlinski, Van Thuong To
2000 J jnl
Linear complexity of the Naor-Reingold pseudo-random function.
Inf. Process. Lett.
Igor E. Shparlinski
2000 — conf
On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields.
ANTS
David R. Kohel, Igor E. Shparlinski
2000 J jnl
On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping.
J. Cryptol.
Don Coppersmith, Igor E. Shparlinski
2000 J jnl
On the Distribution of Pseudorandom Numbers and Vectors Generated by Inversive Methods.
Appl. Algebra Eng. Commun. Comput.
Harald Niederreiter, Igor E. Shparlinski
2000 J jnl
On the Naor-Reingold Pseudo-Random Function from Elliptic Curves.
Appl. Algebra Eng. Commun. Comput.
Igor E. Shparlinski
2000 J jnl
On the Security of Diffie-Hellman Bits
Electron. Colloquium Comput. Complex.
María Isabel González Vasco, Igor E. Shparlinski
2000 J jnl
On the Security of Diffie-Hellman Bits.
IACR Cryptol. ePrint Arch.
María Isabel González Vasco, Igor E. Shparlinski
2000 — conf
On the distribution of the power generator modulo a prime power.
Unusual Applications of Number Theory
John B. Friedlander, Jan S. dT. Hansen, Igor E. Shparlinski
2000 J jnl
On the linear complexity profile of the power generator.
IEEE Trans. Inf. Theory
Frances Griffin, Igor E. Shparlinski
2000 J jnl
Security of Polynomial Transformations of the Diffie--Hellma
Electron. Colloquium Comput. Complex.
Igor E. Shparlinski
2000 J jnl
Security of Polynomial Transformations of the Diffie-Hellman Key.
IACR Cryptol. ePrint Arch.
Igor E. Shparlinski
2000 J jnl
Security of the Most Significant Bits of the Shamir Message Passing Scheme
Electron. Colloquium Comput. Complex.
María Isabel González Vasco, Igor E. Shparlinski
2000 J jnl
Security of the Most Significant Bits of the Shamir Message Passing Scheme.
IACR Cryptol. ePrint Arch.
María Isabel González Vasco, Igor E. Shparlinski
2000 J jnl
The CREW PRAM Complexity of Modular Inversion.
SIAM J. Comput.
Joachim von zur Gathen, Igor E. Shparlinski
2000 J jnl
The average sensitivity of square-freeness.
Comput. Complex.
Anna Bernasconi, Carsten Damm, Igor E. Shparlinski
2000 J jnl
Zero testing of p-adic and modular polynomials.
Theor. Comput. Sci.
Marek Karpinski, Alfred J. van der Poorten, Igor E. Shparlinski
1999 J jnl
A Lower Bound for Primality
Electron. Colloquium Comput. Complex.
Eric Allender, Igor E. Shparlinski, Michael E. Saks
1999 A conf
A Lower Bound for Primality.
CCC
Eric Allender, Michael E. Saks, Igor E. Shparlinski
1999 A conf
Circuit Complexity of Testing Square-Free Numbers.
STACS
Anna Bernasconi, Igor E. Shparlinski
1999 — conf
Constructing Elements of Large Order in Finite Fields.
AAECC
Joachim von zur Gathen, Igor E. Shparlinski
1999 Misc conf
Non-linear Complexity of the Naor-Reingold Pseudo-random Function.
ICISC
William D. Banks, Frances Griffin, Daniel Lieman, Igor E. Shparlinski
1999 Misc conf
On Routing in Circulant Graphs.
COCOON
Jin-Yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor E. Shparlinski
1999 J jnl
On The Correlation of Binary Sequences.
Des. Codes Cryptogr.
John B. Friedlander, Michael Larsen, Daniel Lieman, Igor E. Shparlinski
1999 Misc conf
On the Average Sensitivity of Testing Square-Free Numbers.
COCOON
Anna Bernasconi, Carsten Damm, Igor E. Shparlinski
1999 J jnl
On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials
Electron. Colloquium Comput. Complex.
Marek Karpinski, Igor E. Shparlinski
1999 — conf
On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials.
AAECC
Marek Karpinski, Igor E. Shparlinski
1999 — conf
On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders.
AAECC
Frances Griffin, Harald Niederreiter, Igor E. Shparlinski
1999 C conf
On the Linear Complexity of the Naor-Reingold Pseudo-Random Function.
ICICS
Frances Griffin, Igor E. Shparlinski
1999 J jnl
On the Uniformity of Distribution of a Certain Pseudo-Random Function
Electron. Colloquium Comput. Complex.
Igor E. Shparlinski
1998 J jnl
Circuit Complexity of Testing Square-Free Numbers
Electron. Colloquium Comput. Complex.
Anna Bernasconi, Igor E. Shparlinski
1998 J jnl
Circuit and Decision Tree Complexity of Some Number Theoretic Problems
Universität Trier, Mathematik/Informatik, Forschungsbericht
Anna Bernasconi, Carsten Damm, Igor E. Shparlinski
1998 J jnl
Computing components and projections of curves over finite fields.
SIAM J. Comput.
Joachim von zur Gathen, Igor E. Shparlinski
1998 J jnl
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
Electron. Colloquium Comput. Complex.
Igor E. Shparlinski
1998 C conf
On the Distribution of the RSA Generator.
SETA
John B. Friedlander, Daniel Lieman, Igor E. Shparlinski
1998 Misc conf
On the Ádám Conjecture on Circulant Graphs.
COCOON
Bernard Mans, Francesco Pappalardi, Igor E. Shparlinski
1998 J jnl
Orders of Gauss Periods in Finite Fields.
Appl. Algebra Eng. Commun. Comput.
Joachim von zur Gathen, Igor E. Shparlinski
1998 B conf
The CREW PRAM Complexity of Modular Inversion.
LATIN
Joachim von zur Gathen, Igor E. Shparlinski
1997 J jnl
Counting Curves and Their Projections.
Comput. Complex.
Joachim von zur Gathen, Marek Karpinski, Igor E. Shparlinski
1996 J jnl
On Finding Primitive Roots in Finite Fields.
Theor. Comput. Sci.
Igor E. Shparlinski
1996 J jnl
On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields.
Theor. Comput. Sci.
Marek Karpinski, Igor E. Shparlinski
1996 J jnl
On irreducible polynomials of small height over finite fields.
Appl. Algebra Eng. Commun. Comput.
Igor E. Shparlinski
1995 A* conf
Finding Points on Curves over Finite Fields (Extended Abstract).
FOCS
Joachim von zur Gathen, Igor E. Shparlinski
1995 B conf
Orders of Gauss Periods in Finite Fields.
ISAAC
Joachim von zur Gathen, Igor E. Shparlinski
1994 B conf
Components and Projections of Curves over Finite Fields.
ISAAC
Joachim von zur Gathen, Igor E. Shparlinski
1994 — conf
On some applications of finitely generated semi-groups.
ANTS
Igor E. Shparlinski
1993 A* conf
Counting curves and their projections.
STOC
Joachim von zur Gathen, Marek Karpinski, Igor E. Shparlinski
1993 J jnl
Finding Irreducible and Primitive Polynomials.
Appl. Algebra Eng. Commun. Comput.
Igor E. Shparlinski
1993 J jnl
On Parameters of Some Graphs from Finite Fields.
Eur. J. Comb.
Igor E. Shparlinski
1992 J jnl
A Deterministic Test for Permutation Polynomials.
Comput. Complex.
Igor E. Shparlinski
1992 J jnl
Distances from Differences of Roots of Polynomials to the Nearest Integers.
Inf. Process. Lett.
V. I. Galiev, A. F. Polupanov, Igor E. Shparlinski
1991 — conf
On Gaussian Sums for Finite Fields and Elliptic Curves.
Algebraic Coding
Igor E. Shparlinski
1991 J jnl
On the Distribution of Values of Recurring Sequences and the Bell Numbers in Finite Fields.
Eur. J. Comb.
Igor E. Shparlinski
1987 B conf
On Structure Complexity of Normal Basis of Finite Field.
FCT
S. A. Stepanov, Igor E. Shparlinski
2023 — conf
Not What You've Signed Up For: Compromising Real-World LLM-Integrated Applications with Indirect Prompt Injection.
AISec
Kai Greshake, Sahar Abdelnabi, Shailesh Mishra, Christoph Endres, Thorsten Holz, Mario Fritz
2026 — preprint
CCX: Enabling Unmodified Intel SGX Applications on Arm CCA.
arXiv
Matti Schulze, Thorsten Holz, Felix C. Freiling