Igor Shparlinski

from Wikipedia, the free encyclopedia

Igor E. Shparlinski (born January 13, 1956 in Kiev ) is an Australian mathematician .

Igor Shparlinski, Oberwolfach 2006

Shparlinski studied mathematics at the State Pedagogical Institute in Moscow with a diploma in 1977 and a doctorate in 1980. From 1977 to 1992 he was at the Moscow Institute of Radio Engineering, Electronics and Automation of the Soviet Academy of Sciences and also taught at the Department of Number Theory from 1980 to 1987 State Pedagogical Institute. He became a Lecturer in 1992, Associate Professor in 2001 and Professor at Macquarie University in 2005 .

He deals with number theory with applications in cryptography , theoretical computer science and coding theory and especially exponential and character sums, finite fields, linear recurrent sequences.

In 2006 he became a Fellow of the Australian Academy of Science and he is a Fellow of the Australian Mathematical Society , whose medal he received in 1996. In 1996 he received the Humboldt Research Award .

He has the black belt in judo .

Fonts

  • Computational and Algorithmic Problems in Finite Fields (= Mathematics and its Applications. Soviet Series. 88). Kluwer, Dordrecht et al. 1992, ISBN 0-7923-2057-3 .
  • as editor with Alf J. van der Poorten , Horst G. Zimmer : Number Theoretic and Algebraic Methods in Computer Science. Proceedings of the International Conference Moscow, June, July 1993. World Scientific, Singapore et al. 1995, ISBN 981-022334-X .
  • Finite Fields. Theory and Computation. The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography (= Mathematics and its Applications. 477). Kluwer, Dordrecht et al. 1999, ISBN 0-7923-5662-4 .
  • Number theoretic methods in cryptography. Complexity lower bounds (= Progress in Computer Science and Applied Logic. 17). Birkhäuser, Basel et al. 1999, ISBN 3-7643-5888-2 .
  • with Sergei V. Konyagin : Character sums with exponential functions and their applications (= Cambridge Tracts in Mathematics. 136). Cambridge University Press, Cambridge et al. 1999, ISBN 0-521-64263-9 .
  • Cryptographic applications of analytic number theory. Complexity lower bounds and pseudorandomness (= Progress in Computer Science and Applied Logic. 22). Birkhäuser, Basel et al. 2003, ISBN 3-7643-6654-0 .
  • with Thomas Ward , Graham Everest , Alf van der Poorten: Recurrence sequences (= Mathematical Surveys and Monographs. 104). American Mathematical Society, Providence RI 2003, ISBN 0-8218-3387-1 .
  • as editor with Gary McGuire, Gary L. Mullen, Daniel Panario: Finite Fields. Theory and Applications. Ninth International Conference Finite Fields and Applications, July 13-17, 2009, Dublin, Ireland (= Contemporary Mathematics . 518). American Mathematical Society, Providence RI 2010, ISBN 978-0-8218-4786-2 .

Web links