 | |
  | |
| Searching ... |
| 0 % | ||
| Only Books by Igor Shparlinski | X |
  | | Applied Algebra, Algebraic Algorithms and Error-Correcting Codes(2001st Edition) 14th International Symposium, AAECC-14, Melbourne, Australia, November 26-30, 2001. Proceedings (Lecture Notes in Computer Science) by Serdar Boztas, Igor E. Shparlinski Paperback, 404 Pages, Published 2008 by Springer ISBN-13: 978-3-540-42911-1, ISBN: 3-540-42911-5 "The AAECC Symposia Series was started in 1983 by Alain Poli (Toulouse), who, together with R. Desq, D. Lazard, and P. Camion, organized the ?rst conference. Originally the acronym AAECC meant "Applied Algebra and Error-Correcting Codes". Over the years its meaning has shifted to "Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes", re?ecting the growing importance of complexity in both decoding ..." |
 | | Character Sums with Exponential Functions and Their Applications by Igor Shparlinski, Sergei Konyagin ISBN-13: 978-0-511-14804-0, ISBN: 0-511-14804-6 |
 | | Recurrence Sequences (Mathematical Surveys and Monographs) by Graham Everest, Igor Shparlinski, Thomas Ward Paperback, 318 Pages, Published 2015 by American Mathematical Society ISBN-13: 978-1-4704-2315-5, ISBN: 1-4704-2315-4 "Recurrence sequences are of great intrinsic interest and have been a central part of number theory for many years. Moreover, these sequences appear almost everywhere in mathematics and computer science. This book surveys the modern theory of linear recurrence sequences and their generalizations. Particular emphasis is placed on the dramatic impact that sophisticated methods from Diophantine analysis and transcendence theory have had on ..." |
 | | Number Theory and Related Fields In Memory of Alf van der Poorten by Jonathan M. Borwein, Igor Shparlinski, Wadim Zudilin 395 Pages, Published 2013 by Springer Science & Business Media ISBN-13: 978-1-4614-6642-0, ISBN: 1-4614-6642-3 "... Alf and Jeffrey Shallit show that the continued fraction expansion of 2::1XF", where {Fn} are the Fibonacci numbers, has partial quotients of unbounded degree but shows that they are degree g 3 or XF",XL"+2 or XL'PF2 — XF"+1, where {Ln} are the Lucas numbers, Ln I Fnzl +Fn+1. Publication144 is closely linked to115 and to a number of papers by Jeffrey Shallit, MMF and others. Let gg (X) I 28,-r2" and hg(X) IXgg(X) iZO where 80 I ..." |
 | | Character Sums with Exponential Functions and their Applications (Cambridge Tracts in Mathematics) by Sergei Konyagin, Igor Shparlinski Printed Access Code, Published 2010 by Cambridge University Press ISBN-13: 978-0-511-54293-0, ISBN: 0-511-54293-3 "The theme of this book is the study of the distribution of integer powers modulo a prime number. It provides numerous new, sometimes quite unexpected, links between number theory and computer science as well as to other areas of mathematics. Possible applications include (but are not limited to) complexity theory, random number generation, cryptography, and coding theory. The main method discussed is based on bounds of exponential sums. ..." |
 | | Cambridge Tracts in Mathematics Character Sums with Exponential Functions and Their Applications 136 by Sergei Konyagin, Igor Shparlinski Published 2007 ISBN-13: 978-0-511-03656-9, ISBN: 0-511-03656-6 |
 | | Recurrence Sequences(1st Edition) by Editor-Graham Everest, Igor Shparlinski, Thomas Ward Hardcover, 318 Pages, Published 2003 by American Mathematical Society ISBN-13: 978-0-8218-3387-2, ISBN: 0-8218-3387-1 "Recurrence sequences are of great intrinsic interest and have been a central part of number theory for many years. Moreover, these sequences appear almost everywhere in mathematics and computer science. This book surveys the modern theory of linear recurrence sequences and their generalizations. Particular emphasis is placed on the dramatic impact that sophisticated methods from Diophantine analysis and transcendence theory have had on ..." |
 | | Character Sums with Exponential Functions and Their Applications. Cambridge Tracts in Mathematics by Igor Shparlinski, Sergei Konyagin Published 1999 ISBN-13: 978-1-280-43245-3, ISBN: 1-280-43245-4 |
 | | Character Sums with Exponential Functions and Their Applications by Igor Shparlinski Published 1999 ISBN-13: 978-0-511-04036-8, ISBN: 0-511-04036-9 |
 | | Frobenius Distributions Lang-Trotter and Sato-Tate Conjectures: Winter School on Frobenius Distributions on Curves February 17-21, 2014, Workshop on ... Marseille, France (Contemporary Mathematics) by David Kohel, Igor Shparlinski Paperback, 238 Pages, Published 2016 by American Mathematical Society ISBN-13: 978-1-4704-1947-9, ISBN: 1-4704-1947-5 "This volume contains the proceedings of the Winter School and Workshop on Frobenius Distributions on Curves, held from February 17-21, 2014 and February 24-28, 2014, at the Centre International de Rencontres Mathematiques, Marseille, France. This volume gives a representative sample of current research and developments in the rapidly developing areas of Frobenius distributions. This is mostly driven by two famous conjectures: the Sato- ..." |
 | | Number Theory and Related Fields In Memory of Alf van der Poorten (Springer Proceedings in Mathematics & Statistics) by Jonathan M. Borwein, Igor Shparlinski, Wadim Zudilin, Professor Jonathan Borwein Paperback, 395 Pages, Published 2015 by Springer ISBN-13: 978-1-4939-0217-0, ISBN: 1-4939-0217-2 "“Number Theory and Related Fields” collects contributions based on the proceedings of the "International Number Theory Conference in Memory of Alf van der Poorten," hosted by CARMA and held March 12-16th 2012 at the University of Newcastle, Australia. The purpose of the conference was to promote number theory research in Australia while commemorating the legacy of Alf van der Poorten, who had written over 170 papers on the topic of numb ..." |
 | | Number Theory and Related Fields In Memory of Alf van der Poorten (Springer Proceedings in Mathematics & Statistics) by Jonathan M. Borwein, Igor Shparlinski, Wadim Zudilin, Professor Jonathan Borwein Hardcover, 395 Pages, Published 2013 by Springer ISBN-13: 978-1-4614-6641-3, ISBN: 1-4614-6641-5 ""Number Theory and Related Fields" collects contributions based on the proceedings of the "International Number Theory Conference in Memory of Alf van der Poorten," hosted by CARMA and held March 12-16th 2012 at the University of Newcastle, Australia. The purpose of the conference was to promote number theory research in Australia while commemorating the legacy of Alf van der Poorten, who had written over 170 ..." |
 | | Gems in Experimental Mathematics (Contemporary Mathematics) by Tewodros Amdeberhan, Luis A. Medina, Victor H. Moll, Gary Mcguire, Gary Mullen, Daniel Panario, Igor Shparlinski, American Mathematical Society Paperback, 413 Pages, Published 2010 by American Mathematical Society ISBN-13: 978-0-8218-4869-2, ISBN: 0-8218-4869-0 "These proceedings reflect the special session on Experimental Mathematics held January 5, 2009, at the Joint Mathematics Meetings in Washington, DC as well as some papers specially solicited for this volume. Experimental Mathematics is a recently structured field of Mathematics that uses the computer and advanced computing technology as a tool to perform experiments. These include the analysis of examples, testing of new ideas, and the ..." |
 | | Applied Algebra, Algebraic Algorithms and Error-Correcting Codes 14th International Symposium, AAECC-14, Melbourne, Australia, November 26-30, 2001. Proceedings by Serdar Boztas, Igor E. Shparlinski 404 Pages, Published 2003 by Springer ISBN-13: 978-3-540-45624-7, ISBN: 3-540-45624-4 "... Serdar Boztas, Igor E. Shparlinski. Organization. Steering Committee General Chair: Conference Co-chair: Program Chair: Program Co-chair: Publication: Kathy Horadam (RMIT Univ., AUS) Tom Høholdt (Technical Univ. of Denmark, DK) Igor ..." |
 | | Cryptographic Applications of Analytic Number Theory(Reprint) Complexity Lower Bounds and Pseudorandomness (Progress in Computer Science and Applied Logic) by Igor Shparlinski Paperback, 414 Pages, Published 2013 by Birkhäuser ISBN-13: 978-3-0348-9415-9, ISBN: 3-0348-9415-5 "The book introduces new techniques that imply rigorous lower bounds on the com plexity of some number-theoretic and cryptographic problems. It also establishes certain attractive pseudorandom properties of various cryptographic primitives. These methods and techniques are based on bounds of character sums and num bers of solutions of some polynomial equations over finite fields and residue rings. Other numb ..." |
 | | Progress in Computer Science and Applied Logic Cryptographic Applications of Analytic Number Theory : Complexity Lower Bounds and Pseudorandomness 22 by Igor Shparlinski 414 Pages, Published 2013 by Birkhäuser ISBN-13: 978-3-0348-8037-4, ISBN: 3-0348-8037-5 "Complexity Lower Bounds and Pseudorandomness Igor Shparlinski. |221] |222 | 223 |224| |225) (226 |227 |228 |229 |230| (231] (232) |233 M. I. González Vasco, M. Näslund and I. E. Shparlinski, 'The hidden number problem in ... C. Gotsman and N. Linial, “Spectral properties of threshold functions', Combinatorica, 14 ( 1994), 35–50. L. Goubin, C. Mauduit and A. Sárközy, 'Construction of large families of pseudo-random binary sequences', ..." |
 | | Mathematics and Its Applications Finite Fields: Theory and Computation : The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography 477 by Igor Shparlinski 528 Pages, Published 2013 by Springer Science & Business Media ISBN-13: 978-94-015-9239-0, ISBN: 94-015-9239-X "Then decryption algorithm is trivial, it consists of multiplication by M", a decoding algorithm of the code C, and multiplication by P*. Several modifications and possible advantages and disadvantages of such cryptosystems are discussed in [ 456, 458, 929, 1035, 1363, 2791, 2997]. A new public-key cryptosystem related to arithmetic of finite field is proposed in 2058]. It is based on the assumed difficulty of finding a binary vector ..." |
 | | Progress in Computer Science and Applied Logic Cryptography and Computational Number Theory 20 by Kwok Y. Lam, Igor Shparlinski, Huaxiong Wang, Chaoping Xing 378 Pages, Published 2013 by Birkhäuser ISBN-13: 978-3-0348-8295-8, ISBN: 3-0348-8295-5 "[11] E. Bach and J. Shallit: Algorithmic number theory, MIT Press, 1996. [12] J. Brandt and I. Damgård: On generation of probable primes by incremental search. In Ernest F. Brickell, editor, Advances in Cryptology – CRYPTO'92, LNCS 740, pp . ... 305-324. [22] http://www.inf.ethz.ch/ mihailes, Homepage of Cyclotomy, Preda Mihăilescu. [23] M. Deuring: Die Typen der Multiplikatorenringe elliptischer Funktionenkörper, Abh. Math. Sem. Ha ..." |
 | | Computational and Algorithmic Problems in Finite Fields (Mathematics and its Applications) by Igor Shparlinski Paperback, 240 Pages, Published 2013 by Springer ISBN-13: 978-94-010-4796-8, ISBN: 94-010-4796-0 "This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other araes of mathematics. For completeness, also included are two special chapter ..." |
 | | Finite Fields(Reprint) Theory and Computation: The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography (Mathematics and Its Applications (closed)) by Igor Shparlinski Paperback, 528 Pages, Published 2010 by Springer ISBN-13: 978-90-481-5203-2, ISBN: 90-481-5203-8 "This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible and primitive polynomials, the distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types and new applications of finite fields to other areas of mathematics. For completeness we in clud ..." |
All Authors
All Bindings
All Editions
All Years
All Regions
Igor Shparlinski
All Bindings
All Editions
All Years
All Regions