Black-box models of computation in cryptology
Tibor Jager ([Springer Spektrum , ], 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? |
 Black-Box Models of Computation in Cryptology.pdf :: Unduh
|
| No. Panggil : | e20419322 |
| Entri utama-Nama orang : | |
| Subjek : | |
| Penerbitan : | Wiesbaden: [Springer Spektrum , ], 2012 |
| Sumber Pengatalogan: | LibUI eng rda |
| Tipe Konten: | text |
| Tipe Media: | computer |
| Tipe Pembawa: | online resource |
| Deskripsi Fisik: | |
| Tautan: | http://link.springer.com/book/10.1007%2F978-3-8348-1990-1 |
| Lembaga Pemilik: | |
| Lokasi: |
| No. Panggil | No. Barkod | Ketersediaan |
|---|---|---|
| e20419322 | TERSEDIA |
| Ulasan: |
| Tidak ada ulasan pada koleksi ini: 20419322 |
