ORCID as entered in ROS
https://orcid.org/0000-0002-5246-9391
Select Publications
Conference Papers
, 2021, 'Sets of Linear Forms Which Are Hard to Compute', in Leibniz International Proceedings in Informatics, LIPIcs, http://dx.doi.org/10.4230/LIPIcs.MFCS.2021.66
, 2016, 'Optimal Quantum Algorithm for Polynomial Interpolation', in Ioannis Chatzigiannakis MMYRADS (ed.), Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, DROPS, Rome, pp. 16:1 - 16:13, presented at
, 2016, 'Dynamical systems of non-algebraic origin: Fixed points and orbit lengths', pp. 261 - 283, http://dx.doi.org/10.1090/conm/669/13432
, 2016, 'Preface', in Contemporary Mathematics, pp. vii - viii
, 2008, 'OPEN PROBLEMS ON EXPONENTIAL AND CHARACTER SUMS', in Aoki T; Kanemitsu S; Liu JY (eds.), NUMBER THEORY: DREAMING IN DREAMS, WORLD SCIENTIFIC PUBL CO PTE LTD, JAPAN, Kinki Univ, Higashiosaka, pp. 222 - 242, presented at
, 2008, 'Pseudorandom Points on Elliptic Curves over Finite Fields', in Algebraic Geometry and Its Applications, WORLD SCIENTIFIC, pp. 116 - 134, presented at
, 2007, 'On Special Finite Fields', in Lachaud G; Ritzenthaler C; Tsfasman MA (eds.), ARITHMETIC, GEOMETRY, CRYPTOGRAPHY AND CODING THEORY, AMER MATHEMATICAL SOC, FRANCE, Ctr Int Rencontres Math, Marseilles, pp. 163 - 167, presented at
, 2007, 'On the distribution of the elliptic curve power generator', in Mullen GL; Panario D; Shparlinski IE (eds.), FINITE FIELDS AND APPLICATIONS, AMER MATHEMATICAL SOC, AUSTRALIA, Melbourne, pp. 111 - 118, presented at
, 2007, 'Collision in the DSA Function', in Li Y; Ling S; Niederreiter H; Wang H; Xing C; Zhang S (eds.), CODING AND CRYPTOLOGY, WORLD SCIENTIFIC PUBL CO PTE LTD, PEOPLES R CHINA, Fujian Normal Univ, Wuui Mt, pp. 226 - 232, presented at
, 2006, 'DISTRIBUTION OF POINTS ON MODULAR HYPERBOLAS', in Kanemitsu S; Liu JY (ed.), NUMBER THEORY: SAILING ON THE SEA OF NUMBER THEORY, WORLD SCIENTIFIC PUBL CO PTE LTD, PEOPLES R CHINA, Weihai, pp. 155 - 189, presented at
, 2006, 'Bounds on the Fourier Coefficients of the Weighted Sum Function', in Dagstuhl Seminar Proceedings
, 2005, 'Pseudorandom Number Generators from Elliptic Curves', in Luengo I (ed.), RECENT TRENDS IN CRYPTOGRAPHY, AMER MATHEMATICAL SOC, SPAIN, Real Soc Mat Espanola, Santander, pp. 121 - 141, presented at
, 2003, 'Orders of points on elliptic curves', in Gutierrez J; Shpilrain V; Yu JT (eds.), AFFINE ALGEBRAIC GEOMETRY, AMER MATHEMATICAL SOC, SPAIN, Seville, pp. 245 - 251, presented at
, 2003, 'Congruences and exponential sums with the Euler function', in VanDerPoorten A; Stein A (ed.), HIGH PRIMES AND MISDEMEANOURS: LECTURES IN HONOUR OF THE 60TH BIRTHDAY OF HUGH COWIE WILLIAMS, AMER MATHEMATICAL SOC, CANADA, Banff, pp. 49 - 59, presented at
, 2003, 'Multiplicative structure of values of the Euler function', in VanDerPoorten A; Stein A (ed.), HIGH PRIMES AND MISDEMEANOURS: LECTURES IN HONOUR OF THE 60TH BIRTHDAY OF HUGH COWIE WILLIAMS, AMER MATHEMATICAL SOC, CANADA, Banff, pp. 29 - 47, presented at
, 2003, 'Playing "hide-and-seek" with numbers: The hidden number problem, lattices and exponential sums', in Garret P; Lieman D (ed.), PUBLIC-KEY CRYPTOGRAPHY, AMER MATHEMATICAL SOC, MD, Baltimore, pp. 153 - 177, presented at
, 2003, 'An authentication scheme based on roots of sparse polynomials', in Proceedings - 2003 IEEE Information Theory Workshop, ITW 2003, pp. 159 - 162, http://dx.doi.org/10.1109/ITW.2003.1216719
, 2002, 'A variant of NTRU with non-invertible polynomials', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 62 - 70, http://dx.doi.org/10.1007/3-540-36231-2_6
, 2002, 'Chinese remaindering for algebraic numbers in a hidden field', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 349 - 356, http://dx.doi.org/10.1007/3-540-45455-1_28
, 2002, 'Hidden number problem with the trace and bit security of XTR and LUC', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 433 - 448, http://dx.doi.org/10.1007/3-540-45708-9_28
, 2002, 'Selective forgery of rsa signatures with fixed-pattern padding', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 228 - 236, http://dx.doi.org/10.1007/3-540-45664-3_16
, 2002, 'Smooth orders and cryptographic applications', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 338 - 348, http://dx.doi.org/10.1007/3-540-45455-1_27
, 2002, 'The hidden number problem in extension fields and its applications', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 105 - 117
, 2001, 'Exponential sums and lattice reduction: Applications to cryptography', in Mullen GL; Stichtenoth H; TapiaRecillas H (eds.), FINITE FIELDS WITH APPLICATIONS TO CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS, SPRINGER-VERLAG BERLIN, MEXICO, OAXACA, pp. 286 - 298, presented at
, 2001, 'On the uniformity of distribution of congruential generators over elliptic curves', in Helleseth T; Kumar PV; Yang K (eds.), SEQUENCES AND THEIR APPLICATIONS, PROCEEDINGS, SPRINGER-VERLAG LONDON LTD, NORWAY, BERGEN, pp. 257 - 264, presented at
, 2001, 'A lower bound for primality', in Journal of Computer and System Sciences, pp. 356 - 366, http://dx.doi.org/10.1006/jcss.2000.1725
, 2001, 'Cryptographic applications of sparse Polynomials over Finite Rings', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 206 - 220, http://dx.doi.org/10.1007/3-540-45247-8_17
, 2001, 'On polynomial representations of boolean functions related to some number theoretic problems', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 305 - 316, http://dx.doi.org/10.1007/3-540-45294-x_26
, 2001, 'On the generalised hidden number problem and bit security of XTR', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 268 - 277, http://dx.doi.org/10.1007/3-540-45624-4_28
, 2001, 'On the insecurity of a server-aided RSA protocol', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 21 - 35, http://dx.doi.org/10.1007/3-540-45682-1_2
, 2001, 'On the security of Lenstra’s variant of DSA without long inversions', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 64 - 72, http://dx.doi.org/10.1007/3-540-44586-2_5
, 2001, 'The insecurity of nyberg–rueppel and other DSA-like signature schemes with partially known nonces', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 97 - 109, http://dx.doi.org/10.1007/3-540-44670-2_9
, 2000, 'Recent advances in the theory of nonlinear pseudorandom number generators', in Fang KT; Hickernell FJ; Niederreiter H (eds.), MONTE CARLO AND QUASI-MONTE CARLO METHODS 2000, SPRINGER-VERLAG BERLIN, PEOPLES R CHINA, HONG KONG BAPTIST UNIV, HONG KONG, pp. 86 - 102, presented at
, 2000, 'On the distribution of the power generator modulo a prime power', in Nathanson MB (ed.), UNUSUAL APPLICATIONS OF NUMBER THEORY, AMER MATHEMATICAL SOC, NJ, Piscataway, pp. 71 - 79, presented at
, 2000, 'An Extremely Small and Efficient identification scheme', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 378 - 384, http://dx.doi.org/10.1007/10718964_31
, 2000, 'An identification scheme based on sparse polynomials', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 68 - 74, http://dx.doi.org/10.1007/978-3-540-46588-1_6
, 2000, 'Non-linear complexity of the naor-reingold pseudo-random function', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 53 - 59, http://dx.doi.org/10.1007/10719994_5
, 2000, 'On exponential sums and group generators for elliptic curves over finite fields', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 395 - 404, http://dx.doi.org/10.1007/10722028_24
, 1999, 'Effective determination of the proportion of split primes in number fields', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 81 - 92, presented at
, 1999, 'New results on the randomness of visual cryptography schemes', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 187 - 201, presented at
, 1999, 'On elements of high order in finite fields', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 11 - 14, presented at
, 1999, 'The dark side of the hidden number problem: Lattice attacks on DSA', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 321 - 330, presented at
, 1999, 'A general construction for fail-stop signature using authentication codes', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 343 - 356, presented at
, 1999, 'A survey of divide and conquer attacks on certain irregularly clocked stream ciphers', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 165 - 185, presented at
, 1999, 'A survey of hard core functions', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 227 - 255, presented at
, 1999, 'Achieving optimal fairness from biased coinflips', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 303 - 319, presented at
, 1999, 'Algorithms for generating, testing and proving primes: A survey', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 93 - 122, presented at
, 1999, 'Applications of algebraic curves to constructions of sequences', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 137 - 146, presented at
, 1999, 'Authentication - Myths and misconceptions', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 203 - 225, presented at
, 1999, 'Counting the number of points on affine diagonal curves', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 15 - 24, presented at
Filter by type
https://orcid.org/0000-0002-5246-9391