Black-Box Models of Computation in Cryptology
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...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Wiesbaden
Vieweg+Teubner Verlag
2012, 2012
|
| Edition: | 1st ed. 2012 |
| Subjects: | |
| Online Access: | |
| Collection: | Springer eBooks 2005- - Collection details see MPG.ReNa |
Table of Contents:
- Black-Box Models of Computation
- On Black-Box Ring Extraction and Integer Factorization
- On the Analysis of Cryptographic Assumptions in the Generic Ring Model
- The Generic Composite Residuosity Problem
- Semi-Generic Groups and Their Applications