Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Igor Shparlinski
Igor E. Shparlinski
2010 – today
- 2013
[j119]Randell Heyman, Igor E. Shparlinski: On the number of Eisenstein polynomials of bounded height. Appl. Algebra Eng. Commun. Comput. 24(2): 149-156 (2013)- [j118]Jaime Gutierrez, Álvar Ibeas, Domingo Gomez-Perez, Igor E. Shparlinski: Predicting masked linear pseudorandom number generators over finite fields. Des. Codes Cryptography 67(3): 395-402 (2013)
- [j117]Igor Shparlinski, Arne Winterhof: Distribution of values of polynomial Fermat quotients. Finite Fields and Their Applications 19(1): 93-104 (2013)
- [j116]Igor E. Shparlinski: Correcting noisy exponentiation black-boxes modulo a prime. Inf. Process. Lett. 113(12): 414-417 (2013)
- [j115]Reza Rezaeian Farashahi, Pierre-Alain Fouque, Igor Shparlinski, Mehdi Tibouchi, José Felipe Voloch: Indifferentiable deterministic hashing to elliptic and hyperelliptic curves. Math. Comput. 82(281) (2013)
- [i27]
- [i26]Igor Shparlinski: Evasive Properties of Sparse Graphs and Some Linear Equations in Primes. CoRR abs/1304.0188 (2013)
- 2012
- [j114]Reza Rezaeian Farashahi, Igor E. Shparlinski: On Group Structures Realized by Elliptic Curves over a Fixed Finite Field. Experimental Mathematics 21(1): 1-10 (2012)
- [j113]William D. Banks, Francesco Pappalardi, Igor E. Shparlinski: On Group Structures Realized by Elliptic Curves over Arbitrary Finite Fields. Experimental Mathematics 21(1): 11-25 (2012)
- [j112]Alina Ostafe, Igor E. Shparlinski: On the power generator and its multivariate analogue. J. Complexity 28(2): 238-249 (2012)
- [j111]San Ling, Igor Shparlinski, Ron Steinfeld, Huaxiong Wang: On the modular inversion hidden number problem. J. Symb. Comput. 47(4): 358-367 (2012)
- [j110]Jorge Jiménez Urroz, Florian Luca, Igor Shparlinski: On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves. Math. Comput. 81(278) (2012)
- [j109]Alina Ostafe, Igor E. Shparlinski: Multiplicative character sums and products of sparse integers in residue classes. Periodica Mathematica Hungarica 64(2): 247-255 (2012)
- [j108]Jean Bourgain, Moubariz Z. Garaev, Sergei Konyagin, Igor E. Shparlinski: On the Hidden Shifted Power Problem. SIAM J. Comput. 41(6): 1524-1557 (2012)
- [j107]Reza Rezaeian Farashahi, Igor Shparlinski: Pseudorandom Bits From Points on Elliptic Curves. IEEE Transactions on Information Theory 58(2): 1242-1247 (2012)
- [c59]Bernard Mans, Igor Shparlinski: Random Walks and Bisections in Random Circulant Graphs. LATIN 2012: 542-555
- 2011
- [j106]Igor E. Shparlinski: On the average distribution of pseudorandom numbers generated by nonlinear permutations. Math. Comput. 80(274): 1053-1061 (2011)
- [j105]Alina Ostafe, Igor Shparlinski: Pseudorandomness and Dynamics of Fermat Quotients. SIAM J. Discrete Math. 25(1): 50-71 (2011)
- [r2]Igor Shparlinski: Computational Diffie-Hellman Problem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 240-244
- [i25]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)
- [i24]Jean Bourgain, Sergei Konyagin, Igor Shparlinski: On the Hidden Shifted Power Problem. CoRR abs/1110.0812 (2011)
- [i23]Simon R. Blackburn, Alina Ostafe, Igor E. Shparlinski: On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves. IACR Cryptology ePrint Archive 2011: 67 (2011)
- 2010
- [j104]Alina Ostafe, Igor Shparlinski: Pseudorandom numbers and hash functions from iterations of multivariate polynomials. Cryptography and Communications 2(1): 49-67 (2010)
- [j103]Reza Rezaeian Farashahi, Igor Shparlinski: On the number of distinct elliptic curves in some families. Des. Codes Cryptography 54(1): 83-99 (2010)
- [j102]Lev Glebsky, Igor Shparlinski: Short cycles in repeated exponentiation modulo a prime. Des. Codes Cryptography 56(1): 35-42 (2010)
- [j101]Alina Ostafe, Elena Pelican, Igor Shparlinski: On pseudorandom numbers from multivariate polynomial systems. Finite Fields and Their Applications 16(5): 320-328 (2010)
- [j100]Koray Karabina, Alfred Menezes, Carl Pomerance, Igor E. Shparlinski: On the asymptotic effectiveness of Weil descent attacks. J. Mathematical Cryptology 4(2): 175-191 (2010)
- [j99]Joachim von zur Gathen, Maurice Mignotte, Igor Shparlinski: Approximate polynomial GCD: Small degree and small height perturbations. J. Symb. Comput. 45(8): 879-886 (2010)
- [j98]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)
- [j97]Igor Shparlinski: On the Distribution of Orbits of PGL2(q) in Fqn and the Klapper Conjecture. SIAM J. Discrete Math. 23(4): 2093-2099 (2010)
- [i22]Reza Rezaeian Farashahi, Igor Shparlinski: Pseudorandom Bits From Points on Elliptic Curves. CoRR abs/1005.4771 (2010)
- [i21]Reza Rezaeian Farashahi, Pierre-Alain Fouque, Igor Shparlinski, Mehdi Tibouchi, José Felipe Voloch: Indifferentiable Deterministic Hashing to Elliptic and Hyperelliptic Curves. IACR Cryptology ePrint Archive 2010: 539 (2010)
- [i20]Neal Koblitz, Alfred Menezes, Igor Shparlinski: Discrete Logarithms, Diffie-Hellman, and Reductions. IACR Cryptology ePrint Archive 2010: 577 (2010)
2000 – 2009
- 2009
- [j96]Nicholas M. Katz, Igor Shparlinski, Maosheng Xiong: On character sums with distances on the upper half plane over a finite field. Finite Fields and Their Applications 15(6): 738-747 (2009)
- [j95]Alina Carmen Cojocaru, Igor Shparlinski: On the embedding degree of reductions of an elliptic curve. Inf. Process. Lett. 109(13): 652-654 (2009)
- [j94]Joachim von zur Gathen, Igor E. Shparlinski: Subset sum pseudorandom numbers: fast generation and distribution. J. Mathematical Cryptology 3(2): 149-163 (2009)
- [j93]John Friedlander, Igor E. Shparlinski: On the density of some special primes. J. Mathematical Cryptology 3(3): 265-271 (2009)
- [j92]Reza Rezaeian Farashahi, Igor E. Shparlinski, José Felipe Voloch: On hashing into elliptic curves. J. Mathematical Cryptology 3(4): 353-360 (2009)
- [j91]Igor Shparlinski: On the values of Kloosterman sums. IEEE Transactions on Information Theory 55(6): 2599-2601 (2009)
- [c58]
- [p1]David Naccache, Igor Shparlinski: Divisibility, Smoothness and Cryptographic Applications. Algebraic Aspects of Digital Communications 2009: 115-173
- 2008
- [j90]Sidney W. Graham, Igor Shparlinski: On RSA moduli with almost half of the bits prescribed. Discrete Applied Mathematics 156(16): 3150-3154 (2008)
- [j89]Mizan R. Khan, Igor E. Shparlinski, Christian L. Yankov: On the Convex Closure of the Graph of Modular Inversions. Experimental Mathematics 17(1): 91-104 (2008)
- [j88]Igor Shparlinski: Bilinear character sums over elliptic curves. Finite Fields and Their Applications 14(1): 132-141 (2008)
- [j87]Igor Shparlinski: On the elliptic curve analogue of the sum-product problem. Finite Fields and Their Applications 14(3): 721-726 (2008)
- [j86]Igor E. Shparlinski: Exponential sums and prime divisors of sparse integers. Periodica Mathematica Hungarica 57(1): 93-99 (2008)
- [c57]Joachim von zur Gathen, Igor Shparlinski: Approximate Polynomial gcd: Small Degree and Small Height Perturbations. LATIN 2008: 276-283
- [c56]
- [c55]Wim van Dam, Igor Shparlinski: Classical and Quantum Algorithms for Exponential Congruences. TQC 2008: 1-10
- [i19]David Naccache, Igor Shparlinski: Divisibility, Smoothness and Cryptographic Applications. CoRR abs/0810.2067 (2008)
- [i18]David Naccache, Igor Shparlinski: Divisibility, Smoothness and Cryptographic Applications. IACR Cryptology ePrint Archive 2008: 437 (2008)
- 2007
- [j85]Igor Shparlinski: Communication complexity of some number theoretic functions. Appl. Math. Lett. 20(8): 872-875 (2007)
- [j84]Simon R. Blackburn, Igor Shparlinski: Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131]. Discrete Mathematics 307(9-10): 1218-1219 (2007)
- [j83]Igor E. Shparlinski: Distribution of Roots of Polynomial Congruences. Int. J. Math. Mathematical Sciences 2007 (2007)
- [j82]Igor Shparlinski: Bounds on the Fourier coefficients of the weighted sum function. Inf. Process. Lett. 103(3): 83-87 (2007)
- [j81]Igor Shparlinski, Arne Winterhof: Quantum period reconstruction of approximate sequences. Inf. Process. Lett. 103(6): 211-215 (2007)
- [j80]Tanja Lange, Igor E. Shparlinski: Distribution of some sequences of points on elliptic curves. J. Mathematical Cryptology 1(1): 1-11 (2007)
- [j79]Ian F. Blake, Igor E. Shparlinski: Statistical distribution and collisions of VSH. J. Mathematical Cryptology 1(4): 329-349 (2007)
- [j78]Igor Shparlinski: A computational introduction to number theory and algebra. Math. Comput. 76(259): 1697-1698 (2007)
- [j77]Igor Shparlinski, Ron Steinfeld: Chinese Remaindering with Multiplicative Noise. Theory Comput. Syst. 40(1): 33-41 (2007)
- [j76]Sanka Balasuriya, Igor E. Shparlinski: Character sums with subsequence sums. Periodica Mathematica Hungarica 55(2): 215-221 (2007)
- 2006
- [j75]Ian F. Blake, Theodoulos Garefalakis, Igor Shparlinski: On the bit security of the Diffie-Hellman key. Appl. Algebra Eng. Commun. Comput. 16(6): 397-404 (2006)
- [j74]Joachim von zur Gathen, Igor Shparlinski: GCD of Random Linear Combinations. Algorithmica 46(1): 137-148 (2006)
- [j73]Igor Shparlinski, Arne Winterhof: On the nonlinearity of linear recurrence sequences. Appl. Math. Lett. 19(4): 340-344 (2006)
- [j72]Igor Shparlinski: On RSA Moduli with Prescribed Bit Patterns. Des. Codes Cryptography 39(1): 113-122 (2006)
- [j71]Simon R. Blackburn, Igor Shparlinski: Character sums and nonlinear recurrence sequences. Discrete Mathematics 306(12): 1126-1131 (2006)
- [j70]Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski: Exponential sums with Dickson polynomials. Finite Fields and Their Applications 12(1): 16-25 (2006)
- [j69]Igor E. Shparlinski: On the set of distances between two sets over finite fields. Int. J. Math. Mathematical Sciences 2006 (2006)
- [j68]Simon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski: Reconstructing noisy polynomial evaluation in residue rings. J. Algorithms 61(2): 47-59 (2006)
- [j67]Moubariz Z. Garaev, Florian Luca, Igor Shparlinski: Catalan and Apéry numbers in residue classes. J. Comb. Theory, Ser. A 113(5): 851-865 (2006)
- [j66]Don Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyen, Igor Shparlinski: Testing set proportionality and the Ádám isomorphism of circulant graphs. J. Discrete Algorithms 4(2): 324-335 (2006)
- [j65]Florian Luca, Igor Shparlinski: Elliptic Curves with Low Embedding Degree. J. Cryptology 19(4): 553-562 (2006)
- [j64]Scott Contini, Ernie Croot, Igor Shparlinski: Complexity of inverting the Euler function. Math. Comput. 75(254): 983-996 (2006)
- [j63]Moubariz Z. Garaev, Florian Luca, Igor Shparlinski, Arne Winterhof: On the Lower Bound of the Linear Complexity Over BBF_p of Sidelnikov Sequences. IEEE Transactions on Information Theory 52(7): 3299-3304 (2006)
- [c54]Igor Shparlinski: Bounds on the Fourier Coefficients of the Weighted Sum Function. Complexity of Boolean Functions 2006
- [c53]Igor Shparlinski, Arne Winterhof: Constructions of Approximately Mutually Unbiased Bases. LATIN 2006: 793-799
- [c52]Igor Shparlinski, Arne Winterhof: On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences. SETA 2006: 295-303
- 2005
- [j62]Tanja Lange, Igor 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)
- [j61]Igor Shparlinski, Arne Winterhof: Noisy interpolation of sparse polynomials in finite fields. Appl. Algebra Eng. Commun. Comput. 16(5): 307-317 (2005)
- [j60]Florian Hess, Igor Shparlinski: On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves. Des. Codes Cryptography 35(1): 111-117 (2005)
- [j59]Igor Shparlinski: On the singularity of generalised Vandermonde matrices over finite fields. Finite Fields and Their Applications 11(2): 193-199 (2005)
- [j58]Éric Levieil, Florian Luca, Igor Shparlinski: Prime divisors of some shifted products. Int. J. Math. Mathematical Sciences 2005(19): 3057-3073 (2005)
- [j57]Igor Shparlinski, Arne Winterhof: On the linear complexity of bounded integer sequences over different moduli. Inf. Process. Lett. 96(5): 175-177 (2005)
- [j56]Igor Shparlinski: Report on global methods for combinatorial isoperimetric problems. Math. Comput. 74(250) (2005)
- [j55]Simon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski: Predicting nonlinear pseudorandom number generators. Math. Comput. 74(251): 1471-1494 (2005)
- [j54]Igor Shparlinski, Arne Winterhof: A hidden number problem in small subgroups. Math. Comput. 74(252): 2073-2080 (2005)
- [j53]William D. Banks, Igor E. Shparlinski: Prime divisors of palindromes. Periodica Mathematica Hungarica 51(1): 1-10 (2005)
- [c51]Scott Contini, Igor Shparlinski: On Stern's Attack Against Secret Truncated Linear Congruential Generators. ACISP 2005: 52-60
- [c50]Sean Hallgren, Alexander Russell, Igor Shparlinski: Quantum Noisy Rational Function Reconstruction. COCOON 2005: 420-429
- [r1]
- [i17]Florian Luca, Igor Shparlinski: Elliptic Curves with Low Embedding Degree. IACR Cryptology ePrint Archive 2005: 363 (2005)
- 2004
- [j52]Igor Shparlinski: Security of polynomial transformations of the Diffie-Hellman key. Finite Fields and Their Applications 10(1): 123-131 (2004)
- [j51]Igor Shparlinski: On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA. Inf. Process. Lett. 92(3): 143-147 (2004)
- [j50]Alexander Russell, Igor Shparlinski: Classical and quantum function reconstruction via character evaluation. J. Complexity 20(2-3): 404-422 (2004)
- [j49]Igor Shparlinski, Ron Steinfeld: Noisy Chinese remaindering in the Lee norm. J. Complexity 20(2-3): 423-437 (2004)
- [j48]Alessandro Conflitti, Igor Shparlinski: On the multidimensional distribution of the subset sum generator of pseudorandom numbers. Math. Comput. 73(246): 1005-1011 (2004)
- [j47]William D. Banks, Alessandro Conflitti, Igor Shparlinski: Number Theoretic Designs for Directed Regular Graphs of Small Diameter. SIAM J. Discrete Math. 17(3): 377-383 (2004)
- [j46]Mark Goresky, Andrew Klapper, Ram Murty, Igor Shparlinski: On Decimations of l-Sequences. SIAM J. Discrete Math. 18(1): 130-140 (2004)
- [c49]Steven D. Galbraith, Herbie J. Hopkins, Igor Shparlinski: Secure Bilinear Diffie-Hellman Bits. ACISP 2004: 370-378
- [c48]
- [c47]Gudmund Skovbjerg Frandsen, Igor Shparlinski: On reducing a system of equations to a single equation. ISSAC 2004: 163-166
- [c46]
- [c45]Maria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski: New Results on the Hardness of Diffie-Hellman Bits. Public Key Cryptography 2004: 159-172
- [c44]Igor Shparlinski, Arne Winterhof: A Nonuniform Algorithm for the Hidden Number Problem in Subgroups. Public Key Cryptography 2004: 416-424
- [c43]Joachim von zur Gathen, Igor Shparlinski: Predicting Subset Sum Pseudorandom Generators. Selected Areas in Cryptography 2004: 241-251
- [c42]Joachim von zur Gathen, Igor Shparlinski: Polynomial interpolation from multiples. SODA 2004: 1132-1137
- [i16]Scott Contini, Ernie Croot, Igor Shparlinski: Complexity of Inverting the Euler Function. Electronic Colloquium on Computational Complexity (ECCC)(035) (2004)
- 2003
- [j45]Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski: Complexity of some arithmetic problems for binary polynomials. Computational Complexity 12(1-2): 23-47 (2003)
- [j44]Sergei Konyagin, Tanja Lange, Igor Shparlinski: Linear Complexity of the Discrete Logarithm. Des. Codes Cryptography 28(2): 135-146 (2003)
- [j43]Phong Q. Nguyen, Igor Shparlinski: The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces. Des. Codes Cryptography 30(2): 201-217 (2003)
- [j42]Nick Howgrave-Graham, Phong Q. Nguyen, Igor Shparlinski: Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation. Math. Comput. 72(243): 1473-1485 (2003)
- [j41]Igor E. Shparlinski: Prime divisors of sparse integers. Periodica Mathematica Hungarica 46(2): 215-222 (2003)
- [j40]Mizan R. Khan, Igor E. Shparlinski: On the maximal difference between an element and its inverse modulo n. Periodica Mathematica Hungarica 47(1-2): 111-117 (2003)
- [j39]Joachim von zur Gathen, Igor Shparlinski, Alistair Sinclair: Finding Points on Curves over Finite Fields. SIAM J. Comput. 32(6): 1436-1448 (2003)
- [j38]Jaime Gutierrez, Igor Shparlinski, Arne Winterhof: On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators. IEEE Transactions on Information Theory 49(1): 60-64 (2003)
- [c41]Harald Niederreiter, Igor Shparlinski: Dynamical Systems Generated by Rational Functions. AAECC 2003: 6-17
- [c40]Harald Niederreiter, Igor Shparlinski: Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity. IMA Int. Conf. 2003: 183-189
- [c39]Simon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski: Predicting the Inversive Generator. IMA Int. Conf. 2003: 264-275
- [c38]Mats Näslund, Igor Shparlinski, William Whyte: On the Bit Security of NTRUEncrypt. Public Key Cryptography 2003: 62-70
- [c37]Venkatesan Guruswami, Igor Shparlinski: Unconditional proof of tightness of Johnson bound. SODA 2003: 754-755
- [i15]Igor Shparlinski, Arne Winterhof: Hidden Number Problem in Small Subgroups. IACR Cryptology ePrint Archive 2003: 49 (2003)
- 2002
- [j37]Igor Shparlinski: On the Uniformity of Distribution of the ElGamal Signature. Appl. Algebra Eng. Commun. Comput. 13(1): 9-16 (2002)
- [j36]Bruno Codenotti, Igor Shparlinski, Arne Winterhof: On the hardness of approximating the permanent of structured matrices. Computational Complexity 11(3-4): 158-170 (2002)
- [j35]Bernard Mans, Francesco Pappalardi, Igor Shparlinski: On the spectral Ádám property for circulant graphs. Discrete Mathematics 254(1-3): 309-329 (2002)
- [j34]Igor Shparlinski: Security of most significant bits of gx2. Inf. Process. Lett. 83(2): 109-113 (2002)
- [j33]Phong Q. Nguyen, Igor Shparlinski: The Insecurity of the Digital Signature Algorithm with Partially Known Nonces. J. Cryptology 15(3): 151-176 (2002)
- [j32]Maria Isabel Gonzalez Vasco, Igor Shparlinski: Security of the most significant bits of the Shamir message passing scheme. Math. Comput. 71(237): 333-342 (2002)
- [c36]
- [c35]Igor Shparlinski, Ron Steinfeld: Chinese Remaindering for Algebraic Numbers in a Hidden Field. ANTS 2002: 349-356
- [c34]Wen-Ching W. Li, Mats Näslund, Igor Shparlinski: Hidden Number Problem with the Trace and Bit Security of XTR and LUC. CRYPTO 2002: 433-448
- [c33]William D. Banks, Igor Shparlinski: A Variant of NTRU with Non-invertible Polynomials. INDOCRYPT 2002: 62-70
- [c32]Maria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski: The Hidden Number Problem in Extension Fields and Its Applications. LATIN 2002: 105-117
- [c31]Arjen K. Lenstra, Igor Shparlinski: Selective Forgery of RSA Signatures with Fixed-Pattern Padding. Public Key Cryptography 2002: 228-236
- [i14]Bruno Codenotti, Igor Shparlinski: Non-approximability of the Permanent of Structured Matrices over Finite Fields. Electronic Colloquium on Computational Complexity (ECCC)(071) (2002)
- [i13]Steven D. Galbraith, Herbie J. Hopkins, Igor Shparlinski: Secure Bilinear Diffie-Hellman Bits. IACR Cryptology ePrint Archive 2002: 155 (2002)
- 2001
- [j31]Igor Shparlinski: On the Linear Complexity of the Power Generator. Des. Codes Cryptography 23(1): 5-10 (2001)
- [j30]Igor Shparlinski: On Some Properties of the Shrinking Generator. Des. Codes Cryptography 23(2): 147-156 (2001)
- [j29]Igor Shparlinski, Joseph H. Silverman: On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves. Des. Codes Cryptography 24(3): 279-289 (2001)
- [j28]Edwin El Mahassni, Igor Shparlinski: On Some Uniformity of Distribution Properties of ESIGN. Electronic Notes in Discrete Mathematics 6: 132-139 (2001)
- [j27]Anna Bernasconi, Carsten Damm, Igor Shparlinski: Circuit and Decision Tree Complexity of Some Number Theoretic Problems. Inf. Comput. 168(2): 113-124 (2001)
- [j26]Eric Allender, Michael E. Saks, Igor Shparlinski: A Lower Bound for Primality. J. Comput. Syst. Sci. 62(2): 356-366 (2001)
- [j25]Igor Shparlinski: On the uniformity of distribution of the RSA pairs. Math. Comput. 70(234): 801-808 (2001)
- [j24]Harald Niederreiter, Igor Shparlinski: On the distribution of inversive congruential pseudorandom numbers in parts of the period. Math. Comput. 70(236): 1569-1574 (2001)
- [j23]John Friedlander, Igor Shparlinski: On the distribution of the power generator. Math. Comput. 70(236): 1575-1589 (2001)
- [j22]John Friedlander, Carl Pomerance, Igor Shparlinski: Period of the power generator and small values of Carmichael's function. Math. Comput. 70(236): 1591-1605 (2001)
- [j21]John Friedlander, Igor Shparlinski: On the Distribution of Diffie-Hellman Triples with Sparse Exponents. SIAM J. Discrete Math. 14(2): 162-169 (2001)
- [c30]Igor Shparlinski: On the Generalised Hidden Number Problem and Bit Security of XTR. AAECC 2001: 268-277
- [c29]Phong Q. Nguyen, Igor Shparlinski: On the Insecurity of a Server-Aided RSA Protocol. ASIACRYPT 2001: 21-35
- [c28]Edwin El Mahassni, Phong Q. Nguyen, Igor Shparlinski: The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces. CaLC 2001: 97-109
- [c27]Dan Boneh, Igor Shparlinski: On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme. CRYPTO 2001: 201-212
- [c26]Erion Plaku, Igor Shparlinski: On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems. FSTTCS 2001: 305-316
- [c25]Arjen K. Lenstra, Igor Shparlinski: On the Security of Lenstra's Variant of DSA without Long Inversions. Public Key Cryptography 2001: 64-72
- [c24]
- [e1]Serdar Boztas, Igor Shparlinski (Eds.): 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
- 2000
- [j20]Harald Niederreiter, Igor Shparlinski: On the Distribution of Pseudorandom Numbers and Vectors Generated by Inversive Methods. Appl. Algebra Eng. Commun. Comput. 10(3): 189-202 (2000)
- [j19]Igor Shparlinski: On the Naor-Reingold Pseudo-Random Function from Elliptic Curves. Appl. Algebra Eng. Commun. Comput. 11(1): 27-34 (2000)
- [j18]Anna Bernasconi, Carsten Damm, Igor Shparlinski: The average sensitivity of square-freeness. Computational Complexity 9(1): 39-51 (2000)
- [j17]Igor Shparlinski: Linear complexity of the Naor-Reingold pseudo-random function. Inf. Process. Lett. 76(3): 95-99 (2000)
- [j16]Igor Shparlinski: Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications. J. Algorithms 36(2): 241-252 (2000)
- [j15]Don Coppersmith, Igor Shparlinski: On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping. J. Cryptology 13(3): 339-360 (2000)
- [j14]Joachim von zur Gathen, Igor Shparlinski: The CREW PRAM Complexity of Modular Inversion. SIAM J. Comput. 29(6): 1839-1857 (2000)
- [j13]Marek Karpinski, Alfred J. van der Poorten, Igor Shparlinski: Zero testing of p-adic and modular polynomials. Theor. Comput. Sci. 233(1-2): 309-317 (2000)
- [j12]Frances Griffin, Igor Shparlinski: On the linear complexity profile of the power generator. IEEE Transactions on Information Theory 46(6): 2159-2162 (2000)
- [c23]William D. Banks, Daniel Lieman, Igor Shparlinski: An Extremely Small and Efficient Identification Scheme. ACISP 2000: 378-384
- [c22]David R. Kohel, Igor Shparlinski: On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields. ANTS 2000: 395-404
- [c21]William D. Banks, Daniel Lieman, Igor Shparlinski, Van Thuong To: Cryptographic Applications of Sparse Polynomials over Finite Rings. ICISC 2000: 206-220
- [c20]Igor Shparlinski: Communication Complexity and Fourier Coefficients of the Diffie-Hellman Key. LATIN 2000: 259-268
- [c19]William D. Banks, Daniel Lieman, Igor Shparlinski: An Identification Scheme Based on Sparse Polynomials. Public Key Cryptography 2000: 68-74
- [i12]Maria Isabel Gonzalez Vasco, Igor Shparlinski: Security of the Most Significant Bits of the Shamir Message Passing Scheme. Electronic Colloquium on Computational Complexity (ECCC) 7(40) (2000)
- [i11]Igor Shparlinski: Security of Polynomial Transformations of the Diffie--Hellma. Electronic Colloquium on Computational Complexity (ECCC) 7(41) (2000)
- [i10]Maria Isabel Gonzalez Vasco, Igor Shparlinski: On the Security of Diffie-Hellman Bits. Electronic Colloquium on Computational Complexity (ECCC) 7(45) (2000)
- [i9]Maria Isabel Gonzalez Vasco, Igor Shparlinski: On the Security of Diffie-Hellman Bits. IACR Cryptology ePrint Archive 2000: 20 (2000)
- [i8]Igor Shparlinski: Security of Polynomial Transformations of the Diffie-Hellman Key. IACR Cryptology ePrint Archive 2000: 23 (2000)
- [i7]Maria Isabel Gonzalez Vasco, Igor E. Shparlinski: Security of the Most Significant Bits of the Shamir Message Passing Scheme. IACR Cryptology ePrint Archive 2000: 24 (2000)
1990 – 1999
- 1999
- [j11]John Friedlander, Michael Larsen, Daniel Lieman, Igor Shparlinski: On The Correlation of Binary Sequences. Des. Codes Cryptography 16(3): 249-256 (1999)
- [c18]Frances Griffin, Harald Niederreiter, Igor Shparlinski: On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders. AAECC 1999: 87-93
- [c17]Joachim von zur Gathen, Igor Shparlinski: Constructing Elements of Large Order in Finite Fields. AAECC 1999: 404-409
- [c16]Marek Karpinski, Igor Shparlinski: On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials. AAECC 1999: 492-497
- [c15]Eric Allender, Michael E. Saks, Igor Shparlinski: A Lower Bound for Primality. IEEE Conference on Computational Complexity 1999: 10-14
- [c14]Anna Bernasconi, Carsten Damm, Igor Shparlinski: On the Average Sensitivity of Testing Square-Free Numbers. COCOON 1999: 291-299
- [c13]Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor Shparlinski: On Routing in Circulant Graphs. COCOON 1999: 360-369
- [c12]Frances Griffin, Igor Shparlinski: On the Linear Complexity of the Naor-Reingold Pseudo-Random Function. ICICS 1999: 301-308
- [c11]William D. Banks, Frances Griffin, Daniel Lieman, Igor Shparlinski: Non-linear Complexity of the Naor-Reingold Pseudo-random Function. ICISC 1999: 53-59
- [c10]Anna Bernasconi, Igor Shparlinski: Circuit Complexity of Testing Square-Free Numbers. STACS 1999: 47-56
- [i6]Eric Allender, Igor Shparlinski, Michael E. Saks: A Lower Bound for Primality. Electronic Colloquium on Computational Complexity (ECCC) 6(10) (1999)
- [i5]Igor Shparlinski: On the Uniformity of Distribution of a Certain Pseudo-Random Function. Electronic Colloquium on Computational Complexity (ECCC) 6(21) (1999)
- [i4]Marek Karpinski, Igor Shparlinski: On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 6(27) (1999)
- 1998
- [j10]Joachim von zur Gathen, Igor Shparlinski: Orders of Gauss Periods in Finite Fields. Appl. Algebra Eng. Commun. Comput. 9(1): 15-24 (1998)
- [j9]Joachim von zur Gathen, Igor Shparlinski: Computing components and projections of curves over finite fields. SIAM J. Comput. 28(3): 822-840 (1998)
- [c9]Bernard Mans, Francesco Pappalardi, Igor Shparlinski: On the Ádám Conjecture on Circulant Graphs. COCOON 1998: 251-260
- [c8]Joachim von zur Gathen, Igor Shparlinski: The CREW PRAM Complexity of Modular Inversion. LATIN 1998: 305-315
- [i3]Igor Shparlinski: On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems. Electronic Colloquium on Computational Complexity (ECCC) 5(54) (1998)
- [i2]Anna Bernasconi, Igor Shparlinski: Circuit Complexity of Testing Square-Free Numbers. Electronic Colloquium on Computational Complexity (ECCC) 5(56) (1998)
- [i1]Anna Bernasconi, Carsten Damm, Igor Shparlinski: Circuit and Decision Tree Complexity of Some Number Theoretic Problems. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-21 (1998)
- 1997
- [j8]Joachim von zur Gathen, Marek Karpinski, Igor Shparlinski: Counting Curves and Their Projections. Computational Complexity 6(1): 64-99 (1997)
- 1996
- [j7]Igor Shparlinski: On irreducible polynomials of small height over finite fields. Appl. Algebra Eng. Commun. Comput. 7(6): 427-431 (1996)
- [j6]Marek Karpinski, Igor Shparlinski: On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields. Theor. Comput. Sci. 157(2): 259-266 (1996)
- [j5]Igor Shparlinski: On Finding Primitive Roots in Finite Fields. Theor. Comput. Sci. 157(2): 273-275 (1996)
- 1995
- [c7]Joachim von zur Gathen, Igor Shparlinski: Finding Points on Curves over Finite Fields (Extended Abstract). FOCS 1995: 284-292
- [c6]Joachim von zur Gathen, Igor Shparlinski: Orders of Gauss Periods in Finite Fields. ISAAC 1995: 208-215
- 1994
- [c5]
- [c4]Joachim von zur Gathen, Igor Shparlinski: Components and Projections of Curves over Finite Fields. ISAAC 1994: 297-305
- 1993
- [j4]Igor Shparlinski: Finding Irreducible and Primitive Polynomials. Appl. Algebra Eng. Commun. Comput. 4: 263-268 (1993)
- [j3]Igor Shparlinski: On Parameters of Some Graphs from Finite Fields. Eur. J. Comb. 14(6): 589-591 (1993)
- [c3]Joachim von zur Gathen, Marek Karpinski, Igor Shparlinski: Counting curves and their projections. STOC 1993: 805-812
- 1992
- [j2]Igor Shparlinski: A Deterministic Test for Permutation Polynomials. Computational Complexity 2: 129-132 (1992)
- [j1]V. I. Galiev, A. F. Polupanov, Igor Shparlinski: Distances from Differences of Roots of Polynomials to the Nearest Integers. Inf. Process. Lett. 43(3): 143-146 (1992)
- 1991
- [c2]Igor Shparlinski: On Gaussian Sums for Finite Fields and Elliptic Curves. Algebraic Coding 1991: 5-15
1980 – 1989
- 1987
- [c1]S. A. Stepanov, Igor Shparlinski: On Structure Complexity of Normal Basis of Finite Field. FCT 1987: 414-416
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 21:33 CEST by the dblp team