topmenu
Wyniki wyszukiwania:
wyszukanych pozycji: 10
 |
Computational and Algorithmic Problems in Finite Fields
ISBN: 9789401047968 / Angielski / Miękka / 2012 / 240 str. Termin realizacji zamówienia: ok. 20 dni roboczych. '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 we may be Eric T.BeIl able to do something with il O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and nonlineari- ties abound. Similarly, all kinds of pans of mathematics serve as tools for other pans and for other sci- ences. Applying a simple...
'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 ...
|
cena:
194,08 zł |
 |
Finite Fields: Theory and Computation: The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography
ISBN: 9789048152032 / Angielski / Miękka / 2010 / 528 str. Termin realizacji zamówienia: ok. 20 dni roboczych. 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- clude two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number gener- ators, modular arithmetic,...
This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding ir...
|
cena:
776,43 zł |
 |
Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness
ISBN: 9783034894159 / Angielski / Miękka / 2013 / 414 str. Termin realizacji zamówienia: ok. 20 dni roboczych. 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 number theoretic techniques such as sieve methods and lattice reduction algorithms are used as well. The book also contains a number of open problems and proposals for further research. The...
The book introduces new techniques that imply rigorous lower bounds on the com- plexity of some number-theoretic and cryptographic problems. It also e...
|
cena:
388,20 zł |
 |
Number Theoretic Methods in Cryptography: Complexity Lower Bounds
ISBN: 9783764358884 / Angielski / Twarda / 1999 / 182 str. Termin realizacji zamówienia: ok. 20 dni roboczych. 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. It also contains a number of open problems and proposals for further research. We obtain several lower bounds, exponential in terms of logp, on the de grees and orders of polynomials; algebraic functions; Boolean functions; linear recurring sequences; coinciding with values of the discrete logarithm...
The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These meth...
|
cena:
194,08 zł |
 |
Number Theoretic Methods in Cryptography: Complexity Lower Bounds
ISBN: 9783034897235 / Angielski / Miękka / 2012 / 182 str. Termin realizacji zamówienia: ok. 20 dni roboczych. 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. It also contains a number of open problems and proposals for further research. We obtain several lower bounds, exponential in terms of logp, on the de- grees and orders of - polynomials; - algebraic functions; - Boolean functions; - linear recurring sequences; coinciding with values of the discrete...
The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These meth...
|
cena:
194,08 zł |
 |
Finite Fields: Theory and Computation: The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography
ISBN: 9780792356622 / Angielski / Twarda / 1999 / 528 str. Termin realizacji zamówienia: ok. 20 dni roboczych. 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- clude two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number gener- ators, modular arithmetic,...
This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding ir...
|
cena:
776,43 zł |
 |
Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness
ISBN: 9783764366544 / Angielski / Twarda / 2002 / 414 str. Termin realizacji zamówienia: ok. 20 dni roboczych. 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 number theoretic techniques such as sieve methods and lattice reduction algorithms are used as well. The book also contains a number of open problems and proposals for further research. The...
The book introduces new techniques that imply rigorous lower bounds on the com plexity of some number-theoretic and cryptographic problems. It also es...
|
cena:
388,20 zł |
 |
Computational and Algorithmic Problems in Finite Fields
ISBN: 9780792320579 / Angielski / Twarda / 1992 / 240 str. Termin realizacji zamówienia: ok. 13-18 dni roboczych. This volume presents an exhaustive treatment of computation and algorithms for finite fields.
This volume presents an exhaustive treatment of computation and algorithms for finite fields.
|
cena:
594,13 zł |
 |
Cryptography and Computational Number Theory
ISBN: 9783034895071 / Angielski / Miękka / 2012 / 378 str. Termin realizacji zamówienia: ok. 20 dni roboczych. 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. We gratefully acknowledge the financial support from the Singapore National Science and Technology Board under the grant num- ber RP960668/M. The idea for this workshop grew out of the recognition of the recent, rapid development in various areas of cryptography and computational number the- ory....
This volume contains the refereed proceedings of the Workshop on Cryptography and Computational Number Theory, CCNT'99, which has been held in Singapo...
|
cena:
194,08 zł |
 |
Cryptography and Computational Number Theory: Workshop in Singapore, 1999
ISBN: 9783764365103 / Angielski / Twarda / 2001 / 392 str. Termin realizacji zamówienia: ok. 10-14 dni roboczych. The fields of cryptography and computational number theory have recently witnessed a rapid development, which was the subject of the CCNT workshop in Singapore in November 1999. Its aim was to stimulate further research in information and computer security as well as the design and implementation of number theoretic cryptosystems and other related areas. Another achievement of the meeting was the collaboration of mathematicians, computer scientists, practical cryptographers and engineers in academia, industry and government. The present volume comprises a selection of refereed papers...
The fields of cryptography and computational number theory have recently witnessed a rapid development, which was the subject of the CCNT workshop in ...
|
cena:
410,29 zł |
Czytaj nas na:
Zobacz: Księgarnia Czeska | Wydawnictwo Książkowe Klimaty | Mapa strony | Lista autorów
KrainaKsiazek.PL - Księgarnia Internetowa
KrainaKsiazek.PL - Księgarnia Internetowa
