Computer Science – Cryptography and Security
Scientific paper
2003-06-06
J. Hughes, A Tannenbaum, Length-Based Attacks for Certain Group Based Encryption Rewriting Systems, Workshop SECI02 SEcurite d
Computer Science
Cryptography and Security
Scientific paper
In this note, we describe a probabilistic attack on public key cryptosystems based on the word/conjugacy problems for finitely presented groups of the type proposed recently by Anshel, Anshel and Goldfeld. In such a scheme, one makes use of the property that in the given group the word problem has a polynomial time solution, while the conjugacy problem has no known polynomial solution. An example is the braid group from topology in which the word problem is solvable in polynomial time while the only known solutions to the conjugacy problem are exponential. The attack in this paper is based on having a canonical representative of each string relative to which a length function may be computed. Hence the term length attack. Such canonical representatives are known to exist for the braid group.
Hughes James
Tannenbaum Allen
No associations
LandOfFree
Length-Based Attacks for Certain Group Based Encryption Rewriting Systems 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 Length-Based Attacks for Certain Group Based Encryption Rewriting Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Length-Based Attacks for Certain Group Based Encryption Rewriting Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-434840