Black-Box Models of Computation in Cryptology

Tibor Jager · 2012

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 grou

Read the paper · More papers on PaperTik