( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values.

, , , и . Experimental Mathematics, 23 (3): 241-260 (2014)

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.

Igor Barabash

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

Igor Smolitsch

Igor Pribicevic

Igor Barsukov

Igor Yakushev

 

Другие публикации лиц с тем же именем

On Some Properties of the Shrinking Generator.. Des. Codes Cryptogr., 23 (2): 147-156 (2001)On the Uniformity of Distribution of Congruential Generators over Elliptic Curves., и . SETA, стр. 257-264. Springer, (2001)An Extremely Small and Efficient Identification Scheme., , и . ACISP, том 1841 из Lecture Notes in Computer Science, стр. 378-384. Springer, (2000)Secure Bilinear Diffie-Hellman Bits., , и . ACISP, том 3108 из Lecture Notes in Computer Science, стр. 370-378. Springer, (2004)Circuit and Decision Tree Complexity of Some Number Theoretic Problems, , и . 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., и . Algebraic Aspects of Digital Communications, том 24 из NATO Science for Peace and Security Series - D: Information and Communication Security, IOS Press, (2009)On finite fields for pairing based cryptography., и . Adv. in Math. of Comm., 1 (3): 281-286 (2007)Approximate Polynomial gcd: Small Degree and Small Height Perturbations., и . LATIN, том 4957 из Lecture Notes in Computer Science, стр. 276-283. Springer, (2008)Sparse polynomial approximation in finite fields.. STOC, стр. 209-215. ACM, (2001)