{"product_id":"9783834819895","title":"Black-Box Models of Computation in Cryptology","description":"\u003ch1\u003eBlack-Box Models of Computation in Cryptology\u003c\/h1\u003e \u003ch2\u003eJager, Tibor\u003c\/h2\u003e \u003cp\u003e\u003c\/p\u003e\u003cp\u003eGeneric 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.\u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003cp\u003eTibor 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?\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Vieweg+Teubner Verlag\u003c\/p\u003e \u003cp\u003ePublication Date: 2012-03-22\u003c\/p\u003e \u003cp\u003eFormat: Paperback\u003c\/p\u003e \u003cp\u003eISBN-13: 9783834819895\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-3-8348-1990-1\u003c\/p\u003e \u003cp\u003eDimensions: 210cm x148cm\u003c\/p\u003e \u003cp\u003ePages: 86\u003c\/p\u003e ","brand":"Vieweg+Teubner Verlag","offers":[{"title":"Default Title","offer_id":46547329351820,"sku":"9783834819895","price":49.49,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9783834819895.jpg?v=1775817414","url":"https:\/\/fh90cf-fv.myshopify.com\/products\/9783834819895","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}