000 02430nam a22004215i 4500
001 978-3-8348-1990-1
003 DE-He213
005 20140220083332.0
007 cr nn 008mamaa
008 120322s2012 gw | s |||| 0|eng d
020 _a9783834819901
_9978-3-8348-1990-1
024 7 _a10.1007/978-3-8348-1990-1
_2doi
050 4 _aQA71-90
072 7 _aPBKS
_2bicssc
072 7 _aMAT006000
_2bisacsh
082 0 4 _a518
_223
082 0 4 _a518
_223
100 1 _aJager, Tibor.
_eauthor.
245 1 0 _aBlack-Box Models of Computation in Cryptology
_h[electronic resource] /
_cby Tibor Jager.
264 1 _aWiesbaden :
_bVieweg+Teubner Verlag,
_c2012.
300 _aXII, 86p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aBlack-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.
520 _aGeneric 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?
650 0 _aMathematics.
650 0 _aComputer science
_xMathematics.
650 1 4 _aMathematics.
650 2 4 _aComputational Mathematics and Numerical Analysis.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783834819895
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-8348-1990-1
912 _aZDB-2-SMA
999 _c103963
_d103963