Igor Shparlinski

	2012
178		Bernard Mans, Igor Shparlinski: Random Walks and Bisections in Random Circulant Graphs. LATIN 2012: 542-555
177		Reza Rezaeian Farashahi, Igor Shparlinski: Pseudorandom Bits From Points on Elliptic Curves. IEEE Transactions on Information Theory 58(2): 1242-1247 (2012)
176		San Ling, Igor Shparlinski, Ron Steinfeld, Huaxiong Wang: On the modular inversion hidden number problem. J. Symb. Comput. 47(4): 358-367 (2012)
175		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)
	2011
174		Igor Shparlinski: Computational Diffie-Hellman Problem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 240-244
173		Jean Bourgain, Sergei Konyagin, Igor Shparlinski: On the Hidden Shifted Power Problem CoRR abs/1110.0812: (2011)
172		Alina Ostafe, Igor Shparlinski: Pseudorandomness and Dynamics of Fermat Quotients. SIAM J. Discrete Math. 25(1): 50-71 (2011)
	2010
171		Reza Rezaeian Farashahi, Igor Shparlinski: Pseudorandom Bits From Points on Elliptic Curves CoRR abs/1005.4771: (2010)
170		Alina Ostafe, Igor Shparlinski: Pseudorandom numbers and hash functions from iterations of multivariate polynomials. Cryptography and Communications 2(1): 49-67 (2010)
169		Reza Rezaeian Farashahi, Igor Shparlinski: On the number of distinct elliptic curves in some families. Des. Codes Cryptography 54(1): 83-99 (2010)
168		Lev Glebsky, Igor Shparlinski: Short cycles in repeated exponentiation modulo a prime. Des. Codes Cryptography 56(1): 35-42 (2010)
167		Alina Ostafe, Elena Pelican, Igor Shparlinski: On pseudorandom numbers from multivariate polynomial systems. Finite Fields and Their Applications 16(5): 320-328 (2010)
166		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)
165		Neal Koblitz, Alfred Menezes, Igor Shparlinski: Discrete Logarithms, Diffie-Hellman, and Reductions. IACR Cryptology ePrint Archive 2010: 577 (2010)
164		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)
163		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)
	2009
162		John Friedlander, Igor Shparlinski: Elliptic Twin Prime Conjecture. IWCC 2009: 77-81
161		David Naccache, Igor Shparlinski: Divisibility, Smoothness and Cryptographic Applications. Algebraic Aspects of Digital Communications 2009: 115-173
160		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)
159		Igor Shparlinski: On the values of Kloosterman sums. IEEE Transactions on Information Theory 55(6): 2599-2601 (2009)
158		Alina Carmen Cojocaru, Igor Shparlinski: On the embedding degree of reductions of an elliptic curve. Inf. Process. Lett. 109(13): 652-654 (2009)
	2008
157		Joachim von zur Gathen, Igor Shparlinski: Approximate Polynomial gcd: Small Degree and Small Height Perturbations. LATIN 2008: 276-283
156		Igor Shparlinski: Pseudorandom Graphs from Elliptic Curves. LATIN 2008: 284-292
155		Wim van Dam, Igor Shparlinski: Classical and Quantum Algorithms for Exponential Congruences. TQC 2008: 1-10
154		David Naccache, Igor Shparlinski: Divisibility, Smoothness and Cryptographic Applications CoRR abs/0810.2067: (2008)
153		Sidney W. Graham, Igor Shparlinski: On RSA moduli with almost half of the bits prescribed. Discrete Applied Mathematics 156(16): 3150-3154 (2008)
152		Igor Shparlinski: Bilinear character sums over elliptic curves. Finite Fields and Their Applications 14(1): 132-141 (2008)
151		Igor Shparlinski: On the elliptic curve analogue of the sum-product problem. Finite Fields and Their Applications 14(3): 721-726 (2008)
150		David Naccache, Igor Shparlinski: Divisibility, Smoothness and Cryptographic Applications. IACR Cryptology ePrint Archive 2008: 437 (2008)
	2007
149		Igor Shparlinski: Communication complexity of some number theoretic functions. Appl. Math. Lett. 20(8): 872-875 (2007)
148		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)
147		Igor Shparlinski: Bounds on the Fourier coefficients of the weighted sum function. Inf. Process. Lett. 103(3): 83-87 (2007)
146		Igor Shparlinski, Arne Winterhof: Quantum period reconstruction of approximate sequences. Inf. Process. Lett. 103(6): 211-215 (2007)
145		Igor Shparlinski: A computational introduction to number theory and algebra. Math. Comput. 76(259): 1697-1698 (2007)
144		Igor Shparlinski, Ron Steinfeld: Chinese Remaindering with Multiplicative Noise. Theory Comput. Syst. 40(1): 33-41 (2007)
	2006
143		Igor Shparlinski: Bounds on the Fourier Coefficients of the Weighted Sum Function. Complexity of Boolean Functions 2006
142		Igor Shparlinski, Arne Winterhof: Constructions of Approximately Mutually Unbiased Bases. LATIN 2006: 793-799
141		Igor Shparlinski, Arne Winterhof: On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences. SETA 2006: 295-303
140		Joachim von zur Gathen, Igor Shparlinski: GCD of Random Linear Combinations. Algorithmica 46(1): 137-148 (2006)
139		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)
138		Igor Shparlinski, Arne Winterhof: On the nonlinearity of linear recurrence sequences. Appl. Math. Lett. 19(4): 340-344 (2006)
137		Igor Shparlinski: On RSA Moduli with Prescribed Bit Patterns. Des. Codes Cryptography 39(1): 113-122 (2006)
136		Simon R. Blackburn, Igor Shparlinski: Character sums and nonlinear recurrence sequences. Discrete Mathematics 306(12): 1126-1131 (2006)
135		Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski: Exponential sums with Dickson polynomials. Finite Fields and Their Applications 12(1): 16-25 (2006)
134		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)
133		Simon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski: Reconstructing noisy polynomial evaluation in residue rings. J. Algorithms 61(2): 47-59 (2006)
132		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)
131		Florian Luca, Igor Shparlinski: Elliptic Curves with Low Embedding Degree. J. Cryptology 19(4): 553-562 (2006)
130		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)
129		Scott Contini, Ernie Croot, Igor Shparlinski: Complexity of inverting the Euler function. Math. Comput. 75(254): 983-996 (2006)
	2005
128		Scott Contini, Igor Shparlinski: On Stern's Attack Against Secret Truncated Linear Congruential Generators. ACISP 2005: 52-60
127		Sean Hallgren, Alexander Russell, Igor Shparlinski: Quantum Noisy Rational Function Reconstruction. COCOON 2005: 420-429
126		Igor Shparlinski: Diffie-Hellman Problem. Encyclopedia of Cryptography and Security 2005
125		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)
124		Igor Shparlinski, Arne Winterhof: Noisy interpolation of sparse polynomials in finite fields. Appl. Algebra Eng. Commun. Comput. 16(5): 307-317 (2005)
123		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)
122		Igor Shparlinski: On the singularity of generalised Vandermonde matrices over finite fields. Finite Fields and Their Applications 11(2): 193-199 (2005)
121		Florian Luca, Igor Shparlinski: Elliptic Curves with Low Embedding Degree. IACR Cryptology ePrint Archive 2005: 363 (2005)
120		Igor Shparlinski, Arne Winterhof: On the linear complexity of bounded integer sequences over different moduli. Inf. Process. Lett. 96(5): 175-177 (2005)
119		Éric Levieil, Florian Luca, Igor Shparlinski: Prime divisors of some shifted products. Int. J. Math. Mathematical Sciences 2005(19): 3057-3073 (2005)
118		Igor Shparlinski: Report on global methods for combinatorial isoperimetric problems. Math. Comput. 74(250): (2005)
117		Simon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski: Predicting nonlinear pseudorandom number generators. Math. Comput. 74(251): 1471-1494 (2005)
116		Igor Shparlinski, Arne Winterhof: A hidden number problem in small subgroups. Math. Comput. 74(252): 2073-2080 (2005)
	2004
115		Steven D. Galbraith, Herbie J. Hopkins, Igor Shparlinski: Secure Bilinear Diffie-Hellman Bits. ACISP 2004: 370-378
114		Joachim von zur Gathen, Igor Shparlinski: GCD of Random Linear Forms. ISAAC 2004: 464-469
113		Gudmund Skovbjerg Frandsen, Igor Shparlinski: On reducing a system of equations to a single equation. ISSAC 2004: 163-166
112		Bernard Mans, Igor Shparlinski: Bisecting and Gossiping in Circulant Graphs. LATIN 2004: 589-598
111		Maria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski: New Results on the Hardness of Diffie-Hellman Bits. Public Key Cryptography 2004: 159-172
110		Igor Shparlinski, Arne Winterhof: A Nonuniform Algorithm for the Hidden Number Problem in Subgroups. Public Key Cryptography 2004: 416-424
109		Joachim von zur Gathen, Igor Shparlinski: Polynomial interpolation from multiples. SODA 2004: 1132-1137
108		Joachim von zur Gathen, Igor Shparlinski: Predicting Subset Sum Pseudorandom Generators. Selected Areas in Cryptography 2004: 241-251
107		Scott Contini, Ernie Croot, Igor Shparlinski: Complexity of Inverting the Euler Function Electronic Colloquium on Computational Complexity (ECCC)(035): (2004)
106		Igor Shparlinski: Security of polynomial transformations of the Diffie-Hellman key. Finite Fields and Their Applications 10(1): 123-131 (2004)
105		Igor Shparlinski: On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA. Inf. Process. Lett. 92(3): 143-147 (2004)
104		Alexander Russell, Igor Shparlinski: Classical and quantum function reconstruction via character evaluation. J. Complexity 20(2-3): 404-422 (2004)
103		Igor Shparlinski, Ron Steinfeld: Noisy Chinese remaindering in the Lee norm. J. Complexity 20(2-3): 423-437 (2004)
102		Alessandro Conflitti, Igor Shparlinski: On the multidimensional distribution of the subset sum generator of pseudorandom numbers. Math. Comput. 73(246): 1005-1011 (2004)
101		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)
100		Mark Goresky, Andrew Klapper, Ram Murty, Igor Shparlinski: On Decimations of l-Sequences. SIAM J. Discrete Math. 18(1): 130-140 (2004)
	2003
99		Harald Niederreiter, Igor Shparlinski: Dynamical Systems Generated by Rational Functions. AAECC 2003: 6-17
98		Harald Niederreiter, Igor Shparlinski: Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity. IMA Int. Conf. 2003: 183-189
97		Simon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski: Predicting the Inversive Generator. IMA Int. Conf. 2003: 264-275
96		Mats Näslund, Igor Shparlinski, William Whyte: On the Bit Security of NTRUEncrypt. Public Key Cryptography 2003: 62-70
95		Venkatesan Guruswami, Igor Shparlinski: Unconditional proof of tightness of Johnson bound. SODA 2003: 754-755
94		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)
93		Sergei Konyagin, Tanja Lange, Igor Shparlinski: Linear Complexity of the Discrete Logarithm. Des. Codes Cryptography 28(2): 135-146 (2003)
92		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)
91		Igor Shparlinski, Arne Winterhof: Hidden Number Problem in Small Subgroups. IACR Cryptology ePrint Archive 2003: 49 (2003)
90		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)
89		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)
88		Joachim von zur Gathen, Igor Shparlinski, Alistair Sinclair: Finding Points on Curves over Finite Fields. SIAM J. Comput. 32(6): 1436-1448 (2003)
	2002
87		Carl Pomerance, Igor Shparlinski: Smooth Orders and Cryptographic Applications. ANTS 2002: 338-348
86		Igor Shparlinski, Ron Steinfeld: Chinese Remaindering for Algebraic Numbers in a Hidden Field. ANTS 2002: 349-356
85		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
84		William D. Banks, Igor Shparlinski: A Variant of NTRU with Non-invertible Polynomials. INDOCRYPT 2002: 62-70
83		Maria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski: The Hidden Number Problem in Extension Fields and Its Applications. LATIN 2002: 105-117
82		Arjen K. Lenstra, Igor Shparlinski: Selective Forgery of RSA Signatures with Fixed-Pattern Padding. Public Key Cryptography 2002: 228-236
81		Igor Shparlinski: On the Uniformity of Distribution of the ElGamal Signature. Appl. Algebra Eng. Commun. Comput. 13(1): 9-16 (2002)
80		Bruno Codenotti, Igor Shparlinski, Arne Winterhof: On the hardness of approximating the permanent of structured matrices. Computational Complexity 11(3-4): 158-170 (2002)
79		Bernard Mans, Francesco Pappalardi, Igor Shparlinski: On the spectral Ádám property for circulant graphs. Discrete Mathematics 254(1-3): 309-329 (2002)
78		Bruno Codenotti, Igor Shparlinski: Non-approximability of the Permanent of Structured Matrices over Finite Fields Electronic Colloquium on Computational Complexity (ECCC)(071): (2002)
77		Steven D. Galbraith, Herbie J. Hopkins, Igor Shparlinski: Secure Bilinear Diffie-Hellman Bits. IACR Cryptology ePrint Archive 2002: 155 (2002)
76		Igor Shparlinski: Security of most significant bits of gx2. Inf. Process. Lett. 83(2): 109-113 (2002)
75		Phong Q. Nguyen, Igor Shparlinski: The Insecurity of the Digital Signature Algorithm with Partially Known Nonces. J. Cryptology 15(3): 151-176 (2002)
74		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)
	2001
73		Serdar Boztas, Igor Shparlinski: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 14th International Symposium, AAECC-14, Melbourne, Australia November 26-30, 2001, Proceedings Springer 2001
72		Igor Shparlinski: On the Generalised Hidden Number Problem and Bit Security of XTR. AAECC 2001: 268-277
71		Phong Q. Nguyen, Igor Shparlinski: On the Insecurity of a Server-Aided RSA Protocol. ASIACRYPT 2001: 21-35
70		Dan Boneh, Igor Shparlinski: On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme. CRYPTO 2001: 201-212
69		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
68		Erion Plaku, Igor Shparlinski: On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems. FSTTCS 2001: 305-316
67		Arjen K. Lenstra, Igor Shparlinski: On the Security of Lenstra's Variant of DSA without Long Inversions. Public Key Cryptography 2001: 64-72
66		Igor Shparlinski: Sparse polynomial approximation in finite fields. STOC 2001: 209-215
65		Igor Shparlinski: On the Linear Complexity of the Power Generator. Des. Codes Cryptography 23(1): 5-10 (2001)
64		Igor Shparlinski: On Some Properties of the Shrinking Generator. Des. Codes Cryptography 23(2): 147-156 (2001)
63		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)
62		Edwin El Mahassni, Igor Shparlinski: On Some Uniformity of Distribution Properties of ESIGN. Electronic Notes in Discrete Mathematics 6: 132-139 (2001)
61		Anna Bernasconi, Carsten Damm, Igor Shparlinski: Circuit and Decision Tree Complexity of Some Number Theoretic Problems. Inf. Comput. 168(2): 113-124 (2001)
60		Eric Allender, Michael E. Saks, Igor Shparlinski: A Lower Bound for Primality. J. Comput. Syst. Sci. 62(2): 356-366 (2001)
59		Igor Shparlinski: On the uniformity of distribution of the RSA pairs. Math. Comput. 70(234): 801-808 (2001)
58		Harald Niederreiter, Igor Shparlinski: On the distribution of inversive congruential pseudorandom numbers in parts of the period. Math. Comput. 70(236): 1569-1574 (2001)
57		John Friedlander, Igor Shparlinski: On the distribution of the power generator. Math. Comput. 70(236): 1575-1589 (2001)
56		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)
55		John Friedlander, Igor Shparlinski: On the Distribution of Diffie-Hellman Triples with Sparse Exponents. SIAM J. Discrete Math. 14(2): 162-169 (2001)
	2000
54		William D. Banks, Daniel Lieman, Igor Shparlinski: An Extremely Small and Efficient Identification Scheme. ACISP 2000: 378-384
53		David R. Kohel, Igor Shparlinski: On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields. ANTS 2000: 395-404
52		William D. Banks, Daniel Lieman, Igor Shparlinski, Van Thuong To: Cryptographic Applications of Sparse Polynomials over Finite Rings. ICISC 2000: 206-220
51		Igor Shparlinski: Communication Complexity and Fourier Coefficients of the Diffie-Hellman Key. LATIN 2000: 259-268
50		William D. Banks, Daniel Lieman, Igor Shparlinski: An Identification Scheme Based on Sparse Polynomials. Public Key Cryptography 2000: 68-74
49		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)
48		Igor Shparlinski: On the Naor-Reingold Pseudo-Random Function from Elliptic Curves. Appl. Algebra Eng. Commun. Comput. 11(1): 27-34 (2000)
47		Anna Bernasconi, Carsten Damm, Igor Shparlinski: The average sensitivity of square-freeness. Computational Complexity 9(1): 39-51 (2000)
46		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)
45		Igor Shparlinski: Security of Polynomial Transformations of the Diffie--Hellma Electronic Colloquium on Computational Complexity (ECCC) 7(41): (2000)
44		Maria Isabel Gonzalez Vasco, Igor Shparlinski: On the Security of Diffie-Hellman Bits Electronic Colloquium on Computational Complexity (ECCC) 7(45): (2000)
43		Maria Isabel Gonzalez Vasco, Igor Shparlinski: On the Security of Diffie-Hellman Bits. IACR Cryptology ePrint Archive 2000: 20 (2000)
42		Igor Shparlinski: Security of Polynomial Transformations of the Diffie-Hellman Key. IACR Cryptology ePrint Archive 2000: 23 (2000)
41		Frances Griffin, Igor Shparlinski: On the linear complexity profile of the power generator. IEEE Transactions on Information Theory 46(6): 2159-2162 (2000)
40		Igor Shparlinski: Linear complexity of the Naor-Reingold pseudo-random function. Inf. Process. Lett. 76(3): 95-99 (2000)
39		Igor Shparlinski: Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications. J. Algorithms 36(2): 241-252 (2000)
38		Don Coppersmith, Igor Shparlinski: On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping. J. Cryptology 13(3): 339-360 (2000)
37		Joachim von zur Gathen, Igor Shparlinski: The CREW PRAM Complexity of Modular Inversion. SIAM J. Comput. 29(6): 1839-1857 (2000)
36		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)
	1999
35		Joachim von zur Gathen, Igor Shparlinski: Constructing Elements of Large Order in Finite Fields. AAECC 1999: 404-409
34		Marek Karpinski, Igor Shparlinski: On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials. AAECC 1999: 492-497
33		Frances Griffin, Harald Niederreiter, Igor Shparlinski: On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders. AAECC 1999: 87-93
32		Anna Bernasconi, Carsten Damm, Igor Shparlinski: On the Average Sensitivity of Testing Square-Free Numbers. COCOON 1999: 291-299
31		Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor Shparlinski: On Routing in Circulant Graphs. COCOON 1999: 360-369
30		Frances Griffin, Igor Shparlinski: On the Linear Complexity of the Naor-Reingold Pseudo-Random Function. ICICS 1999: 301-308
29		William D. Banks, Frances Griffin, Daniel Lieman, Igor Shparlinski: Non-linear Complexity of the Naor-Reingold Pseudo-random Function. ICISC 1999: 53-59
28		Eric Allender, Michael E. Saks, Igor Shparlinski: A Lower Bound for Primality. IEEE Conference on Computational Complexity 1999: 10-14
27		Anna Bernasconi, Igor Shparlinski: Circuit Complexity of Testing Square-Free Numbers. STACS 1999: 47-56
26		John Friedlander, Michael Larsen, Daniel Lieman, Igor Shparlinski: On The Correlation of Binary Sequences. Des. Codes Cryptography 16(3): 249-256 (1999)
25		Eric Allender, Igor Shparlinski, Michael E. Saks: A Lower Bound for Primality Electronic Colloquium on Computational Complexity (ECCC) 6(10): (1999)
24		Igor Shparlinski: On the Uniformity of Distribution of a Certain Pseudo-Random Function Electronic Colloquium on Computational Complexity (ECCC) 6(21): (1999)
23		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
22		Bernard Mans, Francesco Pappalardi, Igor Shparlinski: On the Ádám Conjecture on Circulant Graphs. COCOON 1998: 251-260
21		Joachim von zur Gathen, Igor Shparlinski: The CREW PRAM Complexity of Modular Inversion. LATIN 1998: 305-315
20		Joachim von zur Gathen, Igor Shparlinski: Orders of Gauss Periods in Finite Fields. Appl. Algebra Eng. Commun. Comput. 9(1): 15-24 (1998)
19		Igor Shparlinski: On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems Electronic Colloquium on Computational Complexity (ECCC) 5(54): (1998)
18		Anna Bernasconi, Igor Shparlinski: Circuit Complexity of Testing Square-Free Numbers Electronic Colloquium on Computational Complexity (ECCC) 5(56): (1998)
17		Joachim von zur Gathen, Igor Shparlinski: Computing components and projections of curves over finite fields. SIAM J. Comput. 28(3): 822-840 (1998)
16		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
15		Joachim von zur Gathen, Marek Karpinski, Igor Shparlinski: Counting Curves and Their Projections. Computational Complexity 6(1): 64-99 (1997)
	1996
14		Igor Shparlinski: On irreducible polynomials of small height over finite fields. Appl. Algebra Eng. Commun. Comput. 7(6): 427-431 (1996)
13		Marek Karpinski, Igor Shparlinski: On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields. Theor. Comput. Sci. 157(2): 259-266 (1996)
12		Igor Shparlinski: On Finding Primitive Roots in Finite Fields. Theor. Comput. Sci. 157(2): 273-275 (1996)
	1995
11		Joachim von zur Gathen, Igor Shparlinski: Finding Points on Curves over Finite Fields (Extended Abstract). FOCS 1995: 284-292
10		Joachim von zur Gathen, Igor Shparlinski: Orders of Gauss Periods in Finite Fields. ISAAC 1995: 208-215
	1994
9		Igor Shparlinski: On some applications of finitely generated semi-groups. ANTS 1994: 265-279
8		Joachim von zur Gathen, Igor Shparlinski: Components and Projections of Curves over Finite Fields. ISAAC 1994: 297-305
	1993
7		Joachim von zur Gathen, Marek Karpinski, Igor Shparlinski: Counting curves and their projections. STOC 1993: 805-812
6		Igor Shparlinski: Finding Irreducible and Primitive Polynomials. Appl. Algebra Eng. Commun. Comput. 4: 263-268 (1993)
5		Igor Shparlinski: On Parameters of Some Graphs from Finite Fields. Eur. J. Comb. 14(6): 589-591 (1993)
	1992
4		Igor Shparlinski: A Deterministic Test for Permutation Polynomials. Computational Complexity 2: 129-132 (1992)
3		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
2		Igor Shparlinski: On Gaussian Sums for Finite Fields and Elliptic Curves. Algebraic Coding 1991: 5-15
	1987
1		S. A. Stepanov, Igor Shparlinski: On Structure Complexity of Normal Basis of Finite Field. FCT 1987: 414-416

Coauthor Index

1	Eric Allender	[25] [28] [60] [94]
2	William D. Banks	[29] [50] [52] [54] [84] [101]
3	Anna Bernasconi	[16] [18] [27] [32] [47] [61] [94]
4	Simon R. Blackburn	[97] [117] [133] [136] [148]
5	Ian F. Blake	[139]
6	Dan Boneh	[70]
7	Jean Bourgain	[173]
8	Serdar Boztas	[73]
9	Jin-Yi Cai (Jin-yi Cai)	[31]
10	Bruno Codenotti	[78] [80]
11	Alina Carmen Cojocaru	[158]
12	Alessandro Conflitti	[101] [102]
13	Scott Contini	[107] [128] [129]
14	Don Coppersmith	[38] [130]
15	Ernie Croot	[107] [129]
16	Wim van Dam	[155]
17	Carsten Damm	[16] [32] [47] [61] [94]
18	Reza Rezaeian Farashahi	[166] [169] [171] [177]
19	Pierre-Alain Fouque	[166]
20	Gudmund Skovbjerg Frandsen	[113]
21	John Friedlander	[26] [55] [56] [57] [162]
22	Steven D. Galbraith	[77] [115]
23	V. I. Galiev	[3]
24	Moubariz Z. Garaev	[132] [134]
25	Theodoulos Garefalakis	[139]
26	Joachim von zur Gathen	[7] [8] [10] [11] [15] [17] [20] [21] [35] [37] [88] [94] [108] [109] [114] [140] [157] [164]
27	Lev Glebsky	[168]
28	Domingo Gomez-Perez	[97] [117] [133] [135]
29	Mark Goresky	[100]
30	Sidney W. Graham	[153]
31	Frances Griffin	[29] [30] [33] [41]
32	Venkatesan Guruswami	[95]
33	Jaime Gutierrez	[90] [97] [117] [133] [135]
34	Sean Hallgren	[127]
35	George Havas	[31]
36	Florian Hess	[123]
37	Herbie J. Hopkins	[77] [115]
38	Nick Howgrave-Graham	[89] [130]
39	Marek Karpinski	[7] [13] [15] [23] [34] [36]
40	Nicholas M. Katz	[160]
41	Andrew Klapper	[100]
42	Neal Koblitz	[165]
43	David R. Kohel	[53]
44	Sergei Konyagin	[93] [173]
45	Tanja Lange	[93] [125]
46	Michael Larsen	[26]
47	Arjen K. Lenstra	[67] [82]
48	Éric Levieil	[119]
49	Wen-Ching W. Li	[85]
50	Daniel Lieman	[26] [29] [50] [52] [54]
51	San Ling	[176]
52	Florian Luca	[119] [121] [131] [132] [134] [175]
53	Edwin El Mahassni	[62] [69]
54	Bernard Mans	[22] [31] [79] [112] [178]
55	Alfred Menezes	[165]
56	Maurice Mignotte	[164]
57	Ram Murty	[100]
58	David Naccache (Deh Cac Can)	[150] [154] [161]
59	Mats Näslund	[83] [85] [96] [111]
60	Ajay Nerurkar	[31]
61	Phong Q. Nguyen	[69] [71] [75] [89] [92] [130]
62	Harald Niederreiter	[33] [49] [58] [98] [99]
63	Alina Ostafe	[167] [170] [172]
64	Francesco Pappalardi	[22] [79]
65	Elena Pelican	[167]
66	Erion Plaku	[68]
67	A. F. Polupanov	[3]
68	Carl Pomerance	[56] [87]
69	Alfred J. van der Poorten	[36]
70	Alexander Russell	[104] [127]
71	Michael E. Saks (Michael Saks)	[25] [28] [60] [94]
72	Jean-Pierre Seifert	[31]
73	Joseph H. Silverman	[63]
74	Alistair Sinclair	[88]
75	Ron Steinfeld	[86] [103] [144] [176]
76	S. A. Stepanov	[1]
77	Mehdi Tibouchi	[166]
78	Van Thuong To	[52]
79	Jorge Jiménez Urroz	[175]
80	Maria Isabel Gonzalez Vasco	[43] [44] [46] [74] [83] [111]
81	José Felipe Voloch	[166]
82	Huaxiong Wang	[176]
83	William Whyte	[96]
84	Arne Winterhof	[80] [90] [91] [110] [116] [120] [124] [134] [138] [141] [142] [146]
85	Maosheng Xiong	[160]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page