Black-Box Models of Computation in Cryptology 2012th Edition

Ebook Details


Tibor Jager

Year 2012
Pages 86
Publisher Vieweg+Teubner Verlag
Language en
ISBN 9783834819895
File Size 507.97 KB
File Format PDF
Download Counter 115
Amazon Link

Ebook Description

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.