By Professor Igor Shparlinski

Books

Abe M; Aoki K; Ateniese G; Avanzi R; Beerliová Z; Billet O; Biryukov A; Blake I; Boyd C; Brier E; Castiglione A; Cha J; Chan A; Chen L; Cho K; Contini S; D'Arco P; Ding J; Doche C; Dunkelman O; Fitzi M; Fouque PA; Fournier JJA; Fujisaki K; Fujisaki E; Furukawa J; Galindo D; Halevi S; Handschuh H; Heneghan C; Holenstein T; Hoshino F; Hwang YH; Isshiki T; Jochemsz E; Joux A; Juels A; Jutla C; Kiayias A; Kikuchi H; Kobayashi T; Kohno T; Krawczyk H; Kumar S; Lange T; Lee JW; Masucci B; May A; Mihaljevic M; Minematsu K; Monrose F; Montague P; Myers S; Naccache D; Nicolosi A; Obana S; Okazaki S; Okeya K; Olivier F; Oyono R; Page D; Park JH; Peng K; Pietrzak K; Raub D; Sakai Y; Sakurai K; Schindler W; Seo JW; Shin JH; Shparlinski I; Steinfeld R; Szydlo M; Kalai YT; Teranishi I; Tokita T; Tunstall M; Vercauteren F; Villegas K; Walfish S; Wang H; Wang X; Warinschi B; De Weger B; Wolf C; Yampolskiy A; Yang YH; Yin YL; Yoon J; Pointcheval D, 2006, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Everest G; van der Poorten A; Shparlinski I; Ward T, 2003, Recurrence Sequences, American Mathematical Society, http://dx.doi.org/10.1090/surv/104

Boztaş S; Shparlinski IE, 2001, Preface

Konyagin S; Shparlinski I, 1999, Character Sums with Exponential Functions and their Applications, Cambridge University Press, http://dx.doi.org/10.1017/cbo9780511542930

Shparlinski IE, 1999, Finite Fields: Theory and Computation, Springer Netherlands, http://dx.doi.org/10.1007/978-94-015-9239-0

Shparlinski I, 1999, Number Theoretic Methods in Cryptography, Birkhäuser Basel, http://dx.doi.org/10.1007/978-3-0348-8664-2

Shparlinski IE, 1992, Computational and Algorithmic Problems in Finite Fields, Springer Netherlands, http://dx.doi.org/10.1007/978-94-011-1806-4

Book Chapters

Konyagin SV; Shparlinski IE; Vyugin IV, 2022, 'Polynomial equations in subgroups and applications', in Analysis at Large: Dedicated to the Life and Work of Jean Bourgain, pp. 273 - 297, http://dx.doi.org/10.1007/978-3-031-05331-3_12

Cools R; Kuo FY; Sloan IH; Nuyens D, 2020, 'Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters', in Brenner SC; Shparlinski I; Shu C-W; Szyld D (ed.), 75 Years of Mathematics of Computation, American Mathematical Society, pp. 93 - 113, http://dx.doi.org/10.1090/conm/754/15150

Kaszian J; Moree P; Shparlinski I, 2018, 'Periodic structure of the exponential pseudorandom number generator', in Applied Algebra and Number Theory, Cambridge University Press, pp. 190 - 203

Ostafe A; Shparlinski IE, 2017, 'Orbits of algebraic dynamical systems in subgroups and subfields', in Elsholtz C; Grabner P (ed.), Number Theory - Diophantine Problems, Uniform Distribution and Applications: Festschrift in Honour of Robert F. Tichy's 60th Birthday, Springer, pp. 347 - 368, http://dx.doi.org/10.1007/978-3-319-55357-3_18

Kaszián J; Moree P; Shparlinski IE, 2014, 'Periodic structure of the exponential pseudorandom number generator', in Applied Algebra and Number Theory, Cambridge University Press, pp. 190 - 203, http://dx.doi.org/10.1017/cbo9781139696456.012

Shparlinski IE, 2013, 'Additive Combinatorics over Finite Fields: New Results and Applications', in Finite Fields and Their Applications, DE GRUYTER, pp. 233 - 272, http://dx.doi.org/10.1515/9783110283600.233

Cillerueloa J; Lucab F; Shparlinskic IE, 2011, 'Power values of palindromes', in Frontiers of Combinatorics and Number Theory, pp. 103 - 110

Shparlinski I, 2011, 'Computational Diffie-Hellman Problem', in Encyclopedia of Cryptography and Security, Springer US, pp. 240 - 244, http://dx.doi.org/10.1007/978-1-4419-5906-5_882

Murty R; Shparlinski I, 2007, 'GROUP STRUCTURE OF ELLIPTIC CURVES OVER FINITE FIELDS AND APPLICATIONS', in Garcia A; Stichtenoth H (ed.), TOPICS IN GEOMETRY, CODING THEORY AND CRYPTOGRAPHY, SPRINGER, pp. 167 - 198, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000267348300005&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Shparlinski I, 2003, '1/M Generator', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 279 - 282, http://dx.doi.org/10.1007/978-3-0348-8037-4_26

Shparlinski I, 2003, 'Approximation of the Discrete Logarithm by Boolean Functions', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 129 - 141, http://dx.doi.org/10.1007/978-3-0348-8037-4_11

Shparlinski I, 2003, 'Approximation of the Discrete Logarithm by Real Polynomials', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 143 - 156, http://dx.doi.org/10.1007/978-3-0348-8037-4_12

Shparlinski I, 2003, 'Approximation of the Discrete Logarithm Modulo p', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 109 - 122, http://dx.doi.org/10.1007/978-3-0348-8037-4_9

Shparlinski I, 2003, 'Approximation of the Discrete Logarithm Modulo p — 1', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 123 - 128, http://dx.doi.org/10.1007/978-3-0348-8037-4_10

Shparlinski I, 2003, 'Arithmetic Functions', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 67 - 81, http://dx.doi.org/10.1007/978-3-0348-8037-4_6

Shparlinski I, 2003, 'Basic Notation and Definitions', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 17 - 26, http://dx.doi.org/10.1007/978-3-0348-8037-4_2

Shparlinski I, 2003, 'Bit Security of NTRU', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 223 - 229, http://dx.doi.org/10.1007/978-3-0348-8037-4_21

Shparlinski I, 2003, 'Bit Security of the Diffie—Hellman Secret Key', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 189 - 194, http://dx.doi.org/10.1007/978-3-0348-8037-4_15

Shparlinski I, 2003, 'Bit Security of the RSA Encryption and the Shamir Message Passing Scheme', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 211 - 215, http://dx.doi.org/10.1007/978-3-0348-8037-4_19

Shparlinski I, 2003, 'Bit Security of the XTR and LUC Secret Keys', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 217 - 221, http://dx.doi.org/10.1007/978-3-0348-8037-4_20

Shparlinski I, 2003, 'Boolean Complexity of the Diffie-Hellman Secret Key', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 179 - 188, http://dx.doi.org/10.1007/978-3-0348-8037-4_14

Shparlinski I, 2003, 'Complexity Theory', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 103 - 106, http://dx.doi.org/10.1007/978-3-0348-8037-4_8

Shparlinski I, 2003, 'Concluding Remarks and Open Questions', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 341 - 365, http://dx.doi.org/10.1007/978-3-0348-8037-4_33

Shparlinski I, 2003, 'Distribution and Discrepancy', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 61 - 65, http://dx.doi.org/10.1007/978-3-0348-8037-4_5

Shparlinski I, 2003, 'Distribution of the ElGamal Signature', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 207 - 210, http://dx.doi.org/10.1007/978-3-0348-8037-4_18

Shparlinski I, 2003, 'Distribution of the RSA and Exponential Pairs', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 231 - 237, http://dx.doi.org/10.1007/978-3-0348-8037-4_22

Shparlinski I, 2003, 'Exponential Sums', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 37 - 60, http://dx.doi.org/10.1007/978-3-0348-8037-4_4

Shparlinski I, 2003, 'Exponentiation and Inversion with Precomputation', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 239 - 245, http://dx.doi.org/10.1007/978-3-0348-8037-4_23

Shparlinski I, 2003, 'Introduction', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 1 - 14, http://dx.doi.org/10.1007/978-3-0348-8037-4_1

Shparlinski I, 2003, 'Inversive, Polynomial and Quadratic Exponential Generators', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 283 - 294, http://dx.doi.org/10.1007/978-3-0348-8037-4_27

Shparlinski I, 2003, 'Lattices and the Hidden Number Problem', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 83 - 102, http://dx.doi.org/10.1007/978-3-0348-8037-4_7

Shparlinski I, 2003, 'Naor—Reingold Function', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 271 - 277, http://dx.doi.org/10.1007/978-3-0348-8037-4_25

Shparlinski I, 2003, 'Polynomial Approximation and Arithmetic Complexity of the Diffie-Hellman Secret Key', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 159 - 177, http://dx.doi.org/10.1007/978-3-0348-8037-4_13

Shparlinski I, 2003, 'Polynomial Approximation, Permanents and Noisy Exponentiation in Finite Fields', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 325 - 332, http://dx.doi.org/10.1007/978-3-0348-8037-4_31

Shparlinski I, 2003, 'Polynomials and Recurrence Sequences', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 27 - 36, http://dx.doi.org/10.1007/978-3-0348-8037-4_3

Shparlinski I, 2003, 'RSA and Blum—Blum—Shub Generators', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 249 - 270, http://dx.doi.org/10.1007/978-3-0348-8037-4_24

Shparlinski I, 2003, 'Security Against the Cycling Attack on the RSA and Timed-release Crypto', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 197 - 200, http://dx.doi.org/10.1007/978-3-0348-8037-4_16

Shparlinski I, 2003, 'Special Polynomials and Boolean Functions', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 333 - 339, http://dx.doi.org/10.1007/978-3-0348-8037-4_32

Shparlinski I, 2003, 'Square-Freeness Testing and Other Number-Theoretic Problems', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 303 - 308, http://dx.doi.org/10.1007/978-3-0348-8037-4_29

Shparlinski I, 2003, 'Subset Sum Generators', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 295 - 299, http://dx.doi.org/10.1007/978-3-0348-8037-4_28

Shparlinski I, 2003, 'The Insecurity of the Digital Signature Algorithm with Partially Known Nonces', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 201 - 206, http://dx.doi.org/10.1007/978-3-0348-8037-4_17

Shparlinski I, 2003, 'Trade-off Between the Boolean and Arithmetic Depths of Modulo p Functions', in Cryptographic Applications of Analytic Number Theory, Birkhäuser Basel, pp. 309 - 323, http://dx.doi.org/10.1007/978-3-0348-8037-4_30

Shparlinski IE, 2002, 'EXPONENTIAL SUMS IN CODING THEORY, CRYPTOLOGY AND ALGORITHMS', in Coding Theory and Cryptology, CO-PUBLISHED WITH SINGAPORE UNIVERSITY PRESS, pp. 323 - 383, http://dx.doi.org/10.1142/9789812388841_0009

Back to profile page