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...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Wiesbaden :
Vieweg+Teubner Verlag
2012.
Cham : Springer Nature |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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 |
Sommario:
- 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
- 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