Black-Box Models of Computation in Cryptology
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?
90 pages; ISBN 9783834819901
, or download in
Title: Black-Box Models of Computation in Cryptology
Author: Tibor Jager
Measurement in Medicine 2011 US$ 44.00 350 pages
Probabilistic Forecasting and Bayesian Data Assimilation 2015 US$ 44.00 310 pages
- Academic > Mathematics > General > Vinogradov, Ivan Matveevich, 1891-
- Academic > Mathematics > General > Mathematics; Periodicals
- Academic > Mathematics > General > Algebraic logic
- Academic > Mathematics > General > Algebra, Boolean
- Academic > Logic > Algebraic logic
- Academic > Logic > Algebra, Boolean