default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgor E. Shparlinski
Person information
- affiliation: University of New South Wales, Sydney, School of Mathematics and Statistics, Australia
- affiliation: Macquarie University, Sydney, Department of Computing
- award (1996): Humboldt Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2003
[b2]Igor E. Shparlinski:
Cryptographic applications of analytic number theory - complexity lower bounds and pseudorandomness. Progress in computer science and applied logic 22, Birkhäuser 2003, ISBN 978-3-7643-6654-4, pp. I-VIII, 1-411- [b1]Graham Everest, Alfred J. van der Poorten, Igor E. Shparlinski, Thomas Ward:
Recurrence Sequences. Mathematical surveys and monographs 104, American Mathematical Society 2003, ISBN 978-0-8218-3387-2, pp. I-XIII, 1-318
Journal Articles
- 2024
- [j178]Siddharth Iyer
, Igor E. Shparlinski:
Character sums over elements of extensions of finite fields with restricted coordinates. Finite Fields Their Appl. 93: 102335 (2024) - [j177]Moubariz Z. Garaev, Igor E. Shparlinski:
On some congruences and exponential sums. Finite Fields Their Appl. 98: 102451 (2024) - [j176]Bryce Kerr, Ali Mohammadi, Igor E. Shparlinski:
Additive Energy of Polynomial Images. SIAM J. Discret. Math. 38(3): 2163-2180 (2024) - 2023
- [j175]Michael Kaminski, Igor E. Shparlinski, Michel Waldschmidt:
On sets of linear forms of maximal complexity. Comput. Complex. 32(1): 1 (2023) - [j174]Igor E. Shparlinski:
Fixed points of the subset sum pseudorandom number generators. Des. Codes Cryptogr. 91(7): 2473-2479 (2023) - [j173]Igor E. Shparlinski:
On the number of Diophantine m-tuples in finite fields. Finite Fields Their Appl. 90: 102241 (2023) - [j172]Andrzej Dabrowski, Jacek Pomykala, Igor E. Shparlinski:
On oracle factoring of integers. J. Complex. 76: 101741 (2023) - [j171]Bernard Mans, Min Sha, Igor E. Shparlinski, Daniel Sutantyo:
Functional graphs of families of quadratic polynomials. Math. Comput. 92(343): 2307-2331 (2023) - [j170]László Mérai, Igor E. Shparlinski:
Distribution of recursive matrix pseudorandom number generator modulo prime powers. Math. Comput. 93(347): 1355-1370 (2023) - 2022
- [j169]Christian Bagshaw, Igor E. Shparlinski:
Energy bounds, bilinear forms and their applications in function fields. Finite Fields Their Appl. 82: 102048 (2022) - [j168]Igor E. Shparlinski:
Multiplicative Properties of Hilbert Cubes. SIAM J. Discret. Math. 36(2): 1064-1070 (2022) - 2021
- [j167]Marek Karpinski, Igor E. Shparlinski:
Noisy polynomial interpolation modulo prime powers. J. Complex. 64: 101542 (2021) - [j166]Igor E. Shparlinski, Qiang Wang:
Exponential Sums with Sparse Polynomials over Finite Fields. SIAM J. Discret. Math. 35(2): 976-987 (2021) - 2020
- [j165]Igor E. Shparlinski:
Geometric progressions in vector sumsets over finite fields. Finite Fields Their Appl. 68: 101747 (2020) - [j164]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: 231-241 (2020) - [j163]László Mérai, Igor E. Shparlinski:
Distribution of short subsequences of inversive congruential pseudorandom numbers modulo 2t. Math. Comput. 89(322): 911-922 (2020) - [j162]Simon Macourt, Giorgis Petridis, Ilya D. Shkredov, Igor E. Shparlinski:
Bounds of Trilinear and Trinomial Exponential Sums. SIAM J. Discret. Math. 34(4): 2124-2136 (2020) - 2019
- [j161]Igor E. Shparlinski, Arne Winterhof:
Codes correcting restricted errors. Des. Codes Cryptogr. 87(4): 855-863 (2019) - [j160]Bernard Mans, Min Sha, Igor E. Shparlinski, Daniel Sutantyo:
On Functional Graphs of Quadratic Polynomials. Exp. Math. 28(3): 292-300 (2019) - [j159]Simon Macourt, Igor E. Shparlinski:
Double sums of Kloosterman sums in finite fields. Finite Fields Their Appl. 60 (2019) - 2018
- [j158]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): 560-575 (2018) - [j157]Domingo Gómez-Pérez, Igor E. Shparlinski:
Arithmetic Properties of Integers in Chains and Reflections of g-ary Expansions. Exp. Math. 27(2): 184-192 (2018) - [j156]Carl Pomerance, Igor E. Shparlinski:
Connected Components of the Graph Generated by Power Maps in Prime Finite Fields. Integers 18A: A16 (2018) - [j155]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: 74-84 (2018) - [j154]Igor E. Shparlinski:
On Constructing Primitive Roots in Finite Fields With Advice. IEEE Trans. Inf. Theory 64(11): 7132-7136 (2018) - 2017
- [j153]Igor E. Shparlinski, Andreas J. Weingartner:
An explicit polynomial analogue of Romanoff's theorem. Finite Fields Their Appl. 44: 22-33 (2017) - [j152]Jason P. Bell, Igor E. Shparlinski:
Power series approximations to Fekete polynomials. J. Approx. Theory 222: 132-142 (2017) - 2016
- [j151]Igor E. Shparlinski:
On small gaps between the elements of multiplicative subgroups of finite fields. Des. Codes Cryptogr. 80(1): 63-71 (2016) - [j150]Igor E. Shparlinski:
Ratios of Small Integers in Multiplicative Subgroups of Residue Rings. Exp. Math. 25(3): 273-280 (2016) - [j149]Randell Heyman, Igor E. Shparlinski:
Counting irreducible binomials over finite fields. Finite Fields Their Appl. 38: 1-12 (2016) - [j148]Igor E. Shparlinski:
On the additive energy of the distance set in finite fields. Finite Fields Their Appl. 42: 187-199 (2016) - [j147]Sergei V. Konyagin, Florian Luca, Bernard Mans, Luke Mathieson, Min Sha, Igor E. Shparlinski:
Functional graphs of polynomials over finite fields. J. Comb. Theory B 116: 87-122 (2016) - [j146]William D. Banks, Igor E. Shparlinski:
On Gauss sums and the evaluation of Stechkin's constant. Math. Comput. 85(301): 2569-2581 (2016) - [j145]Phong Q. Nguyen, Igor E. Shparlinski:
Counting Co-Cyclic Lattices. SIAM J. Discret. Math. 30(3): 1358-1370 (2016) - 2015
- [j144]Igor E. Shparlinski:
Close values of shifted modular inversions and the decisional modular inversion hidden number problem. Adv. Math. Commun. 9(2): 169-176 (2015) - [j143]Joachim von zur Gathen, Igor E. Shparlinski:
Circulant graphs and GCD and LCM of subsets. Inf. Process. Lett. 115(2): 134-138 (2015) - [j142]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): 308-322 (2015) - [j141]Jean Bourgain, Sergei V. Konyagin, Igor E. Shparlinski:
Character sums and deterministic polynomial root finding in finite fields. Math. Comput. 84(296): 2969-2977 (2015) - [j140]Igor E. Shparlinski:
Cayley Graphs Generated by Small Degree Polynomials over Finite Fields. SIAM J. Discret. Math. 29(1): 376-381 (2015) - 2014
- [j139]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): 181-188 (2014) - [j138]Bernard Mans, Igor E. Shparlinski:
Random Walks, Bisections and Gossiping in Circulant Graphs. Algorithmica 70(2): 301-325 (2014) - [j137]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): 241-260 (2014) - [j136]Igor E. Shparlinski, Andrew V. Sutherland:
On the Distribution of Atkin and Elkies Primes. Found. Comput. Math. 14(2): 285-297 (2014) - [j135]Igor E. Shparlinski:
Products with variables from low-dimensional affine spaces and shifted power identity testing in finite fields. J. Symb. Comput. 64: 35-41 (2014) - [j134]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): 1535-1550 (2014) - [j133]San Ling, Igor E. Shparlinski, Huaxiong Wang:
On the Multidimensional Distribution of the Naor-Reingold Pseudo-Random Function. Math. Comput. 83(289): 2429-2434 (2014) - [j132]Randell Heyman, Igor E. Shparlinski:
On shifted Eisenstein polynomials. Period. Math. Hung. 69(2): 170-181 (2014) - [j131]Igor E. Shparlinski:
Evasive properties of sparse graphs and some linear equations in primes. Theor. Comput. Sci. 547: 117-121 (2014) - [j130]Zhixiong Chen, Igor E. Shparlinski, Arne Winterhof:
Covering Sets for Limited-Magnitude Errors. IEEE Trans. Inf. Theory 60(9): 5315-5321 (2014) - 2013
- [j129]Randell Heyman, Igor E. Shparlinski:
On the number of Eisenstein polynomials of bounded height. Appl. Algebra Eng. Commun. Comput. 24(2): 149-156 (2013) - [j128]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): 395-402 (2013) - [j127]David Harvey, Igor E. Shparlinski:
Statistics of Different Reduction Types of Fermat Curves. Exp. Math. 22(3): 243-249 (2013) - [j126]Igor E. Shparlinski, Arne Winterhof:
Distribution of values of polynomial Fermat quotients. Finite Fields Their Appl. 19(1): 93-104 (2013) - [j125]Igor E. Shparlinski:
Correcting noisy exponentiation black-boxes modulo a prime. Inf. Process. Lett. 113(12): 414-417 (2013) - [j124]Joachim von zur Gathen, Igor E. Shparlinski:
Generating safe primes. J. Math. Cryptol. 7(4): 333-365 (2013) - [j123]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): 491-512 (2013) - [j122]Igor E. Shparlinski:
On products of primes and almost primes in arithmetic progressions. Period. Math. Hung. 67(1): 55-61 (2013) - [j121]Igor E. Shparlinski:
Additive Decompositions of Subgroups of Finite Fields. SIAM J. Discret. Math. 27(4): 1870-1879 (2013) - 2012
- [j120]Reza Rezaeian Farashahi, Igor E. Shparlinski:
On Group Structures Realized by Elliptic Curves over a Fixed Finite Field. Exp. Math. 21(1): 1-10 (2012) - [j119]William D. Banks, Francesco Pappalardi, Igor E. Shparlinski:
On Group Structures Realized by Elliptic Curves over Arbitrary Finite Fields. Exp. Math. 21(1): 11-25 (2012) - [j118]Antal Balog, Kevin A. Broughan, Igor E. Shparlinski:
Sum-Products Estimates with Several Sets and Applications. Integers 12: A27 (2012) - [j117]Alina Ostafe, Igor E. Shparlinski:
On the power generator and its multivariate analogue. J. Complex. 28(2): 238-249 (2012) - [j116]San Ling, Igor E. Shparlinski, Ron Steinfeld, Huaxiong Wang:
On the modular inversion hidden number problem. J. Symb. Comput. 47(4): 358-367 (2012) - [j115]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): 1093-1110 (2012) - [j114]Alina Ostafe, Igor E. Shparlinski:
Multiplicative character sums and products of sparse integers in residue classes. Period. Math. Hung. 64(2): 247-255 (2012) - [j113]Jean Bourgain, Moubariz Z. Garaev, Sergei Konyagin, Igor E. Shparlinski:
On the Hidden Shifted Power Problem. SIAM J. Comput. 41(6): 1524-1557 (2012) - [j112]Reza Rezaeian Farashahi, Igor E. Shparlinski:
Pseudorandom Bits From Points on Elliptic Curves. IEEE Trans. Inf. Theory 58(2): 1242-1247 (2012) - 2011
- [j111]Igor E. Shparlinski:
On the average distribution of pseudorandom numbers generated by nonlinear permutations. Math. Comput. 80(274): 1053-1061 (2011) - [j110]Alina Ostafe, Igor E. Shparlinski:
Pseudorandomness and Dynamics of Fermat Quotients. SIAM J. Discret. Math. 25(1): 50-71 (2011) - 2010
- [j109]Alina Ostafe, Igor E. Shparlinski, Arne Winterhof:
On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences. Adv. Math. Commun. 4(3): 369-379 (2010) - [j108]Alina Ostafe, Igor E. Shparlinski:
Pseudorandom numbers and hash functions from iterations of multivariate polynomials. Cryptogr. Commun. 2(1): 49-67 (2010) - [j107]Reza Rezaeian Farashahi, Igor E. Shparlinski:
On the number of distinct elliptic curves in some families. Des. Codes Cryptogr. 54(1): 83-99 (2010) - [j106]Lev Glebsky, Igor E. Shparlinski:
Short cycles in repeated exponentiation modulo a prime. Des. Codes Cryptogr. 56(1): 35-42 (2010) - [j105]Alina Ostafe, Elena Pelican, Igor E. Shparlinski:
On pseudorandom numbers from multivariate polynomial systems. Finite Fields Their Appl. 16(5): 320-328 (2010) - [j104]Kevin A. Broughan, Florian Luca, Igor E. Shparlinski:
Some Divisibility Properties of Binomial Coefficients and the Converse of Wolstenholme's Theorem. Integers 10: A41 (2010) - [j103]Koray Karabina, Alfred Menezes, Carl Pomerance, Igor E. Shparlinski:
On the asymptotic effectiveness of Weil descent attacks. J. Math. Cryptol. 4(2): 175-191 (2010) - [j102]Joachim von zur Gathen, Maurice Mignotte, Igor E. Shparlinski:
Approximate polynomial GCD: Small degree and small height perturbations. J. Symb. Comput. 45(8): 879-886 (2010) - [j101]Alina Ostafe, Igor E. Shparlinski:
On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators. Math. Comput. 79(269): 501-511 (2010) - [j100]Igor E. Shparlinski:
On the Distribution of Orbits of PGL2(q) in Fqn and the Klapper Conjecture. SIAM J. Discret. Math. 23(4): 2093-2099 (2010) - 2009
- [j99]Nicholas M. Katz, Igor E. Shparlinski, Maosheng Xiong:
On character sums with distances on the upper half plane over a finite field. Finite Fields Their Appl. 15(6): 738-747 (2009) - [j98]Alina Carmen Cojocaru, Igor E. Shparlinski:
On the embedding degree of reductions of an elliptic curve. Inf. Process. Lett. 109(13): 652-654 (2009) - [j97]Joachim von zur Gathen, Igor E. Shparlinski:
Subset sum pseudorandom numbers: fast generation and distribution. J. Math. Cryptol. 3(2): 149-163 (2009) - [j96]John B. Friedlander, Igor E. Shparlinski:
On the density of some special primes. J. Math. Cryptol. 3(3): 265-271 (2009) - [j95]Reza Rezaeian Farashahi, Igor E. Shparlinski, José Felipe Voloch:
On hashing into elliptic curves. J. Math. Cryptol. 3(4): 353-360 (2009) - [j94]Igor E. Shparlinski:
On the values of Kloosterman sums. IEEE Trans. Inf. Theory 55(6): 2599-2601 (2009) - 2008
- [j93]Sidney W. Graham, Igor E. Shparlinski:
On RSA moduli with almost half of the bits prescribed. Discret. Appl. Math. 156(16): 3150-3154 (2008) - [j92]Mizan R. Khan, Igor E. Shparlinski, Christian L. Yankov:
On the Convex Closure of the Graph of Modular Inversions. Exp. Math. 17(1): 91-104 (2008) - [j91]Igor E. Shparlinski:
Bilinear character sums over elliptic curves. Finite Fields Their Appl. 14(1): 132-141 (2008) - [j90]Igor E. Shparlinski:
On the elliptic curve analogue of the sum-product problem. Finite Fields Their Appl. 14(3): 721-726 (2008) - [j89]Igor E. Shparlinski:
Exponential sums and prime divisors of sparse integers. Period. Math. Hung. 57(1): 93-99 (2008) - 2007
- [j88]Florian Luca, Igor E. Shparlinski:
On finite fields for pairing based cryptography. Adv. Math. Commun. 1(3): 281-286 (2007) - [j87]Igor E. Shparlinski:
Communication complexity of some number theoretic functions. Appl. Math. Lett. 20(8): 872-875 (2007) - [j86]Simon R. Blackburn, Igor E. Shparlinski:
Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131]. Discret. Math. 307(9-10): 1218-1219 (2007) - [j85]Igor E. Shparlinski:
Distribution of Roots of Polynomial Congruences. Int. J. Math. Math. Sci. 2007: 37853:1-37853:5 (2007) - [j84]Igor E. Shparlinski:
Bounds on the Fourier coefficients of the weighted sum function. Inf. Process. Lett. 103(3): 83-87 (2007) - [j83]Igor E. Shparlinski, Arne Winterhof:
Quantum period reconstruction of approximate sequences. Inf. Process. Lett. 103(6): 211-215 (2007) - [j82]Tanja Lange, Igor E. Shparlinski:
Distribution of some sequences of points on elliptic curves. J. Math. Cryptol. 1(1): 1-11 (2007) - [j81]Ian F. Blake, Igor E. Shparlinski:
Statistical distribution and collisions of VSH. J. Math. Cryptol. 1(4): 329-349 (2007) - [j80]Igor E. Shparlinski:
A computational introduction to number theory and algebra. Math. Comput. 76(259): 1697-1698 (2007) - [j79]Igor E. Shparlinski, Ron Steinfeld:
Chinese Remaindering with Multiplicative Noise. Theory Comput. Syst. 40(1): 33-41 (2007) - [j78]Sanka Balasuriya, Florian Luca, Igor E. Shparlinski:
Prime Divisors Of Some Recurrence Sequence. Period. Math. Hung. 54(2): 215-227 (2007) - [j77]Sanka Balasuriya, Igor E. Shparlinski:
Character sums with subsequence sums. Period. Math. Hung. 55(2): 215-221 (2007) - 2006
- [j76]Ian F. Blake, Theodoulos Garefalakis, Igor E. Shparlinski:
On the bit security of the Diffie-Hellman key. Appl. Algebra Eng. Commun. Comput. 16(6): 397-404 (2006) - [j75]Joachim von zur Gathen, Igor E. Shparlinski:
GCD of Random Linear Combinations. Algorithmica 46(1): 137-148 (2006) - [j74]Igor E. Shparlinski, Arne Winterhof:
On the nonlinearity of linear recurrence sequences. Appl. Math. Lett. 19(4): 340-344 (2006) - [j73]Igor E. Shparlinski:
On RSA Moduli with Prescribed Bit Patterns. Des. Codes Cryptogr. 39(1): 113-122 (2006) - [j72]Simon R. Blackburn, Igor E. Shparlinski:
Character sums and nonlinear recurrence sequences. Discret. Math. 306(12): 1126-1131 (2006) - [j71]Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski:
Exponential sums with Dickson polynomials. Finite Fields Their Appl. 12(1): 16-25 (2006) - [j70]Igor E. Shparlinski:
On the set of distances between two sets over finite fields. Int. J. Math. Math. Sci. 2006: 59482:1-59482:5 (2006) - [j69]Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski:
Reconstructing noisy polynomial evaluation in residue rings. J. Algorithms 61(2): 47-59 (2006) - [j68]Moubariz Z. Garaev, Florian Luca, Igor E. Shparlinski:
Catalan and Apéry numbers in residue classes. J. Comb. Theory A 113(5): 851-865 (2006) - [j67]Don Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyen, Igor E. Shparlinski:
Testing set proportionality and the Ádám isomorphism of circulant graphs. J. Discrete Algorithms 4(2): 324-335 (2006) - [j66]Florian Luca, Igor E. Shparlinski:
Elliptic Curves with Low Embedding Degree. J. Cryptol. 19(4): 553-562 (2006) - [j65]Scott Contini, Ernie Croot, Igor E. Shparlinski:
Complexity of inverting the Euler function. Math. Comput. 75(254): 983-996 (2006) - [j64]Moubariz Z. Garaev, Florian Luca, Igor E. Shparlinski, Arne Winterhof:
On the Lower Bound of the Linear Complexity Over BBF_p of Sidelnikov Sequences. IEEE Trans. Inf. Theory 52(7): 3299-3304 (2006) - 2005
- [j63]Tanja Lange, Igor E. Shparlinski:
Collisions in Fast Generation of Ideal Classes and Points on Hyperelliptic and Elliptic Curves. Appl. Algebra Eng. Commun. Comput. 15(5): 329-337 (2005) - [j62]Igor E. Shparlinski, Arne Winterhof:
Noisy interpolation of sparse polynomials in finite fields. Appl. Algebra Eng. Commun. Comput. 16(5): 307-317 (2005) - [j61]Florian Hess, Igor E. Shparlinski:
On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves. Des. Codes Cryptogr. 35(1): 111-117 (2005) - [j60]Igor E. Shparlinski:
On the singularity of generalised Vandermonde matrices over finite fields. Finite Fields Their Appl. 11(2): 193-199 (2005) - [j59]Éric Levieil, Florian Luca, Igor E. Shparlinski:
Prime divisors of some shifted products. Int. J. Math. Math. Sci. 2005(19): 3057-3073 (2005) - [j58]Igor E. Shparlinski, Arne Winterhof:
On the linear complexity of bounded integer sequences over different moduli. Inf. Process. Lett. 96(5): 175-177 (2005) - [j57]Igor E. Shparlinski:
Report on global methods for combinatorial isoperimetric problems. Math. Comput. 74(250) (2005) - [j56]Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski:
Predicting nonlinear pseudorandom number generators. Math. Comput. 74(251): 1471-1494 (2005) - [j55]Igor E. Shparlinski, Arne Winterhof:
A hidden number problem in small subgroups. Math. Comput. 74(252): 2073-2080 (2005) - [j54]William D. Banks, Igor E. Shparlinski:
Prime divisors of palindromes. Period. Math. Hung. 51(1): 1-10 (2005) - 2004
- [j53]Igor E. Shparlinski:
Security of polynomial transformations of the Diffie-Hellman key. Finite Fields Their Appl. 10(1): 123-131 (2004) - [j52]Igor E. Shparlinski:
On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA. Inf. Process. Lett. 92(3): 143-147 (2004) - [j51]Alexander Russell, Igor E. Shparlinski:
Classical and quantum function reconstruction via character evaluation. J. Complex. 20(2-3): 404-422 (2004) - [j50]Igor E. Shparlinski, Ron Steinfeld:
Noisy Chinese remaindering in the Lee norm. J. Complex. 20(2-3): 423-437 (2004) - [j49]Alessandro Conflitti, Igor E. Shparlinski:
On the multidimensional distribution of the subset sum generator of pseudorandom numbers. Math. Comput. 73(246): 1005-1011 (2004) - [j48]William D. Banks, Alessandro Conflitti, Igor E. Shparlinski:
Number Theoretic Designs for Directed Regular Graphs of Small Diameter. SIAM J. Discret. Math. 17(3): 377-383 (2004) - [j47]Mark Goresky, Andrew Klapper, Ram Murty, Igor E. Shparlinski:
On Decimations of l-Sequences. SIAM J. Discret. Math. 18(1): 130-140 (2004) - 2003
- [j46]Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor E. Shparlinski:
Complexity of some arithmetic problems for binary polynomials. Comput. Complex. 12(1-2): 23-47 (2003) - [j45]Sergei Konyagin, Tanja Lange, Igor E. Shparlinski:
Linear Complexity of the Discrete Logarithm. Des. Codes Cryptogr. 28(2): 135-146 (2003) - [j44]Phong Q. Nguyen, Igor E. Shparlinski:
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces. Des. Codes Cryptogr. 30(2): 201-217 (2003) - [j43]Nick Howgrave-Graham, Phong Q. Nguyen, Igor E. Shparlinski:
Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation. Math. Comput. 72(243): 1473-1485 (2003) - [j42]Igor E. Shparlinski:
Prime divisors of sparse integers. Period. Math. Hung. 46(2): 215-222 (2003) - [j41]Mizan R. Khan, Igor E. Shparlinski:
On the maximal difference between an element and its inverse modulo n. Period. Math. Hung. 47(1-2): 111-117 (2003) - [j40]Joachim von zur Gathen, Igor E. Shparlinski, Alistair Sinclair:
Finding Points on Curves over Finite Fields. SIAM J. Comput. 32(6): 1436-1448 (2003) - [j39]Jaime Gutierrez, Igor E. Shparlinski, Arne Winterhof:
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators. IEEE Trans. Inf. Theory 49(1): 60-64 (2003) - 2002
- [j38]Igor E. Shparlinski:
On the Uniformity of Distribution of the ElGamal Signature. Appl. Algebra Eng. Commun. Comput. 13(1): 9-16 (2002) - [j37]Bruno Codenotti, Igor E. Shparlinski, Arne Winterhof:
On the hardness of approximating the permanent of structured matrices. Comput. Complex. 11(3-4): 158-170 (2002) - [j36]Bernard Mans, Francesco Pappalardi, Igor E. Shparlinski:
On the spectral Ádám property for circulant graphs. Discret. Math. 254(1-3): 309-329 (2002) - [j35]Igor E. Shparlinski:
Security of most significant bits of gx2. Inf. Process. Lett. 83(2): 109-113 (2002) - [j34]Phong Q. Nguyen, Igor E. Shparlinski:
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces. J. Cryptol. 15(3): 151-176 (2002) - [j33]María Isabel González Vasco, Igor E. Shparlinski:
Security of the most significant bits of the Shamir message passing scheme. Math. Comput. 71(237): 333-342 (2002) - 2001
- [j32]Igor E. Shparlinski:
On the Linear Complexity of the Power Generator. Des. Codes Cryptogr. 23(1): 5-10 (2001) - [j31]Igor E. Shparlinski:
On Some Properties of the Shrinking Generator. Des. Codes Cryptogr. 23(2): 147-156 (2001) - [j30]Igor E. Shparlinski, Joseph H. Silverman:
On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves. Des. Codes Cryptogr. 24(3): 279-289 (2001) - [j29]Edwin El Mahassni, Igor E. Shparlinski:
On Some Uniformity of Distribution Properties of ESIGN. Electron. Notes Discret. Math. 6: 132-139 (2001) - [j28]Anna Bernasconi, Carsten Damm, Igor E. Shparlinski:
Circuit and Decision Tree Complexity of Some Number Theoretic Problems. Inf. Comput. 168(2): 113-124 (2001) - [j27]Eric Allender, Michael E. Saks, Igor E. Shparlinski:
A Lower Bound for Primality. J. Comput. Syst. Sci. 62(2): 356-366 (2001) - [j26]Igor E. Shparlinski:
On the uniformity of distribution of the RSA pairs. Math. Comput. 70(234): 801-808 (2001) - [j25]Harald Niederreiter, Igor E. Shparlinski:
On the distribution of inversive congruential pseudorandom numbers in parts of the period. Math. Comput. 70(236): 1569-1574 (2001) - [j24]John B. Friedlander, Igor E. Shparlinski:
On the distribution of the power generator. Math. Comput. 70(236): 1575-1589 (2001) - [j23]John B. Friedlander, Carl Pomerance, Igor E. Shparlinski:
Period of the power generator and small values of Carmichael's function. Math. Comput. 70(236): 1591-1605 (2001) - [j22]John B. Friedlander, Igor E. Shparlinski:
On the Distribution of Diffie-Hellman Triples with Sparse Exponents. SIAM J. Discret. Math. 14(2): 162-169 (2001) - 2000
- [j21]Harald Niederreiter, Igor E. Shparlinski:
On the Distribution of Pseudorandom Numbers and Vectors Generated by Inversive Methods. Appl. Algebra Eng. Commun. Comput. 10(3): 189-202 (2000) - [j20]Igor E. Shparlinski:
On the Naor-Reingold Pseudo-Random Function from Elliptic Curves. Appl. Algebra Eng. Commun. Comput. 11(1): 27-34 (2000) - [j19]Anna Bernasconi, Carsten Damm, Igor E. Shparlinski:
The average sensitivity of square-freeness. Comput. Complex. 9(1): 39-51 (2000) - [j18]Igor E. Shparlinski:
Linear complexity of the Naor-Reingold pseudo-random function. Inf. Process. Lett. 76(3): 95-99 (2000) - [j17]Igor E. Shparlinski:
Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications. J. Algorithms 36(2): 241-252 (2000) - [j16]Don Coppersmith, Igor E. Shparlinski:
On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping. J. Cryptol. 13(3): 339-360 (2000) - [j15]Joachim von zur Gathen, Igor E. Shparlinski:
The CREW PRAM Complexity of Modular Inversion. SIAM J. Comput. 29(6): 1839-1857 (2000) - [j14]Marek Karpinski, Alfred J. van der Poorten, Igor E. Shparlinski:
Zero testing of p-adic and modular polynomials. Theor. Comput. Sci. 233(1-2): 309-317 (2000) - [j13]Frances Griffin, Igor E. Shparlinski:
On the linear complexity profile of the power generator. IEEE Trans. Inf. Theory 46(6): 2159-2162 (2000) - 1999
- [j12]John B. Friedlander, Michael Larsen, Daniel Lieman, Igor E. Shparlinski:
On The Correlation of Binary Sequences. Des. Codes Cryptogr. 16(3): 249-256 (1999) - 1998
- [j11]Joachim von zur Gathen, Igor E. Shparlinski:
Orders of Gauss Periods in Finite Fields. Appl. Algebra Eng. Commun. Comput. 9(1): 15-24 (1998) - [j10]Joachim von zur Gathen, Igor E. Shparlinski:
Computing components and projections of curves over finite fields. SIAM J. Comput. 28(3): 822-840 (1998) - 1997
- [j9]Joachim von zur Gathen, Marek Karpinski, Igor E. Shparlinski:
Counting Curves and Their Projections. Comput. Complex. 6(1): 64-99 (1997) - 1996
- [j8]Igor E. Shparlinski:
On irreducible polynomials of small height over finite fields. Appl. Algebra Eng. Commun. Comput. 7(6): 427-431 (1996) - [j7]Marek Karpinski, Igor E. Shparlinski:
On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields. Theor. Comput. Sci. 157(2): 259-266 (1996) - [j6]Igor E. Shparlinski:
On Finding Primitive Roots in Finite Fields. Theor. Comput. Sci. 157(2): 273-275 (1996) - 1993
- [j5]Igor E. Shparlinski:
Finding Irreducible and Primitive Polynomials. Appl. Algebra Eng. Commun. Comput. 4: 263-268 (1993) - [j4]Igor E. Shparlinski:
On Parameters of Some Graphs from Finite Fields. Eur. J. Comb. 14(6): 589-591 (1993) - 1992
- [j3]Igor E. Shparlinski:
A Deterministic Test for Permutation Polynomials. Comput. Complex. 2: 129-132 (1992) - [j2]V. I. Galiev, A. F. Polupanov, Igor E. Shparlinski:
Distances from Differences of Roots of Polynomials to the Nearest Integers. Inf. Process. Lett. 43(3): 143-146 (1992) - 1991
- [j1]Igor E. Shparlinski:
On the Distribution of Values of Recurring Sequences and the Bell Numbers in Finite Fields. Eur. J. Comb. 12(1): 81-87 (1991)
Conference and Workshop Papers
- 2021
- [c64]Michael Kaminski, Igor E. Shparlinski:
Sets of Linear Forms Which Are Hard to Compute. MFCS 2021: 66:1-66:22 - 2016
- [c63]Andrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski:
Optimal Quantum Algorithm for Polynomial Interpolation. ICALP 2016: 16:1-16:13 - 2012
- [c62]Bernard Mans, Igor E. Shparlinski:
Random Walks and Bisections in Random Circulant Graphs. LATIN 2012: 542-555 - 2009
- [c61]John B. Friedlander, Igor E. Shparlinski:
Elliptic Twin Prime Conjecture. IWCC 2009: 77-81 - 2008
- [c60]Joachim von zur Gathen, Igor E. Shparlinski:
Approximate Polynomial gcd: Small Degree and Small Height Perturbations. LATIN 2008: 276-283 - [c59]Igor E. Shparlinski:
Pseudorandom Graphs from Elliptic Curves. LATIN 2008: 284-292 - [c58]Wim van Dam, Igor E. Shparlinski:
Classical and Quantum Algorithms for Exponential Congruences. TQC 2008: 1-10 - 2006
- [c57]Igor E. Shparlinski, Arne Winterhof:
Constructions of Approximately Mutually Unbiased Bases. LATIN 2006: 793-799 - [c56]Igor E. Shparlinski, Arne Winterhof:
On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences. SETA 2006: 295-303 - 2005
- [c55]Scott Contini, Igor E. Shparlinski:
On Stern's Attack Against Secret Truncated Linear Congruential Generators. ACISP 2005: 52-60 - [c54]Sean Hallgren, Alexander Russell, Igor E. Shparlinski:
Quantum Noisy Rational Function Reconstruction. COCOON 2005: 420-429 - 2004
- [c53]Steven D. Galbraith, Herbie J. Hopkins, Igor E. Shparlinski:
Secure Bilinear Diffie-Hellman Bits. ACISP 2004: 370-378 - [c52]Joachim von zur Gathen, Igor E. Shparlinski:
GCD of Random Linear Forms. ISAAC 2004: 464-469 - [c51]Gudmund Skovbjerg Frandsen, Igor E. Shparlinski:
On reducing a system of equations to a single equation. ISSAC 2004: 163-166 - [c50]Bernard Mans, Igor E. Shparlinski:
Bisecting and Gossiping in Circulant Graphs. LATIN 2004: 589-598 - [c49]María Isabel González Vasco, Mats Näslund, Igor E. Shparlinski:
New Results on the Hardness of Diffie-Hellman Bits. Public Key Cryptography 2004: 159-172 - [c48]Igor E. Shparlinski, Arne Winterhof:
A Nonuniform Algorithm for the Hidden Number Problem in Subgroups. Public Key Cryptography 2004: 416-424 - [c47]Joachim von zur Gathen, Igor E. Shparlinski:
Predicting Subset Sum Pseudorandom Generators. Selected Areas in Cryptography 2004: 241-251 - [c46]Joachim von zur Gathen, Igor E. Shparlinski:
Polynomial interpolation from multiples. SODA 2004: 1132-1137 - 2003
- [c45]Harald Niederreiter, Igor E. Shparlinski:
Dynamical Systems Generated by Rational Functions. AAECC 2003: 6-17 - [c44]Harald Niederreiter, Igor E. Shparlinski:
Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity. IMACC 2003: 183-189 - [c43]Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski:
Predicting the Inversive Generator. IMACC 2003: 264-275 - [c42]Joachim von zur Gathen, Amin Shokrollahi, Igor E. Shparlinski:
An authentication scheme based on roots of sparse polynomials. ITW 2003: 159-162 - [c41]Mats Näslund, Igor E. Shparlinski, William Whyte:
On the Bit Security of NTRUEncrypt. Public Key Cryptography 2003: 62-70 - [c40]Venkatesan Guruswami, Igor E. Shparlinski:
Unconditional proof of tightness of Johnson bound. SODA 2003: 754-755 - 2002
- [c39]Carl Pomerance, Igor E. Shparlinski:
Smooth Orders and Cryptographic Applications. ANTS 2002: 338-348 - [c38]Igor E. Shparlinski, Ron Steinfeld:
Chinese Remaindering for Algebraic Numbers in a Hidden Field. ANTS 2002: 349-356 - [c37]Wen-Ching W. Li, Mats Näslund, Igor E. Shparlinski:
Hidden Number Problem with the Trace and Bit Security of XTR and LUC. CRYPTO 2002: 433-448 - [c36]William D. Banks, Igor E. Shparlinski:
A Variant of NTRU with Non-invertible Polynomials. INDOCRYPT 2002: 62-70 - [c35]María Isabel González Vasco, Mats Näslund, Igor E. Shparlinski:
The Hidden Number Problem in Extension Fields and Its Applications. LATIN 2002: 105-117 - [c34]Arjen K. Lenstra, Igor E. Shparlinski:
Selective Forgery of RSA Signatures with Fixed-Pattern Padding. Public Key Cryptography 2002: 228-236 - 2001
- [c33]Igor E. Shparlinski:
On the Generalised Hidden Number Problem and Bit Security of XTR. AAECC 2001: 268-277 - [c32]Phong Q. Nguyen, Igor E. Shparlinski:
On the Insecurity of a Server-Aided RSA Protocol. ASIACRYPT 2001: 21-35 - [c31]Edwin El Mahassni, Phong Q. Nguyen, Igor E. Shparlinski:
The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces. CaLC 2001: 97-109 - [c30]Dan Boneh, Igor E. Shparlinski:
On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme. CRYPTO 2001: 201-212 - [c29]Erion Plaku, Igor E. Shparlinski:
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems. FSTTCS 2001: 305-316 - [c28]Arjen K. Lenstra, Igor E. Shparlinski:
On the Security of Lenstra's Variant of DSA without Long Inversions. Public Key Cryptography 2001: 64-72 - [c27]Edwin El Mahassni, Igor E. Shparlinski:
On the Uniformity of Distribution of Congruential Generators over Elliptic Curves. SETA 2001: 257-264 - [c26]Igor E. Shparlinski:
Sparse polynomial approximation in finite fields. STOC 2001: 209-215 - 2000
- [c25]William D. Banks, Daniel Lieman, Igor E. Shparlinski:
An Extremely Small and Efficient Identification Scheme. ACISP 2000: 378-384 - [c24]David R. Kohel, Igor E. Shparlinski:
On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields. ANTS 2000: 395-404 - [c23]John B. Friedlander, Jan S. dT. Hansen, Igor E. Shparlinski:
On the distribution of the power generator modulo a prime power. Unusual Applications of Number Theory 2000: 71-79 - [c22]William D. Banks, Daniel Lieman, Igor E. Shparlinski, Van Thuong To:
Cryptographic Applications of Sparse Polynomials over Finite Rings. ICISC 2000: 206-220 - [c21]Igor E. Shparlinski:
Communication Complexity and Fourier Coefficients of the Diffie-Hellman Key. LATIN 2000: 259-268 - [c20]William D. Banks, Daniel Lieman, Igor E. Shparlinski:
An Identification Scheme Based on Sparse Polynomials. Public Key Cryptography 2000: 68-74 - 1999
- [c19]Frances Griffin, Harald Niederreiter, Igor E. Shparlinski:
On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders. AAECC 1999: 87-93 - [c18]Joachim von zur Gathen, Igor E. Shparlinski:
Constructing Elements of Large Order in Finite Fields. AAECC 1999: 404-409 - [c17]Marek Karpinski, Igor E. Shparlinski:
On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials. AAECC 1999: 492-497 - [c16]Eric Allender, Michael E. Saks, Igor E. Shparlinski:
A Lower Bound for Primality. CCC 1999: 10-14 - [c15]Anna Bernasconi, Carsten Damm, Igor E. Shparlinski:
On the Average Sensitivity of Testing Square-Free Numbers. COCOON 1999: 291-299 - [c14]Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor E. Shparlinski:
On Routing in Circulant Graphs. COCOON 1999: 360-369 - [c13]Frances Griffin, Igor E. Shparlinski:
On the Linear Complexity of the Naor-Reingold Pseudo-Random Function. ICICS 1999: 301-308 - [c12]William D. Banks, Frances Griffin, Daniel Lieman, Igor E. Shparlinski:
Non-linear Complexity of the Naor-Reingold Pseudo-random Function. ICISC 1999: 53-59 - [c11]Anna Bernasconi, Igor E. Shparlinski:
Circuit Complexity of Testing Square-Free Numbers. STACS 1999: 47-56 - 1998
- [c10]Bernard Mans, Francesco Pappalardi, Igor E. Shparlinski:
On the Ádám Conjecture on Circulant Graphs. COCOON 1998: 251-260 - [c9]Joachim von zur Gathen, Igor E. Shparlinski:
The CREW PRAM Complexity of Modular Inversion. LATIN 1998: 305-315 - [c8]John B. Friedlander, Daniel Lieman, Igor E. Shparlinski:
On the Distribution of the RSA Generator. SETA 1998: 205-212 - 1995
- [c7]Joachim von zur Gathen, Igor E. Shparlinski:
Finding Points on Curves over Finite Fields (Extended Abstract). FOCS 1995: 284-292 - [c6]Joachim von zur Gathen, Igor E. Shparlinski:
Orders of Gauss Periods in Finite Fields. ISAAC 1995: 208-215 - 1994
- [c5]Igor E. Shparlinski:
On some applications of finitely generated semi-groups. ANTS 1994: 265-279 - [c4]Joachim von zur Gathen, Igor E. Shparlinski:
Components and Projections of Curves over Finite Fields. ISAAC 1994: 297-305 - 1993
- [c3]Joachim von zur Gathen, Marek Karpinski, Igor E. Shparlinski:
Counting curves and their projections. STOC 1993: 805-812 - 1991
- [c2]Igor E. Shparlinski:
On Gaussian Sums for Finite Fields and Elliptic Curves. Algebraic Coding 1991: 5-15 - 1987
- [c1]S. A. Stepanov, Igor E. Shparlinski:
On Structure Complexity of Normal Basis of Finite Field. FCT 1987: 414-416
Parts in Books or Collections
- 2014
- [p4]Jonas Kaszian, Pieter Moree, Igor E. Shparlinski:
Periodic structure of the exponential pseudorandom number generator. Applied Algebra and Number Theory 2014: 190-203 - 2013
- [p3]Igor E. Shparlinski:
Algebraic dynamical systems over finite fields. Handbook of Finite Fields 2013: 337-344 - [p2]Igor E. Shparlinski:
Additive Combinatorics over Finite Fields: New Results and Applications. Finite Fields and Their Applications 2013: 233-272 - 2009
- [p1]David Naccache, Igor E. Shparlinski:
Divisibility, Smoothness and Cryptographic Applications. Algebraic Aspects of Digital Communications 2009: 115-173
Editorship
- 2020
- [e3]Susanne C. Brenner, Igor E. Shparlinski, Chi-Wang Shu, Daniel B. Szyld:
75 Years of Mathematics of Computation. Contemporary Mathematics 754, American Mathematical Society 2020, ISBN 978-1-4704-5163-9 [contents] - 2013
- [e2]Jonathan M. Borwein, Igor E. Shparlinski, Wadim Zudilin:
Number Theory and Related Fields, In Memory of Alf van der Poorten. Springer 2013, ISBN 978-1-4614-6641-3 [contents] - 2001
- [e1]Serdar Boztas, Igor E. Shparlinski:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 14th International Symposium, AAECC-14, Melbourne, Australia November 26-30, 2001, Proceedings. Lecture Notes in Computer Science 2227, Springer 2001, ISBN 3-540-42911-5 [contents]
Reference Works
- 2011
- [r2]Igor E. Shparlinski:
Computational Diffie-Hellman Problem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 240-244 - 2005
- [r1]Igor E. Shparlinski:
Diffie-Hellman Problem. Encyclopedia of Cryptography and Security 2005
Informal and Other Publications
- 2023
- [i46]Riley Baird, Bryce Kerr, Igor E. Shparlinski:
Bohr sets generated by polynomials and Coppersmith's method in many variables. CoRR abs/2310.20342 (2023) - 2021
- [i45]Michael Kaminski, Igor E. Shparlinski, Michel Waldschmidt:
On sets of linear forms of maximal complexity. CoRR abs/2110.04657 (2021) - 2020
- [i44]Marek Karpinski, Igor E. Shparlinski:
Noisy polynomial interpolation modulo prime powers. CoRR abs/2006.05685 (2020) - 2019
- [i43]Andrzej Dabrowski, Jacek Pomykala, Igor E. Shparlinski:
On oracle factoring of integers. CoRR abs/1912.00345 (2019) - 2018
- [i42]Igor E. Shparlinski, Arne Winterhof:
Codes correcting restricted errors. CoRR abs/1811.03375 (2018) - 2017
- [i41]Domingo Gómez-Pérez, László Mérai, Igor E. Shparlinski:
On the Complexity of Exact Counting of Dynamically Irreducible Polynomials. CoRR abs/1706.04392 (2017) - [i40]Marek Karpinski, Igor E. Shparlinski:
Identity Testing from High Powers of Polynomials of Large Degree over Finite Fields. CoRR abs/1708.09095 (2017) - 2016
- [i39]Igor E. Shparlinski:
Dominating Sets in Circulant Graphs. CoRR abs/1602.01286 (2016) - 2015
- [i38]Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski:
Polynomial Interpolation and Identity Testing from High Powers over Finite Fields. CoRR abs/1502.06631 (2015) - [i37]Phong Q. Nguyen, Igor E. Shparlinski:
Counting Co-Cyclic Lattices. CoRR abs/1505.06429 (2015) - [i36]Andrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski:
Optimal quantum algorithm for polynomial interpolation. CoRR abs/1509.09271 (2015) - [i35]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: 1003 (2015) - 2014
- [i34]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 abs/1401.1331 (2014) - [i33]Joachim von zur Gathen, Igor E. Shparlinski:
Circulant graphs and GCD and LCM of Subsets. CoRR abs/1402.5449 (2014) - 2013
- [i32]Igor E. Shparlinski:
On the Product of Small Elkies Primes. CoRR abs/1301.0035 (2013) - [i31]Igor E. Shparlinski:
Evasive Properties of Sparse Graphs and Some Linear Equations in Primes. CoRR abs/1304.0188 (2013) - [i30]Sergei Konyagin, Florian Luca, Bernard Mans, Luke Mathieson, Igor E. Shparlinski:
Functional Graphs of Polynomials over Finite Fields. CoRR abs/1307.2718 (2013) - [i29]Jean Bourgain, Sergei Konyagin, Igor E. Shparlinski:
Character Sums and Deterministic Polynomial Root Finding in Finite Fields. CoRR abs/1308.4803 (2013) - [i28]Zhixiong Chen, Igor E. Shparlinski, Arne Winterhof:
Covering sets for limited-magnitude errors. CoRR abs/1310.0120 (2013) - [i27]Jonas Kaszian, Pieter Moree, Igor E. Shparlinski:
Periodic Structure of the Exponential Pseudorandom Number Generator. CoRR abs/1312.1311 (2013) - 2011
- [i26]Simon R. Blackburn, Alina Ostafe, Igor E. Shparlinski:
On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves. CoRR abs/1102.1053 (2011) - [i25]Jean Bourgain, Sergei Konyagin, Igor E. Shparlinski:
On the Hidden Shifted Power Problem. CoRR abs/1110.0812 (2011) - [i24]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: 67 (2011) - 2010
- [i23]Reza Rezaeian Farashahi, Igor E. Shparlinski:
Pseudorandom Bits From Points on Elliptic Curves. CoRR abs/1005.4771 (2010) - [i22]Reza Rezaeian Farashahi, Pierre-Alain Fouque, Igor E. Shparlinski, Mehdi Tibouchi, José Felipe Voloch:
Indifferentiable Deterministic Hashing to Elliptic and Hyperelliptic Curves. IACR Cryptol. ePrint Arch. 2010: 539 (2010) - [i21]Neal Koblitz, Alfred Menezes, Igor E. Shparlinski:
Discrete Logarithms, Diffie-Hellman, and Reductions. IACR Cryptol. ePrint Arch. 2010: 577 (2010) - 2008
- [i20]David Naccache, Igor E. Shparlinski:
Divisibility, Smoothness and Cryptographic Applications. CoRR abs/0810.2067 (2008) - [i19]David Naccache, Igor E. Shparlinski:
Divisibility, Smoothness and Cryptographic Applications. IACR Cryptol. ePrint Arch. 2008: 437 (2008) - 2006
- [i18]Igor E. Shparlinski:
Bounds on the Fourier Coefficients of the Weighted Sum Function. Complexity of Boolean Functions 2006 - 2005
- [i17]Florian Luca, Igor E. Shparlinski:
Elliptic Curves with Low Embedding Degree. IACR Cryptol. ePrint Arch. 2005: 363 (2005) - 2004
- [i16]Scott Contini, Ernie Croot, Igor E. Shparlinski:
Complexity of Inverting the Euler Function. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [i15]Igor E. Shparlinski, Arne Winterhof:
Hidden Number Problem in Small Subgroups. IACR Cryptol. ePrint Arch. 2003: 49 (2003) - 2002
- [i14]Bruno Codenotti, Igor E. Shparlinski:
Non-approximability of the Permanent of Structured Matrices over Finite Fields. Electron. Colloquium Comput. Complex. TR02 (2002) - [i13]Steven D. Galbraith, Herbie J. Hopkins, Igor E. Shparlinski:
Secure Bilinear Diffie-Hellman Bits. IACR Cryptol. ePrint Arch. 2002: 155 (2002) - 2000
- [i12]María Isabel González Vasco, Igor E. Shparlinski:
Security of the Most Significant Bits of the Shamir Message Passing Scheme. Electron. Colloquium Comput. Complex. TR00 (2000) - [i11]Igor E. Shparlinski:
Security of Polynomial Transformations of the Diffie--Hellma. Electron. Colloquium Comput. Complex. TR00 (2000) - [i10]María Isabel González Vasco, Igor E. Shparlinski:
On the Security of Diffie-Hellman Bits. Electron. Colloquium Comput. Complex. TR00 (2000) - [i9]María Isabel González Vasco, Igor E. Shparlinski:
On the Security of Diffie-Hellman Bits. IACR Cryptol. ePrint Arch. 2000: 20 (2000) - [i8]Igor E. Shparlinski:
Security of Polynomial Transformations of the Diffie-Hellman Key. IACR Cryptol. ePrint Arch. 2000: 23 (2000) - [i7]María Isabel González Vasco, Igor E. Shparlinski:
Security of the Most Significant Bits of the Shamir Message Passing Scheme. IACR Cryptol. ePrint Arch. 2000: 24 (2000) - 1999
- [i6]Eric Allender, Igor E. Shparlinski, Michael E. Saks:
A Lower Bound for Primality. Electron. Colloquium Comput. Complex. TR99 (1999) - [i5]Igor E. Shparlinski:
On the Uniformity of Distribution of a Certain Pseudo-Random Function. Electron. Colloquium Comput. Complex. TR99 (1999) - [i4]Marek Karpinski, Igor E. Shparlinski:
On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [i3]Igor E. Shparlinski:
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems. Electron. Colloquium Comput. Complex. TR98 (1998) - [i2]Anna Bernasconi, Igor E. Shparlinski:
Circuit Complexity of Testing Square-Free Numbers. Electron. Colloquium Comput. Complex. TR98 (1998) - [i1]Anna Bernasconi, Carsten Damm, Igor E. Shparlinski:
Circuit and Decision Tree Complexity of Some Number Theoretic Problems. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-21 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
