By Professor Igor Shparlinski

Conference Papers

Kaminski M; Shparlinski IE, 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

Shparlinski I; Childs AM; van Dam W, 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 43rd International Colloquium on Automata, Languages, and Programming, Rome, 11 July 2016 - 15 July 2016, http://dx.doi.org/10.4230/lipics.icalp.2016.16

Shparlinski IE, 2016, 'Dynamical systems of non-algebraic origin: Fixed points and orbit lengths', pp. 261 - 283, http://dx.doi.org/10.1090/conm/669/13432

Kohel D; Shparlinski I, 2016, 'Preface', in Contemporary Mathematics, pp. vii - viii

Luca F; Shparlinski IE, 2009, 'On special finite fields', in Contemporary Mathematics, American Mathematical Society (AMS), pp. 163 - 167, http://dx.doi.org/10.1090/conm/487/09530

Shparlinski IE, 2009, 'Pseudorandom number generators from elliptic curves', in Contemporary Mathematics, American Mathematical Society (AMS), pp. 121 - 141, http://dx.doi.org/10.1090/conm/477/09305

Shparlinski IE, 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 5th China-Japan Seminar on Number Theory, JAPAN, Kinki Univ, Higashiosaka, 27 August 2008 - 31 August 2008, http://dx.doi.org/10.1142/9789814289924_0010

El-Mahassni E; Shparlinski IE, 2008, 'On the distribution of the elliptic curve power generator', in Contemporary Mathematics, American Mathematical Society (AMS), pp. 111 - 118, http://dx.doi.org/10.1090/conm/461/08987

Shparlinski IE, 2008, 'Pseudorandom Points on Elliptic Curves over Finite Fields', in Algebraic Geometry and Its Applications, WORLD SCIENTIFIC, pp. 116 - 134, presented at Proceedings of the First SAGA Conference, http://dx.doi.org/10.1142/9789812793430_0006

Shparlinski IE; Steinfeld R, 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 1st International Workshop on Coding and Cryptology, PEOPLES R CHINA, Fujian Normal Univ, Wuui Mt, 11 June 2007 - 15 June 2007, http://dx.doi.org/10.1142/9789812832245_0017

Shparlinski IE, 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 4th China-Japan Seminar on Number Theory, PEOPLES R CHINA, Weihai, 30 August 2006 - 03 September 2006, http://dx.doi.org/10.1142/9789812770134_0007

Shparlinski IE, 2006, 'Bounds on the Fourier Coefficients of the Weighted Sum Function', in Dagstuhl Seminar Proceedings

Shparlinski IE, 2005, 'Orders of points on elliptic curves', in Contemporary Mathematics, American Mathematical Society (AMS), pp. 245 - 251, http://dx.doi.org/10.1090/conm/369/06815

Shparlinski IE, 2005, 'Playing “hide-and-seek” with numbers: the hidden number problem, lattices and exponential sums', in Proceedings of Symposia in Applied Mathematics, American Mathematical Society (AMS), pp. 153 - 177, http://dx.doi.org/10.1090/psapm/062/2211876

Banks WD; Friedlander JB; Pomerance C; Shparlinski IE, 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 Conference in Number Theory in Honour of Hugh C Williams, CANADA, Banff, 24 May 2003 - 30 May 2003

Banks WD; Shparlinski IE, 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 Conference in Number Theory in Honour of Hugh C Williams, CANADA, Banff, 24 May 2003 - 30 May 2003, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000223282500004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Von Zur Gathen J; Shokrollahi A; Shparlinski I, 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

Banks WD; Shparlinski IE, 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

Shparlinski IE; Steinfeld R, 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

Li WCW; Näslund M; Shparlinski IE, 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

Lenstra AK; Shparlinski IE, 2002, 'Selective forgery of rsa signatures with fixed-pattern padding', in Lecture Notes in Computer Science, pp. 228 - 236, http://dx.doi.org/10.1007/3-540-45664-3_16

Pomerance C; Shparlinski IE, 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

Vasco MIG; Näslund M; Shparlinski IE, 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

Shparlinski IE, 2002, 'Exponential Sums and Lattice Reduction: Applications to Cryptography', Springer Nature, pp. 286 - 298, http://dx.doi.org/10.1007/978-3-642-59435-9_23

Mahassni EE; Shparlinski I, 2002, 'On the Uniformity of Distribution of Congruential Generators over Elliptic Curves', in Discrete Mathematics and Theoretical Computer Science, Springer Nature, pp. 257 - 264, http://dx.doi.org/10.1007/978-1-4471-0673-9_19

Niederreiter H; Shparlinski IE, 2002, 'Recent Advances in the Theory of Nonlinear Pseudorandom Number Generators', Springer Nature, pp. 86 - 102, http://dx.doi.org/10.1007/978-3-642-56046-0_6

Allender E; Saks M; Shparlinski I, 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

Banks WD; Lieman D; Shparlinski IE; Van To T, 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

Plaku E; Shparlinski IE, 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

Shparlinski IE, 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

Nguyen PQ; Shparlinski IE, 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

Lenstra AK; Shparlinski IE, 2001, 'On the security of Lenstra’s variant of DSA without long inversions', in Lecture Notes in Computer Science, pp. 64 - 72, http://dx.doi.org/10.1007/3-540-44586-2_5

Mahassni EE; Nguyen PQ; Shparlinski IE, 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

Nguyen PQ; Shparlinski IE; Stern J, 2001, 'Distribution of Modular Sums and the Security of the Server Aided Exponentiation', in Progress in Computer Science and Applied Logic, Springer Nature, pp. 331 - 342, http://dx.doi.org/10.1007/978-3-0348-8295-8_24

Vasco MIG; Shparlinski IE, 2001, 'On the Security of Diffie-Hellman Bits', in Progress in Computer Science and Applied Logic, Springer Nature, pp. 257 - 268, http://dx.doi.org/10.1007/978-3-0348-8295-8_19

Friedlander JB; Hansen JSD; Shparlinski IE, 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 DIMACS Workshop on Unusual Applications of Number Theory, NJ, Piscataway, 10 January 2000 - 14 January 2000

Banks WD; Lieman D; Shparlinski IE, 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

Banks WD; Lieman D; Shparlinski IE, 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

Banks WD; Griffin F; Lieman D; Shparlinski IE, 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

Kohel DR; Shparlinski IE, 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

Grant D; Krastev K; Lieman D; Shparlinski I, 2000, 'A Public Key Cryptosystem Based on Sparse Polynomials', Springer Nature, pp. 114 - 121, http://dx.doi.org/10.1007/978-3-642-57189-3_10

Dawson E; Simpson L; Golic J, 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 Workshop on Cryptography and Computational Number Theory (CCNT 99), SINGAPORE, SINGAPORE, 22 November 1999 - 26 November 1999

Vasco MIG; Näslund M, 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 Workshop on Cryptography and Computational Number Theory (CCNT 99), SINGAPORE, SINGAPORE, 22 November 1999 - 26 November 1999

Mihailescu P, 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 Workshop on Cryptography and Computational Number Theory (CCNT 99), SINGAPORE, SINGAPORE, 22 November 1999 - 26 November 1999

Xing CP, 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 Workshop on Cryptography and Computational Number Theory (CCNT 99), SINGAPORE, SINGAPORE, 22 November 1999 - 26 November 1999

Gollmann D, 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 Workshop on Cryptography and Computational Number Theory (CCNT 99), SINGAPORE, SINGAPORE, 22 November 1999 - 26 November 1999

von zur Gathen J; Pappalardi F, 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 Workshop on Cryptography and Computational Number Theory (CCNT 99), SINGAPORE, SINGAPORE, 22 November 1999 - 26 November 1999

Alexandris N; Burmester M; Chrissikopoulos V; Desmedt Y, 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 Workshop on Cryptography and Computational Number Theory (CCNT 99), SINGAPORE, SINGAPORE, 22 November 1999 - 26 November 1999

Lam KY; Sica F, 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 Workshop on Cryptography and Computational Number Theory (CCNT 99), SINGAPORE, SINGAPORE, 22 November 1999 - 26 November 1999

De Bonis A; De Santis A, 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 Workshop on Cryptography and Computational Number Theory (CCNT 99), SINGAPORE, SINGAPORE, 22 November 1999 - 26 November 1999

Back to profile page