Cryptographic Applications of Analytic Number Theory, Complexity Lower Bounds and Pseudorandomness
8 Angebote vergleichen
Bester Preis: Fr. 106.94 (€ 109.00)¹ (vom 04.12.2016)1
Cryptographic Applications of Analytic Number Theory, Complexity Lower Bounds and Pseudorandomness (2003)
EN HC NW
ISBN: 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
Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness
DE PB NW
ISBN: 9783034894159 bzw. 3034894155, in Deutsch, Birkhauser, Taschenbuch, neu.
Von Händler/Antiquariat, BuySomeBooks [52360437], Las Vegas, NV, U.S.A.
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
3
Cryptographic Applications of Analytic Number Theory
DE PB NW
ISBN: 9783034894159 bzw. 3034894155, in Deutsch, Birkhäuser, Taschenbuch, neu.
Lieferung aus: Deutschland, Versandkostenfrei.
buecher.de GmbH & Co. KG, [1].
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
buecher.de GmbH & Co. KG, [1].
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
4
Cryptographic Applications of Analytic Number Theory. Complexity Lower Bounds and Pseudorandomness (2013)
DE PB US
ISBN: 9783034894159 bzw. 3034894155, in Deutsch, Taschenbuch, gebraucht.
Von Händler/Antiquariat, Herb Tandree Philosophy Books [17426], Stroud, UK, United Kingdom.
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
5
Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness (2014)
DE PB NW
ISBN: 9783034894159 bzw. 3034894155, in Deutsch, Taschenbuch, neu.
Von Händler/Antiquariat, Books2Anywhere [190245], Fairford, GLO, United Kingdom.
New Book. This item is printed on demand. Shipped from UK. This item is printed on demand.
New Book. This item is printed on demand. Shipped from UK. This item is printed on demand.
6
Cryptographic Applications of Analytic Number Theory
DE NW EB
ISBN: 9783034880374 bzw. 3034880375, in Deutsch, Springer Nature, neu, E-Book.
Lieferung aus: Vereinigte Staaten von Amerika, Lagernd.
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
7
Cryptographic Applications of Analytic Number Theory. Complexity Lower Bounds and Pseudorandomness (2013)
DE NW
ISBN: 9783034894159 bzw. 3034894155, in Deutsch, neu.
Lieferung aus: Deutschland, Versandkostenfrei.
Von Händler/Antiquariat, Deastore [50723639], Roma, ROMA, Italy.
Language: english. Print On Demand.
Von Händler/Antiquariat, Deastore [50723639], Roma, ROMA, Italy.
Language: english. Print On Demand.
8
Cryptographic Applications of Analytic Number Theory : Complexity Lower Bounds and Pseudorandomness
DE NW EB DL
ISBN: 9783034880374 bzw. 3034880375, in Deutsch, Wiley, neu, E-Book, elektronischer Download.
Lieferung aus: Vereinigtes Königreich Grossbritannien und Nordirland, Despatched same working day before 3pm.
Lade…