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...
Cote: | Libro Electrónico |
---|---|
Auteur principal: | |
Collectivité auteur: | |
Format: | Électronique eBook |
Langue: | Inglés |
Publié: |
Wiesbaden :
Vieweg+Teubner Verlag : Imprint: Vieweg+Teubner Verlag,
2012.
|
Édition: | 1st ed. 2012. |
Sujets: | |
Accès en ligne: | Texto Completo |