Complexity problems for protocols based on group theoretical platforms
Vitalii A. Roman'kov,
Omsk State University, Omsk, Russia
We consider protocols that include algorithms on infinite groups, and focus on
their complexity in its various manifestations (in worst-case scenario, on average,
asymptotically, generically). We give example of attacks on some known constructions.