Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Wiesbaden :
Vieweg+Teubner Verlag : Imprint: Vieweg+Teubner Verlag,
2012.
|
| Edición: | 1st ed. 2012. |
| Temas: | |
| Acceso en línea: | Texto Completo |
Tabla de Contenidos:
- 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.