An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation
- 18 June 2003
- book chapter
- Published by Springer Nature
- p. 165-179
- https://doi.org/10.1007/3-540-44881-0_13
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A security analysis of the cliques protocols suitesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Solving linear equations over polynomial semiringsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Analysis of the Internet Key Exchange Protocol Using the NRL Protocol AnalyzerPublished by Defense Technical Information Center (DTIC) ,1999
- On the unification problem for Cartesian closed categoriesThe Journal of Symbolic Logic, 1997
- The NRL Protocol Analyzer: An OverviewThe Journal of Logic Programming, 1996
- The Role of Trust in Information Integrity Protocols*Journal of Computer Security, 1995
- Unification in commutative theories, Hilbert's basis theorem, and Gröbner basesJournal of the ACM, 1993
- Adding homomorphisms to commutative/monoidal theories or how algebra can help in equational unificationPublished by Springer Nature ,1991
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978