Black-Box Models of Computation in Cryptology

Name: Black-Box Models of Computation in Cryptology
Price: 118.02 AUD
Availability: OutOfStock
ISBN: 9783834819895

Tibor Jager

$147.95 $118.02

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We will update you on expected arrival time to us. If this delay is too long, please let us know within 2 business days and we can give you options regarding cancelling or adjusting your order. More details on cancelling your order can be found in our Terms of Trade.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Vieweg+Teubner Verlag
22 March 2012

Coding theory & cryptology; Numerical analysis; Data encryption

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?

By: Tibor Jager
Imprint: Vieweg+Teubner Verlag
Country of Publication: Germany
Edition: 2012
Dimensions: Height: 210mm, Width: 148mm, Spine: 5mm
Weight: 143g
ISBN: 9783834819895
ISBN 10: 3834819891
Pages: 86
Publication Date: 22 March 2012
Audience: College/higher education , Further / Higher Education
Format: Paperback
Publisher's Status: Active

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.

Dr. Tibor Jager completed his doctoral thesis at the Horst Görtz Institute for IT Security at Ruhr-Universität Bochum under the supervision of Prof. Dr. Jörg Schwenk. He is now a postdoctoral researcher at the Karlsruhe Institute of Technology.