Igor Shparlinski – författare
Visar alla böcker från författaren Igor Shparlinski. Handla med fri frakt och snabb leverans.
18 produkter
Character Sums with Exponential Functions and their Applications
Av Sergei Konyagin, Igor Shparlinski m. fl.
Inbunden, 1999
1987 kr
Lägg i varukorg
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) …
Finite Fields: Theory and Computation
The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography
Inbunden, 1999
2180 kr
Lägg i varukorg
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 …
Number Theory and Related Fields
In Memory of Alf van der Poorten
Av Jonathan M. Borwein, Igor Shparlinski m. fl.
Inbunden, 2013
1095 kr
Lägg i varukorg
“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 and Related Fields
In Memory of Alf van der Poorten
Av Wadim Zudilin, Igor Shparlinski m. fl.
E-bok, 2013
1427 kr
Lägg i varukorg
“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 and Related Fields
In Memory of Alf van der Poorten
Av Jonathan M. Borwein, Igor Shparlinski m. fl.
Häftad, 2015
1095 kr
Lägg i varukorg
“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 …
Cryptographic Applications of Analytic Number Theory
Complexity Lower Bounds and Pseudorandomness
E-bok, 2013
1459 kr
Lägg i varukorg
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 …
Cryptography and Computational Number Theory
Av Chaoping Xing, Huaxiong Wang m. fl.
E-bok, 2013
710 kr
Lägg i varukorg
This volume contains the refereed proceedings of the Workshop on Cryptography and Computational Number Theory, CCNT''99, which has been held in Singapore during the week of November 22-26, 1999. The workshop was organized by the Centre for Systems Security of the Na tional University of Singapore. …
Number Theoretic Methods in Cryptography
Complexity lower bounds
E-bok, 2012
718 kr
Lägg i varukorg
The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. …
Cryptographic Applications of Analytic Number Theory
Complexity Lower Bounds and Pseudorandomness
Häftad, 2013
1095 kr
Lägg i varukorg
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 …
Cryptography and Computational Number Theory
Av Kwok Y. Lam, Igor Shparlinski m. fl.
Häftad, 2012
551 kr
Lägg i varukorg
This volume contains the refereed proceedings of the Workshop on Cryptography and Computational Number Theory, CCNT'99, which has been held in Singapore during the week of November 22-26, 1999. The workshop was organized by the Centre for Systems Security of the Na tional University of Singapore. …
Number Theoretic Methods in Cryptography
Complexity lower bounds
Häftad, 2012
551 kr
Lägg i varukorg
The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. …
Number Theoretic Methods in Cryptography
Complexity lower bounds
Inbunden, 1999
551 kr
Lägg i varukorg
The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. …
Cryptographic Applications of Analytic Number Theory
Complexity Lower Bounds and Pseudorandomness
Av Igor Shparlinski, Igor Shparlinski
Inbunden, 2002
1095 kr
Lägg i varukorg
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 …
Finite Fields: Theory and Computation
The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography
Häftad, 2010
2183 kr
Lägg i varukorg
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 …
Computational and Algorithmic Problems in Finite Fields
Häftad, 2012
551 kr
Lägg i varukorg
'Et moi, ...* si j'avait su comment en revenir. je One service mathematics bas rendemI !be n'y semis point a1J6.' human race. It bas put common sense back JulesVeme where it belongs. on tile topmost sbelf next to tile dusty canister labelled 'discarded nonsense'. The series is divergent; therefore …
Finite Fields: Theory and Computation
The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography
E-bok, 2013
2925 kr
Lägg i varukorg
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 …
NUMBER THEORETIC AND ALGEBRAIC METHODS IN COMPUTER SCIENCE - PROCEEDINGS OF THE INTERNATIONAL CONFERENCE
Av IGOR SHPARLINSKI ET ALF J VAN D POORTEN, Alf J van der Poorten m. fl.
Inbunden, 1995
1284 kr
Tillfälligt slut
NTAMCS '93 brought to Moscow researchers from areas of computer science and mathematics that traditionally have been apart, but which use similar number theoretic and algebraic methods. An incomplete list of such areas includes cryptography, coding theory, computational algebra and number theory, …
