Von dem Buch Number Theoretic Methods in Cryptography: Complexity lower bounds (Progress in Computer Science and Applied Logic) haben wir 3 gleiche oder sehr ähnliche Ausgaben identifiziert!
Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
100%: Shparlinski, Igor: Number Theoretic Methods in Cryptography: Complexity lower bounds (Progress in Computer Science and Applied Logic) (ISBN: 9783034897235) 2012, Birkhäuser Okt 2012, in Deutsch, Taschenbuch.Nur diese Ausgabe anzeigen…
100%: Igor Shparlinski: Number Theoretic Methods in Cryptography : Complexity lower bounds (ISBN: 9783034886642) in Deutsch, auch als eBook.Nur diese Ausgabe anzeigen…
100%: Igor E Shparlinski: Number theoretic methods in cryptography: Complexity lower bounds (Progress in computer science and applied logic) (ISBN: 9780817658885) 1999, Birkhauser, in Englisch.
Nur diese Ausgabe anzeigen…
Nur diese Ausgabe anzeigen…
Number Theoretic Methods in Cryptography: Complexity lower bounds (Progress in Computer Science and Applied Logic)
8 Angebote vergleichen
| Preise | 2013 | 2014 | 2015 |
|---|---|---|---|
| Schnitt | Fr. 105.06 (€ 107.43)¹ | Fr. 93.41 (€ 95.52)¹ | Fr. 115.33 (€ 117.94)¹ |
| Nachfrage |
1
Number theoretic methods in cryptography: Complexity lower bounds (Progress in computer science and applied logic) (1999)
EN USISBN: 9780817658885 bzw. 0817658882, in Englisch, 180 Seiten, Birkhauser, gebraucht.
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, mygrandmasgoodies.
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 modulo a prime p at suf ficiently many points (the number of points can be as small as pI/He). 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 right most bit of the discrete logarithm and defines whether the argument is a quadratic residue. We also obtain non-trivial upper bounds on the de gree, sensitivity and Fourier coefficients of Boolean functions on bits of x deciding whether x is a quadratic residue. These results are used to obtain lower bounds on the parallel arithmetic and Boolean complexity of computing the discrete logarithm. For example, we prove that any unbounded fan-in Boolean circuit. of sublogarithmic depth computing the discrete logarithm modulo p must be of superpolynomial size. Unknown Binding, Label: Birkhauser, Birkhauser, Produktgruppe: Book, Publiziert: 1999, Studio: Birkhauser.
Von Händler/Antiquariat, mygrandmasgoodies.
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 modulo a prime p at suf ficiently many points (the number of points can be as small as pI/He). 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 right most bit of the discrete logarithm and defines whether the argument is a quadratic residue. We also obtain non-trivial upper bounds on the de gree, sensitivity and Fourier coefficients of Boolean functions on bits of x deciding whether x is a quadratic residue. These results are used to obtain lower bounds on the parallel arithmetic and Boolean complexity of computing the discrete logarithm. For example, we prove that any unbounded fan-in Boolean circuit. of sublogarithmic depth computing the discrete logarithm modulo p must be of superpolynomial size. Unknown Binding, Label: Birkhauser, Birkhauser, Produktgruppe: Book, Publiziert: 1999, Studio: Birkhauser.
2
Number Theoretic Methods in Cryptography
DE PB NWISBN: 9783034897235 bzw. 3034897235, 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
3
Number Theoretic Methods in Cryptography (2012)
DE PB NW RPISBN: 9783034897235 bzw. 3034897235, in Deutsch, Birkhäuser Okt 2012, Taschenbuch, neu, Nachdruck.
Von Händler/Antiquariat, AHA-BUCH GmbH [51283250], Einbeck, Germany.
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
4
Number Theoretic Methods in Cryptography. Complexity lower bounds (2012)
DE PB NWISBN: 9783034897235 bzw. 3034897235, in Deutsch, Birkhäuser, Taschenbuch, neu.
Von Händler/Antiquariat, Herb Tandree Philosophy Books [17426], Stroud, GLOS, 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
Number Theoretic Methods in Cryptography: Complexity lower bounds (Progress in Computer Science and Applied Logic) (2012)
DE PB NWISBN: 9783034897235 bzw. 3034897235, in Deutsch, Birkhaeuser, Taschenbuch, neu.
Von Händler/Antiquariat, Revaluation Books [2134736], Exeter, United Kingdom.
reprint edition. In Stock.
reprint edition. In Stock.
6
Number Theoretic Methods in Cryptography
DE NW EBISBN: 9783034886642 bzw. 3034886640, 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
Number Theoretic Methods in Cryptography: Complexity lower bounds (Progress in Computer Science and Applied Logic) (2012)
DE PB NW RPISBN: 9783034897235 bzw. 3034897235, in Deutsch, Birkhäuser, Taschenbuch, neu, Nachdruck.
Von Händler/Antiquariat, English-Book-Service - A Fine Choice [1048135], Waldshut-Tiengen, BW, Germany.
This item is printed on demand for shipment within 3 working days.
This item is printed on demand for shipment within 3 working days.
Lade…