Removing Commutativity from Classical Cryptography: A Combinatorial Group Theoretic Approach
by
Delaram Kahrobaei
University of St Andrews
Coauthors: Bettina Eick

The idea I am dicussing in this talk, is removing commutativity from the classical cryptology schemes (which uses finite fields (special cyclic groups)); initiated by Anshel-Anshel-Goldfeld in 1999. We introduced polycyclic groups as the best new platform for cryptology. The novelty of our approach is that polycyclic groups are a natural generalization of cyclic groups with much more complex algorithmic structures this promises to be a more substantial platform and more secure than the existing cryptosystems. Note that nilpotent groups could be regarded as an example of polycyclic groups and the solvable groups which are not polycyclic, are not appropriate. In this talk I will explain Eick-Kahrobaei cryptosystem.

Date received: December 24, 2004