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?
- Book Title Black-Box Models of Computation in Cryptology
- DOI https://doi.org/10.1007/978-3-8348-1990-1
- Copyright Information Springer Spektrum | Springer Fachmedien Wiesbaden 2012
- Publisher Name Vieweg+Teubner Verlag
- eBook Packages Mathematics and Statistics Mathematics and Statistics (R0)
- Softcover ISBN 978-3-8348-1989-5
- eBook ISBN 978-3-8348-1990-1
- Edition Number 1
- Number of Pages XII, 86
- Number of Illustrations 0 b/w illustrations, 0 illustrations in colour
Computational Mathematics and Numerical Analysis
- Buy this book on publisher's site