CHAP and rewrite components (Q766175): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Term Rewriting and All That / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree generating regular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivation trees of ground term rewriting systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions in tree replacement systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3485880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for generating reduced ground rewriting systems from a set of ground equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4799892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for constructing a tree automaton recognizing a congruential tree language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruential complements of ground term rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Break MD5 and Other Hash Functions / rank
 
Normal rank

Latest revision as of 01:14, 5 July 2024

scientific article
Language Label Description Also known as
English
CHAP and rewrite components
scientific article

    Statements

    CHAP and rewrite components (English)
    0 references
    23 March 2012
    0 references
    The author proposes a new feature to an authentication system CHAP used in the point-to-point data link protocol PPP. It is based on ground term rewriting systems (GTRSs) and, from the mathematical point of view, the paper is mainly about GTRSs. A new kind of complement of GTRSs, the type-based complement, is defined and studied along with some previously introduced related notions. Among other things, the following is shown: if \(A\) is a subsystem of a reduced GTRS \(B\), then \(B- A\) is a type-based complement of \(A\) for \(B\); it is decidable whether a GTRS \(C\) is a type-based complement of a GTRS \(A\) for a given reduced GTRS \(B\); it is decidable whether a given GTRS has a type-based complement and if this is the case, such a complement can be constructed; the ternary relation of a GTRS being a type-based complement of a GTRS for a third GTRS is modular. Finally, the author explains how these results can be used for making CHAP resilient to off-line attacks.
    0 references
    0 references
    0 references
    0 references
    0 references
    network protocols
    0 references
    authentication schemes
    0 references
    CHAP
    0 references
    PPP
    0 references
    ground term rewriting systems
    0 references
    rewrite complements
    0 references
    type-based complements
    0 references
    modular properties
    0 references
    tree automata
    0 references
    0 references