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...

Full description

Bibliographic Details
Main Author: Jager, Tibor (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:English
Published: Wiesbaden : Vieweg+Teubner Verlag, 2012.
Subjects:
Online Access:Full Text via HEAL-Link
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.