All listings for this product
About this product
- DescriptionGeneric 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 cant 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?
- Author BiographyDr. Tibor Jager completed his doctoral thesis at the Horst Gortz Institute for IT Security at Ruhr-Universitat Bochum under the supervision of Prof. Dr. Jorg Schwenk. He is now a postdoctoral researcher at the Karlsruhe Institute of Technology.
- Author(s)Tibor Jager
- PublisherSpringer Fachmedien Wiesbaden
- Date of Publication22/03/2012
- SubjectComputing: Professional & Programming
- Place of PublicationWeisbaden
- Country of PublicationGermany
- ImprintVieweg+Teubner Verlag
- Content Notebiography
- Weight131 g
- Width148 mm
- Height210 mm
- Spine5 mm
- Format DetailsTrade paperback (US)
- Edition Statement2012
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $60.69Trending at AU $73.28
- AU $82.00Trending at AU $99.54
- AU $20.38Trending at AU $26.08
- AU $50.16Trending at AU $55.78
- AU $33.32Trending at AU $36.33
- AU $36.16Trending at AU $49.55
- AU $18.16Trending at AU $21.18
This item doesn't belong on this page.
Thanks, we'll look into this.