Black-Box Models of Computation in Cryptology
Tibor Jager
Verkauft von Buchpark, Trebbin, Deutschland
AbeBooks-Verkäufer seit 30. September 2021
Gebraucht - Softcover
Zustand: Gebraucht - Gut
Anzahl: 1 verfügbar
In den Warenkorb legenVerkauft von Buchpark, Trebbin, Deutschland
AbeBooks-Verkäufer seit 30. September 2021
Zustand: Gebraucht - Gut
Anzahl: 1 verfügbar
In den Warenkorb legenZustand: Gut | Seiten: 86 | Sprache: Englisch | Produktart: Bücher.
Bestandsnummer des Verkäufers 11960314/13
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?
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.