

Black-Box Models of Computation in Cryptology
Kurzinformation



inkl. MwSt. Versandinformationen
Artikel zZt. nicht lieferbar
Artikel zZt. nicht lieferbar

Beschreibung
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? von Jager, Tibor
Produktdetails

So garantieren wir Dir zu jeder Zeit Premiumqualität.
Über den Autor
Dr. Tibor Jager completed his doctoral thesis at the Horst Görtz Institute for IT Security at Ruhr-Universität Bochum under the supervision of Prof. Dr. Jörg Schwenk. He is now a postdoctoral researcher at the Karlsruhe Institute of Technology.
- Kartoniert
- 192 Seiten
- Erschienen 2021
- The MIT Press
- paperback
- 369 Seiten
- Erschienen 1993
- Springer
- paperback
- 340 Seiten
- Erschienen 2009
- Vieweg+Teubner Verlag
- Kartoniert
- 440 Seiten
- Erschienen 2016
- Springer Vieweg
- Hardcover
- 504 Seiten
- Erschienen 1973
- Springer
- Hardcover
- 228 Seiten
- Erschienen 1989
- Springer