# BlackBox Models of Computation in Cryptology

Tibor Jager - Black-Box Models of Computation in Cryptology

Published: 2012-03-23 | ISBN: 3834819891 | PDF | 86 pages | 0.5 MB

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?

Published: 2012-03-23 | ISBN: 3834819891 | PDF | 86 pages | 0.5 MB

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?

**No Other Mirrors, Please!****NitroFlare****Publish2me**

**
**

### Related books

- WALCOM Algorithms and Computation 10th International Workshop WALCOM 2016
- Algorithms and Computation 26th International Symposium ISAAC 2015 Nagoya Japan
- Algorithms and Computation
- Fundamental Algorithms for Permutation Groups
- Boolean Functions and Computation Models
- Emotion Modeling Towards Pragmatic Computational Models of Affective Processes
- FaultTolerant Search Algorithms Reliable Computation with Unreliable Information
- Graph Algorithms in the Language of Linear Algebra
- Limits of Computation An Introduction to the Undecidable and the Intractable
- Quantum Computational Number Theory

### Comments for "BlackBox Models of Computation in Cryptology"