Cryptographic Applications of Analytic Number Theory, Complexity Lower Bounds and Pseudorandomness
10 Angebote vergleichen
Bester Preis: Fr. 106.73 (€ 109.00)¹ (vom 04.12.2016)1
Cryptographic Applications of Analytic Number Theory, Complexity Lower Bounds and Pseudorandomness (2003)
EN HC NWISBN: 9780817666545 bzw. 0817666540, in Englisch, Birkhäuser, gebundenes Buch, neu.
Lieferung aus: Niederlande, Vermoedelijk 4-6 weken.
bol.com.
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 ... 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 emphasis is on obtaining unconditional rigorously proved statements. The bright side of this approach is that the results do not depend on any assumptions or conjectures. On the downside, the results are much weaker than those which are widely believed to be true. We obtain several lower bounds, exponential in terms of logp, on the degrees and orders of o polynomials; o algebraic functions; o Boolean functions; o linear recurrence sequences; coinciding with values of the discrete logarithm modulo a prime p at sufficiently many points (the number of points can be as small as pI/2+O:). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the rightmost bit of the discrete logarithm and defines whether the argument is a quadratic residue.Taal: Engels;Oorspronkelijke titel: Cryptographic Applications of Analytic Number Theory;Afmetingen: 0x0x0 mm;Gewicht: 0,00 gram;Verschijningsdatum: januari 2003;ISBN10: 0817666540;ISBN13: 9780817666545; Engelstalig | Hardcover | 2003.
bol.com.
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 ... 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 emphasis is on obtaining unconditional rigorously proved statements. The bright side of this approach is that the results do not depend on any assumptions or conjectures. On the downside, the results are much weaker than those which are widely believed to be true. We obtain several lower bounds, exponential in terms of logp, on the degrees and orders of o polynomials; o algebraic functions; o Boolean functions; o linear recurrence sequences; coinciding with values of the discrete logarithm modulo a prime p at sufficiently many points (the number of points can be as small as pI/2+O:). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the rightmost bit of the discrete logarithm and defines whether the argument is a quadratic residue.Taal: Engels;Oorspronkelijke titel: Cryptographic Applications of Analytic Number Theory;Afmetingen: 0x0x0 mm;Gewicht: 0,00 gram;Verschijningsdatum: januari 2003;ISBN10: 0817666540;ISBN13: 9780817666545; Engelstalig | Hardcover | 2003.
2
Finite Fields: Theory and Computation
EN HC NWISBN: 9780792356622 bzw. 0792356624, in Englisch, Springer Netherlands, gebundenes Buch, neu.
Lieferung aus: Deutschland, Versandkostenfrei.
buecher.de GmbH & Co. KG, [1].
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, etc.) and computational number theory (primality testing, factoring integers, computation in algebraic number theory, etc.). The problems considered here have many applications in Computer Science, Cod ing Theory, Cryptography, Numerical Methods, and so on. There are a few books devoted to more general questions, but the results contained in this book have not till now been collected under one cover. In the present work the author has attempted to point out new links among different areas of the theory of finite fields. It contains many very important results which previously could be found only in widely scattered and hardly available conference proceedings and journals. In particular, we extensively review results which originally appeared only in Russian, and are not well known to mathematicians outside the former USSR.2007. xiv, 528 S. XIV, 528 p. 234 mmVersandfertig in 3-5 Tagen, Hardcover.
buecher.de GmbH & Co. KG, [1].
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, etc.) and computational number theory (primality testing, factoring integers, computation in algebraic number theory, etc.). The problems considered here have many applications in Computer Science, Cod ing Theory, Cryptography, Numerical Methods, and so on. There are a few books devoted to more general questions, but the results contained in this book have not till now been collected under one cover. In the present work the author has attempted to point out new links among different areas of the theory of finite fields. It contains many very important results which previously could be found only in widely scattered and hardly available conference proceedings and journals. In particular, we extensively review results which originally appeared only in Russian, and are not well known to mathematicians outside the former USSR.2007. xiv, 528 S. XIV, 528 p. 234 mmVersandfertig in 3-5 Tagen, Hardcover.
3
Finite Fields - Theory and Computation (2007)
EN NW RPISBN: 9780792356622 bzw. 0792356624, in Englisch, Bertrams Print On Demand, neu, Nachdruck.
Lieferung aus: Deutschland, Versandkostenfrei.
AHA-BUCH GmbH, [4009276].
- Provides a survey of the achievements in the theory and applications of finite fields and in many related areas such as algebraic number theory, theoretical computer science, coding theory and cryptography. This book includes topics such as polynomial factorization over finite fields and constructing special bases of extensions of finite fields. - Besorgungstitel - vorauss. Lieferzeit 3-5 Tage.. H.
AHA-BUCH GmbH, [4009276].
- Provides a survey of the achievements in the theory and applications of finite fields and in many related areas such as algebraic number theory, theoretical computer science, coding theory and cryptography. This book includes topics such as polynomial factorization over finite fields and constructing special bases of extensions of finite fields. - Besorgungstitel - vorauss. Lieferzeit 3-5 Tage.. H.
4
Finite Fields: Theory and Computation: The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography (Mathematics and Its Applications) (1999)
EN HC NWISBN: 9780792356622 bzw. 0792356624, in Englisch, 528 Seiten, 1999. Ausgabe, Springer, gebundenes Buch, neu.
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, lana's Shop.
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, etc.) and computational number theory (primality testing, factoring integers, computation in algebraic number theory, etc.). The problems considered here have many applications in Computer Science, Cod ing Theory, Cryptography, Numerical Methods, and so on. There are a few books devoted to more general questions, but the results contained in this book have not till now been collected under one cover. In the present work the author has attempted to point out new links among different areas of the theory of finite fields. It contains many very important results which previously could be found only in widely scattered and hardly available conference proceedings and journals. In particular, we extensively review results which originally appeared only in Russian, and are not well known to mathematicians outside the former USSR. Hardcover, Ausgabe: 1999, Label: Springer, Springer, Produktgruppe: Book, Publiziert: 1999-05-31, Studio: Springer, Verkaufsrang: 5313659.
Von Händler/Antiquariat, lana's Shop.
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, etc.) and computational number theory (primality testing, factoring integers, computation in algebraic number theory, etc.). The problems considered here have many applications in Computer Science, Cod ing Theory, Cryptography, Numerical Methods, and so on. There are a few books devoted to more general questions, but the results contained in this book have not till now been collected under one cover. In the present work the author has attempted to point out new links among different areas of the theory of finite fields. It contains many very important results which previously could be found only in widely scattered and hardly available conference proceedings and journals. In particular, we extensively review results which originally appeared only in Russian, and are not well known to mathematicians outside the former USSR. Hardcover, Ausgabe: 1999, Label: Springer, Springer, Produktgruppe: Book, Publiziert: 1999-05-31, Studio: Springer, Verkaufsrang: 5313659.
5
Computational and Algorithmic Problems in Finite Fields (Mathematics and its Applications) (1992)
EN HC NW FEISBN: 9780792320579 bzw. 0792320573, in Englisch, 256 Seiten, Springer, gebundenes Buch, neu, Erstausgabe.
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, Any Book.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Von Händler/Antiquariat, Any Book.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
6
Computational and Algorithmic Problems in Finite Fields (Mathematics and its Applications) (1992)
EN HC US FEISBN: 9780792320579 bzw. 0792320573, in Englisch, 256 Seiten, Springer, gebundenes Buch, gebraucht, Erstausgabe.
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 24 hours.
Von Händler/Antiquariat, Bookbyte Textbooks.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Von Händler/Antiquariat, Bookbyte Textbooks.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
7
Finite Fields: Theory and Computation (Mathematics and Its Applications (closed)
ENISBN: 9780792356622 bzw. 0792356624, in Englisch, Kluwer Academic Publishers, Deutschland.
Von Händler/Antiquariat, BookSleuth [58350165], Sanford, NC, U.S.A.
Finite Fields: Theory and Computation (Mathematics and Its Applications (closed)).
Finite Fields: Theory and Computation (Mathematics and Its Applications (closed)).
8
Symbolbild
Finite Fields: Theory and Computation (Mathematics and Its Applications (closed)
EN USISBN: 9780792356622 bzw. 0792356624, in Englisch, Kluwer Academic Publishers, Deutschland, gebraucht.
Von Händler/Antiquariat, BookSleuth [58350165], Danville, CA, U.S.A.
Finite Fields: Theory and Computation (Mathematics and Its Applications (closed)).
Finite Fields: Theory and Computation (Mathematics and Its Applications (closed)).
9
Finite Fields: Theory and Computation The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography (1999)
~EN NWISBN: 0792356624 bzw. 9780792356622, vermutlich in Englisch, Springer Netherlands; Springer Netherland, neu.
Von Händler/Antiquariat, MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
10
Computational and Algorithmic Problems in Finite Fields
EN HC NWISBN: 9780792320579 bzw. 0792320573, in Englisch, Springer-Verlag New York, LLC, gebundenes Buch, neu.
Lieferung aus: Vereinigte Staaten von Amerika, Lagernd, zzgl. Versandkosten.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Lade…