Publications: pseudorandom number generators
W.D. Banks, F. Griffin, D. Lieman and I.E. Shparlinski, On the non-linear complexity of the Naor-Reingold pseudorandom function, ICISC'99 Lecture Notes in Computer Science 1787 53-59 Springer-Verlag, 2000.
*F. Griffin, H. Niederreiter and I.E. Shparlinski, On the distribution of nonlinear recursive congruential pseudorandom numbers of higher orders, AAECC-13, Lecture Notes in Computer Science 1719 87-93 Springer-Verlag, 1999.
*F. Griffin and I.E. Shparlinski, On the linear complexity of the Naor-Reingold pseudorandom function, Proc. 2nd Intern. Conf. on Information and Communication Security (ICICS'99), Sydney, Lect. Notes in Computer Science 1726 301-308 Springer-Verlag, 1999.
F. Griffin and I.E. Shparlinski, On the linear complexity profile of the power generator, IEEE Trans. Inform. Th. 46 No 6, Sept 2000.