Black-Box Models of Computation in Cryptology (PDF)
- Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Generic group algorithms solve computational problems defined over algebraic groups without exploiting properties of a particular representation of group elements. This is modeled by treating the group as a black-box. The fact that a computational problem cannot be solved by a reasonably restricted class of algorithms may be seen as support towards the conjecture that the problem is also hard in the classical Turing machine model. Moreover, a lower complexity bound for certain algorithms is a helpful insight for the search for cryptanalytic algorithms.
Tibor Jager addresses several fundamental questions concerning algebraic black-box models of computation: Are the generic group model and its variants a reasonable abstraction? What are the limitations of these models? Can we relax these models to bring them closer to the reality?
- Autor: Tibor Jager
- 2012, 2012, 86 Seiten, Englisch
- Verlag: Vieweg+Teubner Verlag
- ISBN-10: 3834819905
- ISBN-13: 9783834819901
- Erscheinungsdatum: 23.03.2012
Abhängig von Bildschirmgrösse und eingestellter Schriftgrösse kann die Seitenzahl auf Ihrem Lesegerät variieren.
- Dateiformat: PDF
- Grösse: 0.75 MB
- Ohne Kopierschutz
- Vorlesefunktion
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Black-Box Models of Computation in Cryptology".
Kommentar verfassen