Cargando…
Black-Box Models of Computation in Cryptology
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Wiesbaden :
Vieweg+Teubner Verlag : Imprint: Vieweg+Teubner Verlag,
2012.
|
| Edición: | 1st ed. 2012. |
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-8348-1990-1 | ||
| 003 | DE-He213 | ||
| 005 | 20220113152525.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 120322s2012 gw | s |||| 0|eng d | ||
| 020 | |a 9783834819901 |9 978-3-8348-1990-1 | ||
| 024 | 7 | |a 10.1007/978-3-8348-1990-1 |2 doi | |
| 050 | 4 | |a QA71-90 | |
| 072 | 7 | |a PBKS |2 bicssc | |
| 072 | 7 | |a MAT006000 |2 bisacsh | |
| 072 | 7 | |a PBKS |2 thema | |
| 082 | 0 | 4 | |a 518 |2 23 |
| 100 | 1 | |a Jager, Tibor. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Black-Box Models of Computation in Cryptology |h [electronic resource] / |c by Tibor Jager. |
| 250 | |a 1st ed. 2012. | ||
| 264 | 1 | |a Wiesbaden : |b Vieweg+Teubner Verlag : |b Imprint: Vieweg+Teubner Verlag, |c 2012. | |
| 300 | |a XII, 86 p. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 505 | 0 | |a 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. | |
| 520 | |a 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? | ||
| 650 | 0 | |a Mathematics-Data processing. | |
| 650 | 1 | 4 | |a Computational Mathematics and Numerical Analysis. |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783834819895 |
| 776 | 0 | 8 | |i Printed edition: |z 9783834819918 |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-3-8348-1990-1 |z Texto Completo |
| 912 | |a ZDB-2-SMA | ||
| 912 | |a ZDB-2-SXMS | ||
| 950 | |a Mathematics and Statistics (SpringerNature-11649) | ||
| 950 | |a Mathematics and Statistics (R0) (SpringerNature-43713) | ||