Click Here to Download: https://ouo.io/5PIYEZW Black-Box Models of Computation in Cryptology By: Tibor Jager Publisher: Vieweg+Teubner Verlag Print ISBN: 9783834819895, 3834819891 eText ISBN: 9783834819901, 3834819905 Copyright year: 2012 Format: PDF Available from $ 84.99 USD SKU 9783834819901 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?
