Efficient General Unification for XOR with Homomorphism

DOI10.1007/978-3-642-22438-6_31zbMath1341.68195OpenAlexW182811427WikidataQ118190409 ScholiaQ118190409MaRDI QIDQ5200040

Christopher Lynch, Zhi-Qiang Liu

Publication date: 29 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22438-6_31

Mathematics Subject Classification ID

Related Items (4)

Local XOR unification: definitions, algorithms and application to cryptography ⋮ Efficient general AGH-unification ⋮ Bounded ACh unification ⋮ Satisfiability of general intruder constraints with and without a set constructor

Uses Software

• Maude
• Maude-NPA

Cites Work

• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient General Unification for XOR with Homomorphism