CHAP and rewrite components

DOI10.1007/S00236-011-0141-ZzbMath1244.68011OpenAlexW1976431594MaRDI QIDQ766175

Sándor Vágvölgyi

Publication date: 23 March 2012

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-011-0141-z

zbMATH Keywords

tree automatanetwork protocolsPPPmodular propertiesauthentication schemesCHAPground term rewriting systemsrewrite complementstype-based complements

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Relation betwen integer linear vector optimization and multicriteria problems on groups and graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Reductions in tree replacement systems
• A fast algorithm for constructing a tree automaton recognizing a congruential tree language
• Congruential complements of ground term rewrite systems
• Derivation trees of ground term rewriting systems.
• Term Rewriting and All That
• How to Break MD5 and Other Hash Functions
• Tree generating regular systems

This page was built for publication: CHAP and rewrite components