Computer Science – Cryptography and Security
Scientific paper
2011-03-21
Computer Science
Cryptography and Security
Scientific paper
Most common public key cryptosystems and public key exchange protocols presently in use, such as the RSA algorithm, Diffie-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 paper we survey these noncommutative group based methods and discuss several ideas in abstract infinite group theory that have arisen from them. We then present a set of open problems.
Fine Benjamin
Habeeb Maggie
Kahrobaei Delaram
Rosenberger Gerhard
No associations
LandOfFree
Aspects of Nonabelian Group Based Cryptography: A Survey and Open Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Aspects of Nonabelian Group Based Cryptography: A Survey and Open Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Aspects of Nonabelian Group Based Cryptography: A Survey and Open Problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-323963