Overview
- Black-Box Models of Computation
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (6 chapters)
Keywords
About this book
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?
Authors and Affiliations
About the author
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.
Bibliographic Information
Book Title: Black-Box Models of Computation in Cryptology
Authors: Tibor Jager
DOI: https://doi.org/10.1007/978-3-8348-1990-1
Publisher: Vieweg+Teubner Verlag Wiesbaden
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer Spektrum | Springer Fachmedien Wiesbaden 2012
Softcover ISBN: 978-3-8348-1989-5Published: 22 March 2012
eBook ISBN: 978-3-8348-1990-1Published: 23 March 2012
Edition Number: 1
Number of Pages: XII, 86