On Blackbox Models Of Computation In Cryptology

On Blackbox Models Of Computation In Cryptology

by Tibor Jager
3/5

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.

First published
2012
Publishers
Vieweg+teubner Verlag

Books

Similar books