Igor Shparlinski is a Lecturer in the Department of Computing, Macquarie University. His major area of research is number theory and its applications to various areas computer science, including designing and analysis of algorithms, cryptography, coding theory, pseudo-random number generation, numerical methods, and computer graphics. He is the author of more them 90 research papers. In 1992 he finished a book "Computational and Algorithmic Problems in Finite Fields" Dr. Shparlinski received his M.Sc. in Mathematics in 1977 and later Dr. in Mathematics in 1980 from Moscow State Pedagogical Institute. He is an active member of the international computer science community. In 1992-93 he was the Vice-Chairman of the International Conference on Number Theoretic and Algebraic Methods in Computer Science, in 1994-95 he was the Program Committee Chairman of the 3-rd conference on Computational Algebra and Number Theory.
Education - M.S. in Mathematics, 1977; Moscow State Pedagogical Institute
- Ph.D. in Mathematics, 1980; Moscow State Pedagogical Institute
Awards
Areas of Interest - Cryptography
- Number Theory
- Theoretical Computer Science
- Quantum Computation
Current Research - Algebraic and Number Theoretic Methods in Cryptography
- Computation and Algorithms in Finite Fields
- Exponential Sums
- Recurrence Sequences
- Pseudo Random Number Generators
- Quantum Computation
Other Recent and Current Activities - Program Committee Chair of the Oberwolfach meeting series "Finite Fields and their Applications" Oberwolfach, Germany, 1997, 2001, 2004.
- Program Committee Chair of the 14th Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (AAECC-14), Melbourne, Nov., 2001;
- Program Committee Chair of the Workshop on Cryptography and Computational Number Theory (CCNT'99), Singapore, 22-26 Nov., 1999.
My Publications Books: - Computational and algorithmic problems in finite fields, Kluwer Academic Publishers, 1992.
- (with A. J. van der Poorten and H. G. Zimmer, Editors) Proceedings of The Conference on Number Theoretic and Algebraic Methods in Computer Science, World Scientific, 1995
- Finite fields: Theory and computation, Kluwer Academic Publishers, 1999.
- Number theoretic methods in cryptography: Complexity lower bounds, Birkhauser, 1999.
- (with S. Konyagin) Character sums with exponential functions and their applications, Cambridge Univ. Press, Cambridge, 1999.
- (with K.-Y. Lam, H. Wang and C. Xing, Editors) Proc. Workshop on Cryptography and Computational Number Theory (CCNT'99), Singapore, Birkhauser, 2001.
- (with S. Boztas, Editors) Proc. 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-14), Melbourne, Springer-Verlag, Berlin, 2001.
- Cryptographic applications of analytic number theory, Birkhauser, 2003.
- (with G. Everest, A. J. van der Poorten and T. Ward) Recurrence sequences, Amer. Math. Soc., 2003.
A complete list of publications is here. Some of them are available electronically.
Things I Like | Hate | - Travelling: everywhere, anytime
- Dogs: any breed
- Beer: German, not Australian (sorry, mates)
- Martial Arts: black belt in Judo
| - Endless Meetings
- Lawn Mowing
- Ties (both on my neck and in a game)
- Onion
|
My Favourite WWW Sites Mathematics and Computer Science | Others | | | |
Want to know more about me? Click here then to see my CV. |
