Black-Box Models of Computation in Cryptology 2012th Edition
4.0 (127 items)
Limited Time Sale$32.99 cheaper than the new price!!
Free cash-on-delivery fees for purchases over $99
Product details
| Management number | 222238993 | Release Date | 2026/05/04 | List Price | $22.00 | Model Number | 222238993 | ||
|---|---|---|---|---|---|---|---|---|---|
| Category | |||||||||
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? Read more
| ISBN10 | 3834819891 |
|---|---|
| ISBN13 | 978-3834819895 |
| Edition | 2012th |
| Language | English |
| Publisher | Vieweg+Teubner Verlag |
| Dimensions | 5.83 x 0.23 x 8.27 inches |
| Item Weight | 4.8 ounces |
| Print length | 98 pages |
| Publication date | March 22, 2012 |
Mathematical Analysis
T-Shirts
Correction of product information
If you notice any omissions or errors in the product information on this page, please use the correction request form below.
Correction Request Form