Igor Shparlinski |
|
|---|---|
Author's Web Page  | |
| 21 papers in database with 469 citations  H-number: 11 | |
Journal Papers |
|
| 1. Igor Shparlinski, On RSA Moduli with Prescribed Bit Patterns, Designs, Codes and Cryptography,
Volume 39(1), pp. 113 - 122,
Springer, 2006. [  Electronic
Edition][ Cited
5 times
] | |
| 2. Florian Luca, Igor Shparlinski, Elliptic Curves with Low Embedding Degree, Journal of Cryptology,
Volume 19(4), pp. 553 - 562,
Springer, 2006. [ Cited
12 times
] | |
| 3. Phong Q. Nguyen, Igor Shparlinski, The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces, Designs, Codes and Cryptography,
Volume 30(2), pp. 201 - 217,
Springer, 2003. [ Electronic
Edition][Cited
100 times
 ] | |
| 4. Sergei Konyagin, Tanja Lange, Igor Shparlinski, Linear Complexity of the Discrete Logarithm, Designs, Codes and Cryptography,
Volume 28(2), pp. 135 - 146,
Springer, 2003. [ Electronic
Edition][Cited
20 times
] | |
| 5. Phong Q. Nguyen, Igor Shparlinski, The Insecurity of the Digital Signature Algorithm with Partially Known Nonces, Journal of Cryptology,
Volume 15(3), pp. 151 - 176,
Springer, 2002. [ Cited
97 times
] | |
| 6. Igor Shparlinski, Joseph H. Silverman, On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves, Designs, Codes and Cryptography,
Volume 24(3), pp. 279 - 289,
Springer, 2001. [ Electronic
Edition][Cited
18 times
] | |
| 7. Igor Shparlinski, On Some Properties of the Shrinking Generator, Designs, Codes and Cryptography,
Volume 23(2), pp. 147 - 156,
Springer, 2001. [ Electronic
Edition][Cited
37 times
] | |
| 8. Igor Shparlinski, On the Linear Complexity of the Power Generator, Designs, Codes and Cryptography,
Volume 23(1), pp. 5 - 10,
Springer, 2001. [ Electronic
Edition][Cited
22 times
] | |
| 9. Don Coppersmith, Igor Shparlinski, On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping, Journal of Cryptology,
Volume 13(3), pp. 339 - 360,
Springer, 2000. [ Cited
58 times
] | |
| 10. John Friedlander, Michael Larsen, Daniel Lieman, Igor Shparlinski, On The Correlation of Binary Sequences, Designs, Codes and Cryptography,
Volume 16(3), pp. 249 - 256,
Springer, 1999. [ Electronic
Edition][Cited
3 times
] | |
Conference Papers |
|
| 1. Joachim von zur Gathen, Igor Shparlinski, Predicting Subset Sum Pseudorandom Generators, pp. 241 - 251, SAC 2004. [ Electronic
Edition][Cited
1 times
] | |
| 2. Maria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski, New Results on the Hardness of Diffie-Hellman Bits, pp. 159 - 172, PKC 2004. [ Electronic
Edition][ IACR Online
Archive ][Cited
5 times
] | |
| 3. Igor Shparlinski, Arne Winterhof, A Nonuniform Algorithm for the Hidden Number Problem in Subgroups, pp. 416 - 424, PKC 2004. [ Electronic
Edition][IACR Online
Archive][Cited
5 times
] | |
| 4. Mats Näslund, Igor Shparlinski, William Whyte, On the Bit Security of NTRUEncrypt, pp. 62 - 70, PKC 2003. [ Electronic
Edition][Cited
3 times
] | |
| 5. William D. Banks, Igor Shparlinski, A Variant of NTRU with Non-invertible Polynomials, pp. 62 - 70, INDOCRYPT 2002. [ Electronic
Edition][Cited
3 times
] | |
| 6. Wen-Ching W. Li, Mats Näslund, Igor Shparlinski, Hidden Number Problem with the Trace and Bit Security of XTR and LUC, pp. 433 - 448, CRYPTO 2002. [ Electronic
Edition][IACR Online
Archive][Cited
21 times
] | |
| 7. Arjen K. Lenstra, Igor Shparlinski, Selective Forgery of RSA Signatures with Fixed-Pattern Padding, pp. 228 - 236, PKC 2002. [ Electronic
Edition][Cited
7 times
] | |
| 8. Phong Q. Nguyen, Igor Shparlinski, On the Insecurity of a Server-Aided RSA Protocol, pp. 21 - 35, ASIACRYPT 2001. [ Electronic
Edition][IACR Online
Archive][Cited
12 times
] | |
| 9. Dan Boneh, Igor Shparlinski, On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme, pp. 201 - 212, CRYPTO 2001. [ Electronic
Edition][IACR Online
Archive][Cited
30 times
] | |
| 10. Arjen K. Lenstra, Igor Shparlinski, On the Security of Lenstra's Variant of DSA without Long Inversions, pp. 64 - 72, PKC 2001. [ Electronic
Edition][No
citation] | |
| 11. William D. Banks, Daniel Lieman, Igor Shparlinski, An Identification Scheme Based on Sparse Polynomials, pp. 68 - 74, PKC 2000. [ Electronic
Edition][Cited
10 times
] | |
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals