Black-Box Models of Computation in Cryptology

by Tibor Jager

2021-01-18 03:55:29

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 pr... Read more

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?

Less

Book Details

ISBN9783834819895

Compare Prices

Store Availability Book Format Condition Price
Indigo Books & Music In Stock Buy CAD 112.85
Indigo Books & MusicIn Stock
Format
Condition
Buy CAD 112.85
Available Discount
No Discount available

Join us and get access to all
your favourite books

Sign up for free and start exploring thousands of eBooks today.

Sign up for free