Computer Science – Cryptography and Security
Scientific paper
2006-10-04
Dans UNIF'06 - 20th International Workshop on Unification (2006) 1-5
Computer Science
Cryptography and Security
Scientific paper
In this paper, we propose a unification algorithm for the theory $E$ which combines unification algorithms for $E\_{\std}$ and $E\_{\ACUN}$ (ACUN properties, like XOR) but compared to the more general combination methods uses specific properties of the equational theories for further optimizations. Our optimizations drastically reduce the number of non-deterministic choices, in particular those for variable identification and linear orderings. This is important for reducing both the runtime of the unification algorithm and the number of unifiers in the complete set of unifiers. We emphasize that obtaining a ``small'' set of unifiers is essential for the efficiency of the constraint solving procedure within which the unification algorithm is used. The method is implemented in the CL-Atse tool for security protocol analysis.
Kuesters Ralf
Tuengerthal Max
Turuani Mathieu
No associations
LandOfFree
Implementing a Unification Algorithm for Protocol Analysis with XOR 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 Implementing a Unification Algorithm for Protocol Analysis with XOR, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Implementing a Unification Algorithm for Protocol Analysis with XOR will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-155754