| 2021 | MFCS | Sets of Linear Forms Which Are Hard to Compute. | Michael Kaminski, Igor E. Shparlinski |
| 2016 | ICALP | Optimal Quantum Algorithm for Polynomial Interpolation. | Andrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski |
| 2012 | LATIN | Random Walks and Bisections in Random Circulant Graphs. | Bernard Mans, Igor E. Shparlinski |
| 2008 | LATIN | Approximate Polynomial gcd: Small Degree and Small Height Perturbations. | Joachim von zur Gathen, Igor E. Shparlinski |
| 2008 | LATIN | Pseudorandom Graphs from Elliptic Curves. | Igor E. Shparlinski |
| 2006 | LATIN | Constructions of Approximately Mutually Unbiased Bases. | Igor E. Shparlinski, Arne Winterhof |
| 2006 | SETA | On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences. | Igor E. Shparlinski, Arne Winterhof |
| 2005 | ACISP | On Stern's Attack Against Secret Truncated Linear Congruential Generators. | Scott Contini, Igor E. Shparlinski |
| 2005 | COCOON | Quantum Noisy Rational Function Reconstruction. | Sean Hallgren, Alexander Russell, Igor E. Shparlinski |
| 2004 | ACISP | Secure Bilinear Diffie-Hellman Bits. | Steven D. Galbraith, Herbie J. Hopkins, Igor E. Shparlinski |
| 2004 | ISAAC | GCD of Random Linear Forms. | Joachim von zur Gathen, Igor E. Shparlinski |
| 2004 | ISSAC | On reducing a system of equations to a single equation. | Gudmund Skovbjerg Frandsen, Igor E. Shparlinski |
| 2004 | LATIN | Bisecting and Gossiping in Circulant Graphs. | Bernard Mans, Igor E. Shparlinski |
| 2004 | PKC | A Nonuniform Algorithm for the Hidden Number Problem in Subgroups. | Igor E. Shparlinski, Arne Winterhof |
| 2004 | PKC | New Results on the Hardness of Diffie-Hellman Bits. | Mara Isabel Gonzlez Vasco, Mats Nslund, Igor E. Shparlinski |
| 2004 | SODA | Polynomial interpolation from multiples. | Joachim von zur Gathen, Igor E. Shparlinski |
| 2003 | ITW | An authentication scheme based on roots of sparse polynomials. | Joachim von zur Gathen, Amin Shokrollahi, Igor E. Shparlinski |
| 2003 | PKC | On the Bit Security of NTRUEncrypt. | Mats Nslund, Igor E. Shparlinski, William Whyte |
| 2003 | SODA | Unconditional proof of tightness of Johnson bound. | Venkatesan Guruswami, Igor E. Shparlinski |
| 2002 | CRYPTO | Hidden Number Problem with the Trace and Bit Security of XTR and LUC. | Wen-Ching W. Li, Mats Nslund, Igor E. Shparlinski |
| 2002 | INDOCRYPT | A Variant of NTRU with Non-invertible Polynomials. | William D. Banks, Igor E. Shparlinski |
| 2002 | LATIN | The Hidden Number Problem in Extension Fields and Its Applications. | Mara Isabel Gonzlez Vasco, Mats Nslund, Igor E. Shparlinski |
| 2002 | PKC | Selective Forgery of RSA Signatures with Fixed-Pattern Padding. | Arjen K. Lenstra, Igor E. Shparlinski |
| 2001 | ASIACRYPT | On the Insecurity of a Server-Aided RSA Protocol. | Phong Q. Nguyen, Igor E. Shparlinski |
| 2001 | CRYPTO | On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme. | Dan Boneh, Igor E. Shparlinski |
| 2001 | PKC | On the Security of Lenstra's Variant of DSA without Long Inversions. | Arjen K. Lenstra, Igor E. Shparlinski |
| 2001 | STOC | Sparse polynomial approximation in finite fields. | Igor E. Shparlinski |
| 2001 | SETA | On the Uniformity of Distribution of Congruential Generators over Elliptic Curves. | Edwin El Mahassni, Igor E. Shparlinski |
| 2000 | ACISP | An Extremely Small and Efficient Identification Scheme. | William D. Banks, Daniel Lieman, Igor E. Shparlinski |
| 2000 | ICISC | Cryptographic Applications of Sparse Polynomials over Finite Rings. | William D. Banks, Daniel Lieman, Igor E. Shparlinski, Van Thuong To |
| 2000 | LATIN | Communication Complexity and Fourier Coefficients of the Diffie-Hellman Key. | Igor E. Shparlinski |
| 2000 | PKC | An Identification Scheme Based on Sparse Polynomials. | William D. Banks, Daniel Lieman, Igor E. Shparlinski |
| 1999 | COCOON | On the Average Sensitivity of Testing Square-Free Numbers. | Anna Bernasconi, Carsten Damm, Igor E. Shparlinski |
| 1999 | COCOON | On Routing in Circulant Graphs. | Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor E. Shparlinski |
| 1999 | ICICS | On the Linear Complexity of the Naor-Reingold Pseudo-Random Function. | Frances Griffin, Igor E. Shparlinski |
| 1999 | ICISC | Non-linear Complexity of the Naor-Reingold Pseudo-random Function. | William D. Banks, Frances Griffin, Daniel Lieman, Igor E. Shparlinski |
| 1999 | STACS | Circuit Complexity of Testing Square-Free Numbers. | Anna Bernasconi, Igor E. Shparlinski |
| 1998 | COCOON | On the dm Conjecture on Circulant Graphs. | Bernard Mans, Francesco Pappalardi, Igor E. Shparlinski |
| 1998 | LATIN | The CREW PRAM Complexity of Modular Inversion. | Joachim von zur Gathen, Igor E. Shparlinski |
| 1998 | SETA | On the Distribution of the RSA Generator. | John B. Friedlander, Daniel Lieman, Igor E. Shparlinski |
| 1995 | FOCS | Finding Points on Curves over Finite Fields (Extended Abstract). | Joachim von zur Gathen, Igor E. Shparlinski |
| 1995 | ISAAC | Orders of Gauss Periods in Finite Fields. | Joachim von zur Gathen, Igor E. Shparlinski |
| 1994 | ISAAC | Components and Projections of Curves over Finite Fields. | Joachim von zur Gathen, Igor E. Shparlinski |
| 1993 | STOC | Counting curves and their projections. | Joachim von zur Gathen, Marek Karpinski, Igor E. Shparlinski |
| 1987 | FCT | On Structure Complexity of Normal Basis of Finite Field. | S. A. Stepanov, Igor E. Shparlinski |