Books written by Igor Shparlinski

• 

  Recurrence Sequences

  MR 99h:94045 T. W. Cusick and H. Dobbertin, Some new three-valued crosscorrelation functions for binary m-sequences, IEEE Trans. Inform. Theory 42 (1996), no. ... MR 2003f:37014 H. Davenport, Linear forms associated with an algebriac ...

• 

  Recurrence Sequences

  Pezda's estimate (3.9) follows from a precise result giving all possible length of periods over Zo: For any F e Zp[X], ... Morton (861) and Flynn, Poonen and Schaefer (399) prove that a quadratic polynomial over Q cannot have rational ...

• 

  Cryptography and Computational Number Theory

  This volume contains the refereed proceedings of the Workshop on Cryptography and Computational Number Theory, CCNT'99, which has been held in Singapore during the week of November 22-26, 1999.

• 

  Number Theoretic Methods in Cryptography: Complexity lower bounds

  [49] T. W. Cusic, 'Properties of the ao mod N pseudorandom number generator", IEEE Trans. Inform. Theory, 41 (1995), 1155–1159. [50] T. W. Cusic, C. Ding and A. Renvall, Stream ciphers and number ...

• 

  Number Theory and Related Fields: In Memory of Alf van der Poorten

  A historical retrospective and recent progress on the Hadamard conjecture with an emphasis on asymptotic results are ... One of the ways the importance of Jacques Hadamard in the Pantheon of Mathematicians has been recognized is the ...

• 

  Frobenius Distributions: Lang-Trotter and Sato-Tate Conjectures

  ... order terms are of sizes p3/2, p, p1/2, and 1. In every case we are able to analyze, the largest lower order term in the second moment expansion that does not average to zero is on average negative. We prove this “bias conjecture” for ...

• 

  Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness

  ... Generalised cycling attacks on RSA and strong RSA primes ' , Lect . Notes in Comp . Sci . , Springer - Verlag , Berlin , 1587 ( 1999 ) , 149–163 . [ 250 ] H. Halberstam and H.-E. Richert , Sieve methods , Academic Press , London , 1974 ...

• 

  Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness

  The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation. Cryptographers and number theorists will find this book useful.

• 

  Finite Fields: Theory and Computation: The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography

  This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible and primitive polynomials, the distribution of these primitive polynomials and ...