Black-Box Models of Computation in Cryptology

by

Write The First Customer Review
Black-Box Models of Computation in Cryptology - Jager, Tibor
Filter Results
Shipping
Item Condition
Seller Rating
Other Options
Change Currency
Cash for Textbooks

Textbook Buyback

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 ...

Black-Box Models of Computation in Cryptology 2012, Vieweg+Teubner Verlag, Weisbaden

ISBN-13: 9783834819895

2012 edition

Paperback

Select