Black-Box Models of Computation in Cryptology (Paperback, 2012)

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?

General

Imprint:	Vieweg+teubner Verlag
Country of origin:	Germany
Release date:	March 2012
First published:	2012
Authors:	Tibor Jager
Dimensions:	210 x 148 x 5mm (L x W x T)
Format:	Paperback
Pages:	86
Edition:	2012
ISBN-13:	978-3-8348-1989-5
Categories:	Books > Reference & Interdisciplinary > Communication studies > Coding theory & cryptology Books > Science & Mathematics > Mathematics > Numerical analysis Books > Computing & IT > Applications of computing > Databases > Data security & data encryption Promotions
LSN:	3-8348-1989-1
Barcode:	9783834819895

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!