( en | de | ru )

 

Disambiguation of "Shparlinski, Igor E."

Author of the publication

copydeleteadd this publication to your clipboard
Predicting masked linear pseudorandom number generators over finite fields.

, , , and . Des. Codes Cryptogr., 67 (3): 395-402 (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Igor Barabash

Das Bildzitat im Internet. Uni München, (2009)

Igor Smolitsch

Igor Popov

Igor Semechin

Igor Yakushev

 

Other publications of authors with the same name

On finite fields for pairing based cryptography., and . Adv. in Math. of Comm., 1 (3): 281-286 (2007)Circuit and Decision Tree Complexity of Some Number Theoretic Problems, , and . Universität Trier, Mathematik/Informatik, Forschungsbericht, (1998)Computational Diffie-Hellman Problem.. Encyclopedia of Cryptography and Security (2nd Ed.), Springer, (2011)Divisibility, Smoothness and Cryptographic Applications., and . Algebraic Aspects of Digital Communications, volume 24 of NATO Science for Peace and Security Series - D: Information and Communication Security, IOS Press, (2009)Approximate Polynomial gcd: Small Degree and Small Height Perturbations., and . LATIN, volume 4957 of Lecture Notes in Computer Science, page 276-283. Springer, (2008)An Extremely Small and Efficient Identification Scheme., , and . ACISP, volume 1841 of Lecture Notes in Computer Science, page 378-384. Springer, (2000)Sum-Products Estimates with Several Sets and Applications., , and . Integers, (2012)Counting Co-Cyclic Lattices., and . CoRR, (2015)Periodic Structure of the Exponential Pseudorandom Number Generator., , and . CoRR, (2013)Sparse polynomial approximation in finite fields.. STOC, page 209-215. ACM, (2001)