Computer Science – Symbolic Computation
Scientific paper
2010-12-22
EPTCS 42, 2010, pp. 12-23
Computer Science
Symbolic Computation
In Proceedings UNIF 2010, arXiv:1012.4554
Scientific paper
10.4204/EPTCS.42.2
Modular exponentiation is a common mathematical operation in modern cryptography. This, along with modular multiplication at the base and exponent levels (to different moduli) plays an important role in a large number of key agreement protocols. In our earlier work, we gave many decidability as well as undecidability results for multiple equational theories, involving various properties of modular exponentiation. Here, we consider a partial subtheory focussing only on exponentiation and multiplication operators. Two main results are proved. The first result is positive, namely, that the unification problem for the above theory (in which no additional property is assumed of the multiplication operators) is decidable. The second result is negative: if we assume that the two multiplication operators belong to two different abelian groups, then the unification problem becomes undecidable.
Kapur Deepak
Marshall Andrew
Narendran Paliath
No associations
LandOfFree
Unification modulo a partial theory of exponentiation 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 Unification modulo a partial theory of exponentiation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unification modulo a partial theory of exponentiation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-581922