2:00 pm Thursday, March 25, 2010
Algebra, Number Theory, and Combinatorics: Aspects of Nonabelian Group Based Cryptography by Delaram Kahrobaei (CUNY) in RLM 9.166
Most common public key cryptosystems and public key exchange protocols presently in use, such as the RSA algorithm, Diħe-Hellman, and elliptic curve methods are number theory based and hence depend on the structure of abelian groups. The strength of computing machinery has made these techniques theoretically susceptible to attack and hence recently there has been an active line of research to develop cryptosystems and key exchange protocols using noncommutative cryptographic platforms. This line of investigation has been given the broad title of noncommutative algebraic cryptography. This was initiated by two public key protocols that used the braid groups, one by Ko, Lee et.al. and one by Anshel, Anshel and Goldfeld. The study of these protocols and the group theory surrounding them has had a large effect on research in infinite group theory. In this talk I survey some of these noncommutative group based methods and discuss several ideas in abstract infinite group theory that have arisen from them. I will mention about some new results and then present a set of open problems. Submitted by
|
|