Abstract | Keywords | Export | Availability | Bookmark

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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?

Cryptography -- Mathematics. --- Data encryption (Computer science) -- Mathematics. --- Data mining -- Mathematics. --- Mathematics. --- Mathematics --- Physical Sciences & Mathematics --- Mathematics - General --- Cryptography --- Data encryption (Computer science) --- Data encoding (Computer science) --- Encryption of data (Computer science) --- Cryptanalysis --- Cryptology --- Secret writing --- Steganography --- Computer mathematics. --- Computational Mathematics and Numerical Analysis. --- Computer security --- Signs and symbols --- Symbolism --- Writing --- Ciphers --- Computer science --- Computer mathematics --- Discrete mathematics --- Electronic data processing