Custom cover image
Black-Box Models of Computation in Cryptology / by Tibor Jager
Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink BücherPublisher: Wiesbaden : Vieweg+Teubner Verlag, 2012Description: Online-Ressource (XII, 86p, digital)ISBN:- 9783834819901
- 512
- 518
- QA71-90
Contents:
Summary: 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.Summary: 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?PPN: PPN: 1651393923Package identifier: Produktsigel: ZDB-2-SEB | ZDB-2-SXMS | ZDB-2-SMA
Foreword; Acknowledgements; Contents; 1 Introduction; 1.1 Outline of this Book; 2 Black-Box Models of Computation; 2.1 A General Black-Box Model; 2.2 The Generic Group Model; 2.3 The Generic Ring Model; 2.4 The Generic Bilinear Group Model; 3 On Black-Box Ring Extraction and Integer Factorization; 3.1 Motivation; 3.2 Results of This Chapter; 3.3 Related Work; 3.4 The Black-Box Ring Extraction Problem; 3.5 Main Result; 3.6 Implications; 3.7 Extensions; 4 Analysis of Cryptographic Assumptions in the Generic Ring Model; 4.1 Main Results; 4.2 Related Work; 4.3 Definitions
4.4 Straight Line Programs over the Ring ZN4.5 Subset Membership Problems in the Generic Ring Model; 4.6 Main Result; 4.7 Applications; 5 The Generic Composite Residuosity Problem; 5.1 Related Work; 5.2 Results of This Chapter; 5.3 Generic Decisional Composite Residuosity; 5.4 Why Theorem 4.1 is Not Applicable; 5.5 Hardness of Hensel-RSA Lifting; 5.6 Analysis of the Generic DCR Problem; 6 Semi-Generic Groups and Their Applications; 6.1 Motivation and Related Work; 6.2 Results of This Chapter; 6.3 An Extended Black-Box Model of Computation; 6.4 Semi-Generic Groups
6.5 Semi-Generic Bilinear Groups6.6 Weak Semi-Generic Bilinear Groups; 6.7 Strong Semi-Generic Bilinear Groups; Bibliography
No physical items for this record