| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 423552 | Electronic Notes in Theoretical Computer Science | 2009 | 15 Pages |
Abstract
The constraint solver is a symbolic cryptographic protocol security analysis tool that is based on a unique term rewriting approach. Several of the design characteristics of this tool, and the reasons for them, are discussed and placed in perspective with other approaches. The constraint solver uses a free message algebra and a bounded-process network model with a Dolev-Yao attacker. These choices yield simplicity and decidability.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
