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...
Enregistré dans:
| 主要作者: | |
|---|---|
| 格式: | Livre numérique |
| 語言: | Anglais |
| 出版: |
Wiesbaden :
Vieweg+Teubner Verlag
2012.
Cham : Springer Nature |
| 主題: | |
| 在線閱讀: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 提示: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Black-box models of computation in cryptology, Texte imprimé, 978-3-8348-1989-5 |
| LEADER | 03152nam a22003497a 4500 | ||
|---|---|---|---|
| 001 | 958427 | ||
| 008 | 130325q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN168331756 | ||
| 020 | |a 9783834819901 | ||
| 041 | 0 | |a eng | |
| 082 | |a 518 | ||
| 082 | |a 518 | ||
| 100 | 1 | |a Jager, Tibor, |d 19..- | |
| 245 | 1 | 0 | |a Black-box models of computation in cryptology |c by Tibor Jager. |
| 260 | |a Wiesbaden : |b Vieweg+Teubner Verlag. | ||
| 260 | |a Cham : |b Springer Nature, |c 2012. | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 1 | |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 | |
| 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 | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 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 | |a Mathématiques |x Informatique | ||
| 650 | |a Analyse numérique | ||
| 776 | 0 | |t Black-box models of computation in cryptology |b Texte imprimé |z 978-3-8348-1989-5 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-3-8348-1990-1 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-QFC7TPT4-R |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:749146990 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/978-3-8348-1990-1 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:752156403 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/978-3-8348-1990-1 |z Accès INSA CVL | |
| 997 | |0 958427 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||