| 2008 |
|---|
| 140 | EE | Joachim von zur Gathen,
Igor Shparlinski:
Approximate Polynomial gcd: Small Degree and Small Height Perturbations.
LATIN 2008: 276-283 |
| 139 | EE | Igor Shparlinski:
Pseudorandom Graphs from Elliptic Curves.
LATIN 2008: 284-292 |
| 138 | EE | Wim van Dam,
Igor Shparlinski:
Classical and Quantum Algorithms for Exponential Congruences.
TQC 2008: 1-10 |
| 137 | EE | David Naccache,
Igor Shparlinski:
Divisibility, Smoothness and Cryptographic Applications
CoRR abs/0810.2067: (2008) |
| 136 | EE | Sidney W. Graham,
Igor Shparlinski:
On RSA moduli with almost half of the bits prescribed.
Discrete Applied Mathematics 156(16): 3150-3154 (2008) |
| 2007 |
|---|
| 135 | EE | Igor Shparlinski:
Communication complexity of some number theoretic functions.
Appl. Math. Lett. 20(8): 872-875 (2007) |
| 134 | EE | 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) |
| 133 | EE | Igor Shparlinski:
Bounds on the Fourier coefficients of the weighted sum function.
Inf. Process. Lett. 103(3): 83-87 (2007) |
| 132 | EE | Igor Shparlinski,
Arne Winterhof:
Quantum period reconstruction of approximate sequences.
Inf. Process. Lett. 103(6): 211-215 (2007) |
| 131 | EE | Igor Shparlinski,
Ron Steinfeld:
Chinese Remaindering with Multiplicative Noise.
Theory Comput. Syst. 40(1): 33-41 (2007) |
| 2006 |
|---|
| 130 | EE | Igor Shparlinski:
Bounds on the Fourier Coefficients of the Weighted Sum Function.
Complexity of Boolean Functions 2006 |
| 129 | EE | Igor Shparlinski,
Arne Winterhof:
Constructions of Approximately Mutually Unbiased Bases.
LATIN 2006: 793-799 |
| 128 | EE | Igor Shparlinski,
Arne Winterhof:
On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences.
SETA 2006: 295-303 |
| 127 | EE | Joachim von zur Gathen,
Igor Shparlinski:
GCD of Random Linear Combinations.
Algorithmica 46(1): 137-148 (2006) |
| 126 | EE | 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) |
| 125 | EE | Igor Shparlinski,
Arne Winterhof:
On the nonlinearity of linear recurrence sequences.
Appl. Math. Lett. 19(4): 340-344 (2006) |
| 124 | EE | Igor Shparlinski:
On RSA Moduli with Prescribed Bit Patterns.
Des. Codes Cryptography 39(1): 113-122 (2006) |
| 123 | EE | Simon R. Blackburn,
Igor Shparlinski:
Character sums and nonlinear recurrence sequences.
Discrete Mathematics 306(12): 1126-1131 (2006) |
| 122 | EE | 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) |
| 121 | EE | Simon R. Blackburn,
Domingo Gomez-Perez,
Jaime Gutierrez,
Igor Shparlinski:
Reconstructing noisy polynomial evaluation in residue rings.
J. Algorithms 61(2): 47-59 (2006) |
| 120 | EE | 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) |
| 119 | EE | Florian Luca,
Igor Shparlinski:
Elliptic Curves with Low Embedding Degree.
J. Cryptology 19(4): 553-562 (2006) |
| 118 | EE | 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) |
| 2005 |
|---|
| 117 | EE | Scott Contini,
Igor Shparlinski:
On Stern's Attack Against Secret Truncated Linear Congruential Generators.
ACISP 2005: 52-60 |
| 116 | EE | Sean Hallgren,
Alexander Russell,
Igor Shparlinski:
Quantum Noisy Rational Function Reconstruction.
COCOON 2005: 420-429 |
| 115 | EE | Igor Shparlinski:
Diffie-Hellman Problem.
Encyclopedia of Cryptography and Security 2005 |
| 114 | EE | 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) |
| 113 | EE | Igor Shparlinski,
Arne Winterhof:
Noisy interpolation of sparse polynomials in finite fields.
Appl. Algebra Eng. Commun. Comput. 16(5): 307-317 (2005) |
| 112 | EE | 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) |
| 111 | EE | Igor Shparlinski,
Arne Winterhof:
On the linear complexity of bounded integer sequences over different moduli.
Inf. Process. Lett. 96(5): 175-177 (2005) |
| 2004 |
|---|
| 110 | EE | Steven D. Galbraith,
Herbie J. Hopkins,
Igor Shparlinski:
Secure Bilinear Diffie-Hellman Bits.
ACISP 2004: 370-378 |
| 109 | EE | Joachim von zur Gathen,
Igor Shparlinski:
GCD of Random Linear Forms.
ISAAC 2004: 464-469 |
| 108 | EE | Gudmund Skovbjerg Frandsen,
Igor Shparlinski:
On reducing a system of equations to a single equation.
ISSAC 2004: 163-166 |
| 107 | EE | Bernard Mans,
Igor Shparlinski:
Bisecting and Gossiping in Circulant Graphs.
LATIN 2004: 589-598 |
| 106 | EE | Maria Isabel Gonzalez Vasco,
Mats Näslund,
Igor Shparlinski:
New Results on the Hardness of Diffie-Hellman Bits.
Public Key Cryptography 2004: 159-172 |
| 105 | EE | Igor Shparlinski,
Arne Winterhof:
A Nonuniform Algorithm for the Hidden Number Problem in Subgroups.
Public Key Cryptography 2004: 416-424 |
| 104 | EE | Joachim von zur Gathen,
Igor Shparlinski:
Polynomial interpolation from multiples.
SODA 2004: 1132-1137 |
| 103 | EE | Joachim von zur Gathen,
Igor Shparlinski:
Predicting Subset Sum Pseudorandom Generators.
Selected Areas in Cryptography 2004: 241-251 |
| 102 | EE | Scott Contini,
Ernie Croot,
Igor Shparlinski:
Complexity of Inverting the Euler Function
Electronic Colloquium on Computational Complexity (ECCC)(035): (2004) |
| 101 | EE | Igor Shparlinski:
On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA.
Inf. Process. Lett. 92(3): 143-147 (2004) |
| 100 | EE | Alexander Russell,
Igor Shparlinski:
Classical and quantum function reconstruction via character evaluation.
J. Complexity 20(2-3): 404-422 (2004) |
| 99 | EE | Igor Shparlinski,
Ron Steinfeld:
Noisy Chinese remaindering in the Lee norm.
J. Complexity 20(2-3): 423-437 (2004) |
| 98 | | Alessandro Conflitti,
Igor Shparlinski:
On the multidimensional distribution of the subset sum generator of pseudorandom numbers.
Math. Comput. 73(246): 1005-1011 (2004) |
| 97 | EE | 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) |
| 96 | EE | Mark Goresky,
Andrew Klapper,
Ram Murty,
Igor Shparlinski:
On Decimations of l-Sequences.
SIAM J. Discrete Math. 18(1): 130-140 (2004) |
| 2003 |
|---|
| 95 | EE | Harald Niederreiter,
Igor Shparlinski:
Dynamical Systems Generated by Rational Functions.
AAECC 2003: 6-17 |
| 94 | EE | Harald Niederreiter,
Igor Shparlinski:
Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity.
IMA Int. Conf. 2003: 183-189 |
| 93 | EE | Simon R. Blackburn,
Domingo Gomez-Perez,
Jaime Gutierrez,
Igor Shparlinski:
Predicting the Inversive Generator.
IMA Int. Conf. 2003: 264-275 |
| 92 | EE | Mats Näslund,
Igor Shparlinski,
William Whyte:
On the Bit Security of NTRUEncrypt.
Public Key Cryptography 2003: 62-70 |
| 91 | EE | Venkatesan Guruswami,
Igor Shparlinski:
Unconditional proof of tightness of Johnson bound.
SODA 2003: 754-755 |
| 90 | EE | 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) |
| 89 | | Sergei Konyagin,
Tanja Lange,
Igor Shparlinski:
Linear Complexity of the Discrete Logarithm.
Des. Codes Cryptography 28(2): 135-146 (2003) |
| 88 | EE | 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) |
| 87 | | 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) |
| 86 | | 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) |
| 85 | EE | Joachim von zur Gathen,
Igor Shparlinski,
Alistair Sinclair:
Finding Points on Curves over Finite Fields.
SIAM J. Comput. 32(6): 1436-1448 (2003) |
| 2002 |
|---|
| 84 | EE | Carl Pomerance,
Igor Shparlinski:
Smooth Orders and Cryptographic Applications.
ANTS 2002: 338-348 |
| 83 | EE | Igor Shparlinski,
Ron Steinfeld:
Chinese Remaindering for Algebraic Numbers in a Hidden Field.
ANTS 2002: 349-356 |
| 82 | EE | 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 |
| 81 | EE | William D. Banks,
Igor Shparlinski:
A Variant of NTRU with Non-invertible Polynomials.
INDOCRYPT 2002: 62-70 |
| 80 | EE | Maria Isabel Gonzalez Vasco,
Mats Näslund,
Igor Shparlinski:
The Hidden Number Problem in Extension Fields and Its Applications.
LATIN 2002: 105-117 |
| 79 | EE | Arjen K. Lenstra,
Igor Shparlinski:
Selective Forgery of RSA Signatures with Fixed-Pattern Padding.
Public Key Cryptography 2002: 228-236 |
| 78 | EE | Igor Shparlinski:
On the Uniformity of Distribution of the ElGamal Signature.
Appl. Algebra Eng. Commun. Comput. 13(1): 9-16 (2002) |
| 77 | EE | Bruno Codenotti,
Igor Shparlinski,
Arne Winterhof:
On the hardness of approximating the permanent of structured matrices.
Computational Complexity 11(3-4): 158-170 (2002) |
| 76 | EE | Bernard Mans,
Francesco Pappalardi,
Igor Shparlinski:
On the spectral Ádám property for circulant graphs.
Discrete Mathematics 254(1-3): 309-329 (2002) |
| 75 | EE | Bruno Codenotti,
Igor Shparlinski:
Non-approximability of the Permanent of Structured Matrices over Finite Fields
Electronic Colloquium on Computational Complexity (ECCC)(071): (2002) |
| 74 | EE | Igor Shparlinski:
Security of most significant bits of gx2.
Inf. Process. Lett. 83(2): 109-113 (2002) |
| 73 | EE | Phong Q. Nguyen,
Igor Shparlinski:
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces.
J. Cryptology 15(3): 151-176 (2002) |
| 72 | | 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 |
|---|
| 71 | | 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 |
| 70 | EE | Igor Shparlinski:
On the Generalised Hidden Number Problem and Bit Security of XTR.
AAECC 2001: 268-277 |
| 69 | EE | Phong Q. Nguyen,
Igor Shparlinski:
On the Insecurity of a Server-Aided RSA Protocol.
ASIACRYPT 2001: 21-35 |
| 68 | EE | Dan Boneh,
Igor Shparlinski:
On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme.
CRYPTO 2001: 201-212 |
| 67 | EE | 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 |
| 66 | EE | Erion Plaku,
Igor Shparlinski:
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems.
FSTTCS 2001: 305-316 |
| 65 | EE | Arjen K. Lenstra,
Igor Shparlinski:
On the Security of Lenstra's Variant of DSA without Long Inversions.
Public Key Cryptography 2001: 64-72 |
| 64 | EE | Igor Shparlinski:
Sparse polynomial approximation in finite fields.
STOC 2001: 209-215 |
| 63 | | Igor Shparlinski:
On the Linear Complexity of the Power Generator.
Des. Codes Cryptography 23(1): 5-10 (2001) |
| 62 | | Igor Shparlinski:
On Some Properties of the Shrinking Generator.
Des. Codes Cryptography 23(2): 147-156 (2001) |
| 61 | | 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) |
| 60 | EE | Edwin El Mahassni,
Igor Shparlinski:
On Some Uniformity of Distribution Properties of ESIGN.
Electronic Notes in Discrete Mathematics 6: 132-139 (2001) |
| 59 | | Anna Bernasconi,
Carsten Damm,
Igor Shparlinski:
Circuit and Decision Tree Complexity of Some Number Theoretic Problems.
Inf. Comput. 168(2): 113-124 (2001) |
| 58 | | Eric Allender,
Michael E. Saks,
Igor Shparlinski:
A Lower Bound for Primality.
J. Comput. Syst. Sci. 62(2): 356-366 (2001) |
| 57 | | Igor Shparlinski:
On the uniformity of distribution of the RSA pairs.
Math. Comput. 70(234): 801-808 (2001) |
| 56 | | Harald Niederreiter,
Igor Shparlinski:
On the distribution of inversive congruential pseudorandom numbers in parts of the period.
Math. Comput. 70(236): 1569-1574 (2001) |
| 55 | | John Friedlander,
Igor Shparlinski:
On the distribution of the power generator.
Math. Comput. 70(236): 1575-1589 (2001) |
| 54 | | 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) |
| 53 | EE | John Friedlander,
Igor Shparlinski:
On the Distribution of Diffie-Hellman Triples with Sparse Exponents.
SIAM J. Discrete Math. 14(2): 162-169 (2001) |
| 2000 |
|---|
| 52 | | William D. Banks,
Daniel Lieman,
Igor Shparlinski:
An Extremely Small and Efficient Identification Scheme.
ACISP 2000: 378-384 |
| 51 | | David R. Kohel,
Igor Shparlinski:
On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields.
ANTS 2000: 395-404 |
| 50 | EE | William D. Banks,
Daniel Lieman,
Igor Shparlinski,
Van Thuong To:
Cryptographic Applications of Sparse Polynomials over Finite Rings.
ICISC 2000: 206-220 |
| 49 | | Igor Shparlinski:
Communication Complexity and Fourier Coefficients of the Diffie-Hellman Key.
LATIN 2000: 259-268 |
| 48 | | William D. Banks,
Daniel Lieman,
Igor Shparlinski:
An Identification Scheme Based on Sparse Polynomials.
Public Key Cryptography 2000: 68-74 |
| 47 | EE | 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) |
| 46 | EE | Igor Shparlinski:
On the Naor-Reingold Pseudo-Random Function from Elliptic Curves.
Appl. Algebra Eng. Commun. Comput. 11(1): 27-34 (2000) |
| 45 | EE | Anna Bernasconi,
Carsten Damm,
Igor Shparlinski:
The average sensitivity of square-freeness.
Computational Complexity 9(1): 39-51 (2000) |
| 44 | EE | 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) |
| 43 | EE | Igor Shparlinski:
Security of Polynomial Transformations of the Diffie--Hellma
Electronic Colloquium on Computational Complexity (ECCC) 7(41): (2000) |
| 42 | EE | Maria Isabel Gonzalez Vasco,
Igor Shparlinski:
On the Security of Diffie-Hellman Bits
Electronic Colloquium on Computational Complexity (ECCC) 7(45): (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 | EE | 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 | EE | 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 | EE | 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 | EE | Anna Bernasconi,
Carsten Damm,
Igor Shparlinski:
On the Average Sensitivity of Testing Square-Free Numbers.
COCOON 1999: 291-299 |
| 31 | EE | 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 | EE | Eric Allender,
Michael E. Saks,
Igor Shparlinski:
A Lower Bound for Primality.
IEEE Conference on Computational Complexity 1999: 10-14 |
| 27 | EE | 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 | EE | Eric Allender,
Igor Shparlinski,
Michael E. Saks:
A Lower Bound for Primality
Electronic Colloquium on Computational Complexity (ECCC) 6(10): (1999) |
| 24 | EE | Igor Shparlinski:
On the Uniformity of Distribution of a Certain Pseudo-Random Function
Electronic Colloquium on Computational Complexity (ECCC) 6(21): (1999) |
| 23 | EE | 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 | EE | Bernard Mans,
Francesco Pappalardi,
Igor Shparlinski:
On the Ádám Conjecture on Circulant Graphs.
COCOON 1998: 251-260 |
| 21 | EE | Joachim von zur Gathen,
Igor Shparlinski:
The CREW PRAM Complexity of Modular Inversion.
LATIN 1998: 305-315 |
| 20 | EE | Joachim von zur Gathen,
Igor Shparlinski:
Orders of Gauss Periods in Finite Fields.
Appl. Algebra Eng. Commun. Comput. 9(1): 15-24 (1998) |
| 19 | EE | Igor Shparlinski:
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
Electronic Colloquium on Computational Complexity (ECCC) 5(54): (1998) |
| 18 | EE | 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 | EE | Igor Shparlinski:
On Irreducible Polynomials of Small Height over Finite Fields.
Appl. Algebra Eng. Commun. Comput. 7(6): 427-431 (1996) |
| 13 | EE | Marek Karpinski,
Igor Shparlinski:
On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields.
Theor. Comput. Sci. 157(2): 259-266 (1996) |
| 12 | EE | 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 | EE | 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 | EE | 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 |
