3 citations · 5 across the 3 of their papers we have counts for
4 papers
CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms
Dalton Chichester, Wei Du, Raymond Kauffman +8
Recently, interest has been emerging in the application of symbolic techniques to the specification and analysis of cryptosystems. These techniques, when accompanied by suitable pr…
On Asymmetric Unification for the Theory of XOR with a Homomorphism
Christopher Lynch, Andrew M. Marshall, Catherine Meadows +2
Asymmetric unification, or unification with irreducibility constraints, is a newly developed paradigm that arose out of the automated analysis of cryptographic protocols. However,…
On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity
Paliath Narendran, Andrew Marshall, Bibhu Mahapatra
We prove that the Tiden and Arnborg algorithm for equational unification modulo one-sided distributivity is not polynomial time bounded as previously thought. A set of counterexamp…
Unification modulo a partial theory of exponentiation
Deepak Kapur, Andrew Marshall, Paliath Narendran
Modular exponentiation is a common mathematical operation in modern cryptography. This, along with modular multiplication at the base and exponent levels (to different moduli) play…