Black-Box Models of Computation in Cryptology

  • Tibor┬áJager

Table of contents

  1. Front Matter
    Pages I-XII
  2. Tibor Jager
    Pages 1-3
  3. Tibor Jager
    Pages 5-13
  4. Back Matter
    Pages 77-86

About this book

Introduction

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?

Keywords

Black-Box Models of Computation Computational Complexity Computational Number Theory and Algebra Cryptographic Hardness Assumptions Generic Group Model

Authors and affiliations

  • Tibor┬áJager
    • 1
  1. 1.VelbertGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-8348-1990-1
  • Copyright Information Springer Spektrum | Springer Fachmedien Wiesbaden 2012
  • Publisher Name Vieweg+Teubner Verlag
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-8348-1989-5
  • Online ISBN 978-3-8348-1990-1
  • About this book