Igor Shparlinski

Professor

  • 3989 Citations
  • 27 h-Index
1978 …2019

Research output per year

If you made any changes in Pure these will be visible here soon.

Research Outputs

Filter
Chapter
2014

Periodic structure of the exponential pseudorandom number generator

Kaszián, J., Moree, P. & Shparlinski, I. E., 2014, Applied Algebra and Number Theory: Essays in Honor of Harald Niederreiter on the Occasion of his 70th Birthday. Larcher, G., Pillichshammer, F., Winterhof, A. & Xing, C. (eds.). Cambridge: Cambridge University Press, p. 190-203 14 p.

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)
2013

Elliptic curves over finite fields: number theoretic and cryptographic aspects

Shparlinski, I. E., 2013, Advances in Applied Mathematics, Modeling, and Computational Science. Melnik, R. & Kotsireas, I. S. (eds.). New York: Springer, Springer Nature, p. 65-90 26 p. (Fields Institute Communications; vol. 66).

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)
2009

Character sums with Beatty sequences on Burgess-type intervals

Banks, W. D. & Shparlinski, I. E., 2009, Analytic number theory: essays in honour of Klaus Roth. Chen, W. W. L., Gowers, W. T., Halberstam, H., Schmidt, W. M. & Vaughan, R. C. (eds.). Cambridge, UK: Cambridge University Press, p. 15-21 7 p.

Research output: Chapter in Book/Report/Conference proceedingChapter

Divisibility, smoothness and cryptographic application

Naccache, D. & Shparlinski, I. E., 2009, Algebraic aspects of digital communications. Shaska, T. & Hasimaj, E. (eds.). Amsterdam ; Washington, DC: IOS Press, p. 115-173 59 p. (NATO science for peace and security series. D, Information and communication security; vol. 24).

Research output: Chapter in Book/Report/Conference proceedingChapter

On special finite fields

Luca, F. & Shparlinski, I. E., 2009, Arithmetic, geometry, cryptography and coding theory. Lachaud, G., Ritzenthaler, C. & Tsfasman, MA. (eds.). USA: AMER MATHEMATICAL SOC, p. 163-168 6 p. (Contemporary Mathematics; vol. 487).

Research output: Chapter in Book/Report/Conference proceedingChapter

Pseudorandom Number Generators from Elliptic Curves

Shparlinski, I. E., 2009, Recent trends in cryptography. Luengo, I. (ed.). USA: American Mathematical Society, p. 121-141 21 p. (Contemporary Mathematics; vol. 477).

Research output: Chapter in Book/Report/Conference proceedingChapter

2008

Approximate polynomial gcd: Small degree and small height perturbations

Von Zur Gathen, J. & Shparlinski, I. E., 2008, LATIN 2008: Theoretical Informatics: 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008. Proceedings. Laber, E. S., Bornstein, C., Nogueira, L. T. & Faria, L. (eds.). Berlin: Springer, Springer Nature, p. 276-283 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4957).

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Citations (Scopus)
2007

Group structure of elliptic curves over finite fields and applications

Murty, R. & Shparlinski, I., 2007, Topics in geometry, coding theory and cryptography. Garcia, A. & Stichtenoth, H. (eds.). Netherlands: Springer, Springer Nature, Vol. 6. p. 167-194 28 p. (Algebra and Applications; vol. 6).

Research output: Chapter in Book/Report/Conference proceedingChapter

Open Access
2004

Predicting subset sum pseudorandom generators

Von Gathen, J. Z. & Shparlinski, I. E., 2004, Selected areas in cryptography: 11th InternationalWorkshop, SAC 2004 Waterloo, Canada, August 9-10, 2004, Revised Selected Papers. Handschuh, H. & Hasan, M. A. (eds.). Berlin: Springer, Springer Nature, p. 241-251 11 p. (Lecture notes in computer science; vol. 3357).

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Citations (Scopus)
2002

Exponential sums in coding theory, cryptology and algorithms

Shparlinski, I. E., 2002, Coding theory and cryptology. Niederreiter, H. (ed.). Singapore: World Scientific ; Singapore University Press, p. 323-384 62 p. (Lecture notes series, Institute for Mathematical Sciences, National University of Singapore).

Research output: Chapter in Book/Report/Conference proceedingChapter

Selective forgery of rsa signatures with fixed-pattern padding

Lenstra, A. K. & Shparlinski, I. E., 2002, Public Key Cryptography: 5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002 Paris, France, February 12–14, 2002 Proceedings. Naccache, D. & Paillier, P. (eds.). Berlin: Springer, Springer Nature, Vol. 2274. p. 228-236 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2274).

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)
1999

Constructing elements of large order in finite fields

Von Zur Gathen, J. & Shparlinski, I., 1999, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 13th International Symposium, AAECC-13 Honolulu, Hawaii, USA, November 15–19, 1999 Proceedings. Fossorier, M., Imai, H., Lin, S. & Poli, A. (eds.). Berlin: Springer, Springer Nature, Vol. 1719. p. 404-409 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1719).

Research output: Chapter in Book/Report/Conference proceedingChapter

11 Citations (Scopus)

On the computational hardness of testing square-freeness of sparse polynomials

Karpinski, M. & Shparlinski, I., 1999, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 13th International Symposium, AAECC-13, Proceedings: 13th International Symposium, AAECC-13 Honolulu, Hawaii, USA, November 15–19, 1999 Proceedings. Fossorier, M., Imai, H., Lin, S. & Poli, A. (eds.). Berlin: Springer, Springer Nature, p. 492-497 6 p. (Lecture Notes in Computer Science; vol. 1719).

Research output: Chapter in Book/Report/Conference proceedingChapter

10 Citations (Scopus)
1998

On the ádám conjecture on circulant graphs

Mans, B., Pappalardi, F. & Shparlinski, I., 1998, Computing and Combinatorics: 4th Annual International Conference COCOON’98 Taipei, Taiwan, R.o.C., August 12–14, 1998 Proceedings. Hsu, W-L. & Kao, M-Y. (eds.). Berlin: Springer, Springer Nature, p. 251-260 10 p. (Lecture Notes in Computer Science; vol. 1449).

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Citations (Scopus)