Recurrence sequences G Everest, AJ Van Der Poorten, I Shparlinski, T Ward American Mathematical Society, 2003 | 353 | 2003 |

Character sums with exponential functions and their applications SV Konyagin, IE Shparlinski Cambridge University Press, 1999 | 252 | 1999 |

The Insecurity of the Digital Signature Algorithm with Partially Known Nonces. PQ Nguyen, IE Shparlinski Journal of Cryptology 15 (3), 2002 | 214 | 2002 |

The insecurity of the elliptic curve digital signature algorithm with partially known nonces PQ Nguyen, IE Shparlinski Designs, codes and cryptography 30 (2), 201-217, 2003 | 167 | 2003 |

Finite Fields: Theory and Computation: The meeting point of number theory, computer science, coding theory and cryptography I Shparlinski Springer Science & Business Media, 2013 | 152 | 2013 |

Computational and algorithmic problems in finite fields I Shparlinski Springer Science & Business Media, 2012 | 108 | 2012 |

Cryptographic applications of analytic number theory: complexity lower bounds and pseudorandomness I Shparlinski Birkhäuser, 2013 | 105 | 2013 |

Period of the power generator and small values of Carmichael’s function J Friedlander, C Pomerance, I Shparlinski Mathematics of Computation 70 (236), 1591-1605, 2001 | 100 | 2001 |

On the statistical properties of Diffie-Hellman distributions R Canetti, J Friedlander, S Konyagin, M Larsen, D Lieman, I Shparlinski Israel Journal of Mathematics 120 (1), 23-46, 2000 | 99 | 2000 |

On exponential sums and group generators for elliptic curves over finite fields DR Kohel, IE Shparlinski International Algorithmic Number Theory Symposium, 395-404, 2000 | 93 | 2000 |

Parameters of integral circulant graphs and periodic quantum dynamics N Saxena, S Severini, IE Shparlinski International Journal of Quantum Information 5 (03), 417-430, 2007 | 92 | 2007 |

On Polynomial Approximation of the Discrete Logarithm and the Diffie—Hellman Mapping D Coppersmith, I Shparlinski Journal of Cryptology 13 (3), 339-360, 2000 | 81 | 2000 |

Recent advances in the theory of nonlinear pseudorandom number generators H Niederreiter, IE Shparlinski Monte Carlo and Quasi-Monte Carlo Methods 2000, 86-102, 2002 | 76 | 2002 |

Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface M Abe, K Aoki, G Ateniese, R Avanzi, Z Beerliová, O Billet, A Biryukov, ... Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2006 | 75 | 2006 |

Number theoretic methods in cryptography: Complexity lower bounds I Shparlinski Birkhäuser, 2012 | 74 | 2012 |

Pseudorandomness and dynamics of Fermat quotients A Ostafe, IE Shparlinski SIAM Journal on Discrete Mathematics 25 (1), 50-71, 2011 | 74 | 2011 |

Distribution of modular sums and the security of the server aided exponentiation PQ Nguyen, IE Shparlinski, J Stern Cryptography and Computational Number Theory, 331-342, 2001 | 73 | 2001 |

On the energy of some circulant graphs I Shparlinski Linear algebra and its applications 414 (1), 378-382, 2006 | 72 | 2006 |

Finite Fields and Applications: Eighth International Conference on Finite Fields and Applications, July 9-13, 2007, Melbourne, Australia GL Mullen, D Panario, IE Shparlinski American Mathematical Soc., 2008 | 70 | 2008 |

On the distribution of inversive congruential pseudorandom numbers in parts of the period H Niederreiter, I Shparlinski Mathematics of computation 70 (236), 1569-1574, 2001 | 68 | 2001 |