<電子ブック>
Black-Box Models of Computation in Cryptology / by Tibor Jager
版 | 1st ed. 2012. |
---|---|
出版者 | (Wiesbaden : Vieweg+Teubner Verlag : Imprint: Vieweg+Teubner Verlag) |
出版年 | 2012 |
本文言語 | 英語 |
大きさ | XII, 86 p : online resource |
著者標目 | *Jager, Tibor author SpringerLink (Online service) |
件 名 | LCSH:Mathematics -- Data processing
全ての件名で検索
FREE:Computational Mathematics and Numerical Analysis |
一般注記 | 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 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9783834819901 |
|
電子リソース |
|
EB00236506 |
類似資料
この資料の利用統計
このページへのアクセス回数:2回
※2017年9月4日以降