The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Igor Shparlinski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joachim von zur Gathen, Igor Shparlinski
    Constructing Elements of Large Order in Finite Fields. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:404-409 [Conf]
  2. Frances Griffin, Harald Niederreiter, Igor Shparlinski
    On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:87-93 [Conf]
  3. Marek Karpinski, Igor Shparlinski
    On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:492-497 [Conf]
  4. Harald Niederreiter, Igor Shparlinski
    Dynamical Systems Generated by Rational Functions. [Citation Graph (0, 0)][DBLP]
    AAECC, 2003, pp:6-17 [Conf]
  5. Igor Shparlinski
    On the Generalised Hidden Number Problem and Bit Security of XTR. [Citation Graph (0, 0)][DBLP]
    AAECC, 2001, pp:268-277 [Conf]
  6. Scott Contini, Igor Shparlinski
    On Stern's Attack Against Secret Truncated Linear Congruential Generators. [Citation Graph (0, 0)][DBLP]
    ACISP, 2005, pp:52-60 [Conf]
  7. William D. Banks, Daniel Lieman, Igor Shparlinski
    An Extremely Small and Efficient Identification Scheme. [Citation Graph (0, 0)][DBLP]
    ACISP, 2000, pp:378-384 [Conf]
  8. Steven D. Galbraith, Herbie J. Hopkins, Igor Shparlinski
    Secure Bilinear Diffie-Hellman Bits. [Citation Graph (0, 0)][DBLP]
    ACISP, 2004, pp:370-378 [Conf]
  9. David R. Kohel, Igor Shparlinski
    On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 2000, pp:395-404 [Conf]
  10. Carl Pomerance, Igor Shparlinski
    Smooth Orders and Cryptographic Applications. [Citation Graph (0, 0)][DBLP]
    ANTS, 2002, pp:338-348 [Conf]
  11. Igor Shparlinski
    On some applications of finitely generated semi-groups. [Citation Graph (0, 0)][DBLP]
    ANTS, 1994, pp:265-279 [Conf]
  12. Igor Shparlinski, Ron Steinfeld
    Chinese Remaindering for Algebraic Numbers in a Hidden Field. [Citation Graph (0, 0)][DBLP]
    ANTS, 2002, pp:349-356 [Conf]
  13. Phong Q. Nguyen, Igor Shparlinski
    On the Insecurity of a Server-Aided RSA Protocol. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2001, pp:21-35 [Conf]
  14. Edwin El Mahassni, Phong Q. Nguyen, Igor Shparlinski
    The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces. [Citation Graph (0, 0)][DBLP]
    CaLC, 2001, pp:97-109 [Conf]
  15. Eric Allender, Michael E. Saks, Igor Shparlinski
    A Lower Bound for Primality. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:10-14 [Conf]
  16. Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor Shparlinski
    On Routing in Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:360-369 [Conf]
  17. Anna Bernasconi, Carsten Damm, Igor Shparlinski
    On the Average Sensitivity of Testing Square-Free Numbers. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:291-299 [Conf]
  18. Sean Hallgren, Alexander Russell, Igor Shparlinski
    Quantum Noisy Rational Function Reconstruction. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:420-429 [Conf]
  19. Bernard Mans, Francesco Pappalardi, Igor Shparlinski
    On the Ádám Conjecture on Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:251-260 [Conf]
  20. Dan Boneh, Igor Shparlinski
    On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:201-212 [Conf]
  21. Wen-Ching W. Li, Mats Näslund, Igor Shparlinski
    Hidden Number Problem with the Trace and Bit Security of XTR and LUC. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2002, pp:433-448 [Conf]
  22. S. A. Stepanov, Igor Shparlinski
    On Structure Complexity of Normal Basis of Finite Field. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:414-416 [Conf]
  23. Igor Shparlinski
    On Gaussian Sums for Finite Fields and Elliptic Curves. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1991, pp:5-15 [Conf]
  24. Joachim von zur Gathen, Igor Shparlinski
    Finding Points on Curves over Finite Fields (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:284-292 [Conf]
  25. Erion Plaku, Igor Shparlinski
    On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:305-316 [Conf]
  26. Frances Griffin, Igor Shparlinski
    On the Linear Complexity of the Naor-Reingold Pseudo-Random Function. [Citation Graph (0, 0)][DBLP]
    ICICS, 1999, pp:301-308 [Conf]
  27. William D. Banks, Frances Griffin, Daniel Lieman, Igor Shparlinski
    Non-linear Complexity of the Naor-Reingold Pseudo-random Function. [Citation Graph (0, 0)][DBLP]
    ICISC, 1999, pp:53-59 [Conf]
  28. William D. Banks, Daniel Lieman, Igor Shparlinski, Van Thuong To
    Cryptographic Applications of Sparse Polynomials over Finite Rings. [Citation Graph (0, 0)][DBLP]
    ICISC, 2000, pp:206-220 [Conf]
  29. Simon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski
    Predicting the Inversive Generator. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 2003, pp:264-275 [Conf]
  30. Harald Niederreiter, Igor Shparlinski
    Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 2003, pp:183-189 [Conf]
  31. William D. Banks, Igor Shparlinski
    A Variant of NTRU with Non-invertible Polynomials. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2002, pp:62-70 [Conf]
  32. Joachim von zur Gathen, Igor Shparlinski
    GCD of Random Linear Forms. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:464-469 [Conf]
  33. Joachim von zur Gathen, Igor Shparlinski
    Components and Projections of Curves over Finite Fields. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:297-305 [Conf]
  34. Joachim von zur Gathen, Igor Shparlinski
    Orders of Gauss Periods in Finite Fields. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:208-215 [Conf]
  35. Gudmund Skovbjerg Frandsen, Igor Shparlinski
    On reducing a system of equations to a single equation. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2004, pp:163-166 [Conf]
  36. Joachim von zur Gathen, Igor Shparlinski
    The CREW PRAM Complexity of Modular Inversion. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:305-315 [Conf]
  37. Bernard Mans, Igor Shparlinski
    Bisecting and Gossiping in Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:589-598 [Conf]
  38. Igor Shparlinski
    Communication Complexity and Fourier Coefficients of the Diffie-Hellman Key. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:259-268 [Conf]
  39. Igor Shparlinski, Arne Winterhof
    Constructions of Approximately Mutually Unbiased Bases. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:793-799 [Conf]
  40. Maria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski
    The Hidden Number Problem in Extension Fields and Its Applications. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:105-117 [Conf]
  41. William D. Banks, Daniel Lieman, Igor Shparlinski
    An Identification Scheme Based on Sparse Polynomials. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2000, pp:68-74 [Conf]
  42. Arjen K. Lenstra, Igor Shparlinski
    On the Security of Lenstra's Variant of DSA without Long Inversions. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2001, pp:64-72 [Conf]
  43. Arjen K. Lenstra, Igor Shparlinski
    Selective Forgery of RSA Signatures with Fixed-Pattern Padding. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2002, pp:228-236 [Conf]
  44. Mats Näslund, Igor Shparlinski, William Whyte
    On the Bit Security of NTRUEncrypt. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2003, pp:62-70 [Conf]
  45. Igor Shparlinski, Arne Winterhof
    A Nonuniform Algorithm for the Hidden Number Problem in Subgroups. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2004, pp:416-424 [Conf]
  46. Maria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski
    New Results on the Hardness of Diffie-Hellman Bits. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2004, pp:159-172 [Conf]
  47. Joachim von zur Gathen, Igor Shparlinski
    Predicting Subset Sum Pseudorandom Generators. [Citation Graph (0, 0)][DBLP]
    Selected Areas in Cryptography, 2004, pp:241-251 [Conf]
  48. Igor Shparlinski, Arne Winterhof
    On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:295-303 [Conf]
  49. Joachim von zur Gathen, Igor Shparlinski
    Polynomial interpolation from multiples. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1132-1137 [Conf]
  50. Venkatesan Guruswami, Igor Shparlinski
    Unconditional proof of tightness of Johnson bound. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:754-755 [Conf]
  51. Anna Bernasconi, Igor Shparlinski
    Circuit Complexity of Testing Square-Free Numbers. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:47-56 [Conf]
  52. Joachim von zur Gathen, Marek Karpinski, Igor Shparlinski
    Counting curves and their projections. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:805-812 [Conf]
  53. Igor Shparlinski
    Sparse polynomial approximation in finite fields. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:209-215 [Conf]
  54. Ian F. Blake, Theodoulos Garefalakis, Igor Shparlinski
    On the bit security of the Diffie-Hellman key. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2006, v:16, n:6, pp:397-404 [Journal]
  55. Joachim von zur Gathen, Igor Shparlinski
    Orders of Gauss Periods in Finite Fields. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1998, v:9, n:1, pp:15-24 [Journal]
  56. Tanja Lange, Igor Shparlinski
    Collisions in Fast Generation of Ideal Classes and Points on Hyperelliptic and Elliptic Curves. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2005, v:15, n:5, pp:329-337 [Journal]
  57. Harald Niederreiter, Igor Shparlinski
    On the Distribution of Pseudorandom Numbers and Vectors Generated by Inversive Methods. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2000, v:10, n:3, pp:189-202 [Journal]
  58. Igor Shparlinski
    On the Naor-Reingold Pseudo-Random Function from Elliptic Curves. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2000, v:11, n:1, pp:27-34 [Journal]
  59. Igor Shparlinski
    On the Uniformity of Distribution of the ElGamal Signature. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2002, v:13, n:1, pp:9-16 [Journal]
  60. Igor Shparlinski
    Finding Irreducible and Primitive Polynomials. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1993, v:4, n:, pp:263-268 [Journal]
  61. Igor Shparlinski
    On Irreducible Polynomials of Small Height over Finite Fields. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1996, v:7, n:6, pp:427-431 [Journal]
  62. Igor Shparlinski, Arne Winterhof
    Noisy interpolation of sparse polynomials in finite fields. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2005, v:16, n:5, pp:307-317 [Journal]
  63. Joachim von zur Gathen, Igor Shparlinski
    GCD of Random Linear Combinations. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:1, pp:137-148 [Journal]
  64. Igor Shparlinski, Arne Winterhof
    On the nonlinearity of linear recurrence sequences. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2006, v:19, n:4, pp:340-344 [Journal]
  65. Igor Shparlinski
    Communication complexity of some number theoretic functions. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2007, v:20, n:8, pp:872-875 [Journal]
  66. Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski
    Complexity of some arithmetic problems for binary polynomials. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2003, v:12, n:1-2, pp:23-47 [Journal]
  67. Joachim von zur Gathen, Marek Karpinski, Igor Shparlinski
    Counting Curves and Their Projections. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:1, pp:64-99 [Journal]
  68. Anna Bernasconi, Carsten Damm, Igor Shparlinski
    The average sensitivity of square-freeness. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:1, pp:39-51 [Journal]
  69. Bruno Codenotti, Igor Shparlinski, Arne Winterhof
    On the hardness of approximating the permanent of structured matrices. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2002, v:11, n:3-4, pp:158-170 [Journal]
  70. Igor Shparlinski
    A Deterministic Test for Permutation Polynomials. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:129-132 [Journal]
  71. John Friedlander, Michael Larsen, Daniel Lieman, Igor Shparlinski
    On The Correlation of Binary Sequences. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:16, n:3, pp:249-256 [Journal]
  72. Florian Hess, Igor Shparlinski
    On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:35, n:1, pp:111-117 [Journal]
  73. Sergei Konyagin, Tanja Lange, Igor Shparlinski
    Linear Complexity of the Discrete Logarithm. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:28, n:2, pp:135-146 [Journal]
  74. Phong Q. Nguyen, Igor Shparlinski
    The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:30, n:2, pp:201-217 [Journal]
  75. Igor Shparlinski
    On the Linear Complexity of the Power Generator. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:23, n:1, pp:5-10 [Journal]
  76. Igor Shparlinski
    On Some Properties of the Shrinking Generator. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:23, n:2, pp:147-156 [Journal]
  77. Igor Shparlinski, Joseph H. Silverman
    On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:24, n:3, pp:279-289 [Journal]
  78. Igor Shparlinski
    On RSA Moduli with Prescribed Bit Patterns. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:39, n:1, pp:113-122 [Journal]
  79. Simon R. Blackburn, Igor Shparlinski
    Character sums and nonlinear recurrence sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1126-1131 [Journal]
  80. Bernard Mans, Francesco Pappalardi, Igor Shparlinski
    On the spectral Ádám property for circulant graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:309-329 [Journal]
  81. Simon R. Blackburn, Igor Shparlinski
    Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131]. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1218-1219 [Journal]
  82. Maria Isabel Gonzalez Vasco, Igor Shparlinski
    Security of the Most Significant Bits of the Shamir Message Passing Scheme [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:40, pp:- [Journal]
  83. Igor Shparlinski
    Security of Polynomial Transformations of the Diffie--Hellma [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:41, pp:- [Journal]
  84. Maria Isabel Gonzalez Vasco, Igor Shparlinski
    On the Security of Diffie-Hellman Bits [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:45, pp:- [Journal]
  85. Bruno Codenotti, Igor Shparlinski
    Non-approximability of the Permanent of Structured Matrices over Finite Fields [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:071, pp:- [Journal]
  86. Scott Contini, Ernie Croot, Igor Shparlinski
    Complexity of Inverting the Euler Function [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:035, pp:- [Journal]
  87. Igor Shparlinski
    On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:54, pp:- [Journal]
  88. Eric Allender, Igor Shparlinski, Michael E. Saks
    A Lower Bound for Primality [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:10, pp:- [Journal]
  89. Igor Shparlinski
    On the Uniformity of Distribution of a Certain Pseudo-Random Function [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:21, pp:- [Journal]
  90. Marek Karpinski, Igor Shparlinski
    On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:27, pp:- [Journal]
  91. Igor Shparlinski
    On Parameters of Some Graphs from Finite Fields. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:6, pp:589-591 [Journal]
  92. Anna Bernasconi, Carsten Damm, Igor Shparlinski
    Circuit and Decision Tree Complexity of Some Number Theoretic Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:168, n:2, pp:113-124 [Journal]
  93. V. I. Galiev, A. F. Polupanov, Igor Shparlinski
    Distances from Differences of Roots of Polynomials to the Nearest Integers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:3, pp:143-146 [Journal]
  94. Igor Shparlinski
    Linear complexity of the Naor-Reingold pseudo-random function. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:3, pp:95-99 [Journal]
  95. Igor Shparlinski
    Security of most significant bits of gx2. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:2, pp:109-113 [Journal]
  96. Igor Shparlinski
    On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:3, pp:143-147 [Journal]
  97. Igor Shparlinski, Arne Winterhof
    On the linear complexity of bounded integer sequences over different moduli. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:5, pp:175-177 [Journal]
  98. Igor Shparlinski
    Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:36, n:2, pp:241-252 [Journal]
  99. Simon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski
    Reconstructing noisy polynomial evaluation in residue rings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:61, n:2, pp:47-59 [Journal]
  100. Alexander Russell, Igor Shparlinski
    Classical and quantum function reconstruction via character evaluation. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2004, v:20, n:2-3, pp:404-422 [Journal]
  101. Igor Shparlinski, Ron Steinfeld
    Noisy Chinese remaindering in the Lee norm. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2004, v:20, n:2-3, pp:423-437 [Journal]
  102. Eric Allender, Michael E. Saks, Igor Shparlinski
    A Lower Bound for Primality. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:2, pp:356-366 [Journal]
  103. Moubariz Z. Garaev, Florian Luca, Igor Shparlinski
    Catalan and Apéry numbers in residue classes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:5, pp:851-865 [Journal]
  104. Don Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyen, Igor Shparlinski
    Testing set proportionality and the Ádám isomorphism of circulant graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:2, pp:324-335 [Journal]
  105. Don Coppersmith, Igor Shparlinski
    On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2000, v:13, n:3, pp:339-360 [Journal]
  106. Phong Q. Nguyen, Igor Shparlinski
    The Insecurity of the Digital Signature Algorithm with Partially Known Nonces. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2002, v:15, n:3, pp:151-176 [Journal]
  107. Florian Luca, Igor Shparlinski
    Elliptic Curves with Low Embedding Degree. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2006, v:19, n:4, pp:553-562 [Journal]
  108. Alessandro Conflitti, Igor Shparlinski
    On the multidimensional distribution of the subset sum generator of pseudorandom numbers. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2004, v:73, n:246, pp:1005-1011 [Journal]
  109. John Friedlander, Carl Pomerance, Igor Shparlinski
    Period of the power generator and small values of Carmichael's function. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2001, v:70, n:236, pp:1591-1605 [Journal]
  110. John Friedlander, Igor Shparlinski
    On the distribution of the power generator. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2001, v:70, n:236, pp:1575-1589 [Journal]
  111. Nick Howgrave-Graham, Phong Q. Nguyen, Igor Shparlinski
    Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2003, v:72, n:243, pp:1473-1485 [Journal]
  112. Harald Niederreiter, Igor Shparlinski
    On the distribution of inversive congruential pseudorandom numbers in parts of the period. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2001, v:70, n:236, pp:1569-1574 [Journal]
  113. Igor Shparlinski
    On the uniformity of distribution of the RSA pairs. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2001, v:70, n:234, pp:801-808 [Journal]
  114. Maria Isabel Gonzalez Vasco, Igor Shparlinski
    Security of the most significant bits of the Shamir message passing scheme. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2002, v:71, n:237, pp:333-342 [Journal]
  115. Joachim von zur Gathen, Igor Shparlinski
    The CREW PRAM Complexity of Modular Inversion. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:6, pp:1839-1857 [Journal]
  116. Joachim von zur Gathen, Igor Shparlinski
    Computing components and projections of curves over finite fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:3, pp:822-840 [Journal]
  117. Joachim von zur Gathen, Igor Shparlinski, Alistair Sinclair
    Finding Points on Curves over Finite Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1436-1448 [Journal]
  118. William D. Banks, Alessandro Conflitti, Igor Shparlinski
    Number Theoretic Designs for Directed Regular Graphs of Small Diameter. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:17, n:3, pp:377-383 [Journal]
  119. John Friedlander, Igor Shparlinski
    On the Distribution of Diffie-Hellman Triples with Sparse Exponents. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:2, pp:162-169 [Journal]
  120. Mark Goresky, Andrew Klapper, Ram Murty, Igor Shparlinski
    On Decimations of l-Sequences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:1, pp:130-140 [Journal]
  121. Marek Karpinski, Alfred J. van der Poorten, Igor Shparlinski
    Zero testing of p-adic and modular polynomials. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:233, n:1-2, pp:309-317 [Journal]
  122. Marek Karpinski, Igor Shparlinski
    On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:157, n:2, pp:259-266 [Journal]
  123. Igor Shparlinski
    On Finding Primitive Roots in Finite Fields. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:157, n:2, pp:273-275 [Journal]
  124. Moubariz Z. Garaev, Florian Luca, Igor Shparlinski, Arne Winterhof
    On the Lower Bound of the Linear Complexity Over BBF_p of Sidelnikov Sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:7, pp:3299-3304 [Journal]
  125. Frances Griffin, Igor Shparlinski
    On the linear complexity profile of the power generator. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:6, pp:2159-2162 [Journal]
  126. Jaime Gutierrez, Igor Shparlinski, Arne Winterhof
    On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:1, pp:60-64 [Journal]
  127. Igor Shparlinski, Arne Winterhof
    Quantum period reconstruction of approximate sequences. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:6, pp:211-215 [Journal]
  128. Igor Shparlinski, Ron Steinfeld
    Chinese Remaindering with Multiplicative Noise. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:1, pp:33-41 [Journal]

  129. Bounds on the Fourier Coefficients of the Weighted Sum Function. [Citation Graph (, )][DBLP]


  130. Approximate Polynomial gcd: Small Degree and Small Height Perturbations. [Citation Graph (, )][DBLP]


  131. Pseudorandom Graphs from Elliptic Curves. [Citation Graph (, )][DBLP]


  132. Classical and Quantum Algorithms for Exponential Congruences. [Citation Graph (, )][DBLP]


  133. Elliptic Twin Prime Conjecture. [Citation Graph (, )][DBLP]


  134. Divisibility, Smoothness and Cryptographic Applications [Citation Graph (, )][DBLP]


  135. Pseudorandom Bits From Points on Elliptic Curves [Citation Graph (, )][DBLP]


  136. On RSA moduli with almost half of the bits prescribed. [Citation Graph (, )][DBLP]


  137. On the number of distinct elliptic curves in some families. [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 0.018secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002