---

＜E-Book＞
Black-Box Models of Computation in Cryptology / by Tibor Jager

Edition	1st ed. 2012.
Publisher	(Wiesbaden : Vieweg+Teubner Verlag : Imprint: Vieweg+Teubner Verlag)
Year	2012
Language	English
Size	XII, 86 p : online resource
Authors	*Jager, Tibor author SpringerLink (Online service)
Subjects	LCSH:Mathematics -- Data processing  All Subject Search FREE:Computational Mathematics and Numerical Analysis
Notes	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 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? HTTP:URL=https://doi.org/10.1007/978-3-8348-1990-1

 Similar Items