ORCID as entered in ROS
https://orcid.org/0000-0002-5246-9391
Select Publications
Conference Papers
, 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, '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
, 1999, 'Density estimates related to Gauss periods', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 33 - 41, presented at
, 1999, 'Designated 2-verifier proofs and their application to electronic commerce', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 149 - 163, presented at
, 1999, 'Distribution of modular sums and the security of the server aided exponentiation', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 331 - 342, presented at
, 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, 'Elliptic curve factorization using a "partially oblivious" function', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 123 - 128, 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, 'On the dimension and the number of parameters of a unirational variety', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 3 - 9, presented at
, 1999, 'On the security of Diffie-Hellman bits', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 257 - 268, presented at
, 1999, 'Polynomial rings and efficient public key authentication II', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 269 - 286, presented at
, 1999, 'Rational groups of elliptic curves suitable for cryptography', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 69 - 80, presented at
, 1999, 'Robust additive secret sharing schemes over Z(m)', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 357 - 368, presented at
, 1999, 'RSA public key validation', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 369 - 378, presented at
, 1999, 'Security of biased sources for cryptographic keys', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 287 - 302, presented at
, 1999, 'Small values of the Carmichael function and cryptographic applications', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 25 - 32, 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, 'The distribution of the coefficients of primitive polynomials over finite fields', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 43 - 57, presented at
, 1999, 'The distribution of the quadratic symbol in function fields and a faster mathematical stream cipher', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 59 - 68, presented at
, 1999, 'The Hermite-Serret algorithm and 12(2)+33(2)', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 129 - 136, presented at
, 1999, 'Gauss periods in finite fields', in Jungnickel D; Niederreiter H (ed.), FINITE FIELDS AND APPLICATIONS, SPRINGER-VERLAG BERLIN, GERMANY, UNIV AUGSBURG, DEPT MATH, AUGSBURG, pp. 162 - 177, presented at
, 1999, 'Circuit complexity of testing square-free numbers', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 47 - 56, http://dx.doi.org/10.1007/3-540-49116-3_4
, 1999, 'Constructing elements of large order in finite fields', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 404 - 409, http://dx.doi.org/10.1007/3-540-46796-3_38
, 1999, 'Lower bound for primality', in Proceedings of the Annual IEEE Conference on Computational Complexity, pp. 10 - 14
, 1999, 'On routing in circulant graphs', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 360 - 369, http://dx.doi.org/10.1007/3-540-48686-0_36
, 1999, 'On the average sensitivity of testing square-free numbers', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 291 - 299, http://dx.doi.org/10.1007/3-540-48686-0_29
, 1999, 'On the computational hardness of testing square-freeness of sparse polynomials', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 492 - 497, http://dx.doi.org/10.1007/3-540-46796-3_47
, 1999, 'On the distribution of nonlinear recursive congruential pseudorandom numbers of higher orders', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 87 - 93, http://dx.doi.org/10.1007/3-540-46796-3_9
, 1999, 'On the 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. 301 - 308, http://dx.doi.org/10.1007/978-3-540-47942-0_25
, 1998, 'A public key cryptosystem based on sparse polynomials', in Buchmann J; Hoholdt T; Stichtenoth H; TapiaRecillas H (eds.), CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS, SPRINGER-VERLAG BERLIN, MEXICO, GUANAJUATO, pp. 114 - 121, presented at
, 1998, 'On the ádám conjecture on circulant graphs', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 251 - 260, http://dx.doi.org/10.1007/3-540-68535-9_29
, 1998, 'The crew pram complexity of modular inversion', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 305 - 315
, 1995, 'Finding points on curves over finite fields extended abstract', in Annual Symposium on Foundations of Computer Science - Proceedings, pp. 284 - 292
, 1995, 'Finding points on curves over finite fields', in 36TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, I E E E, COMPUTER SOC PRESS, WI, MILWAUKEE, pp. 284 - 292, presented at
, 1995, 'Orders of gauss periods in finite fields', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 208 - 215, http://dx.doi.org/10.1007/bfb0015425
Filter by type
https://orcid.org/0000-0002-5246-9391