Michaël Rusinowitch, Mathieu Turuani. Protocol insecurity with a finite number of sessions, composed keys is NP-complete..
Theoretical Computer Science, Elsevier, 2003, Theoretical Computer Science, 1-3 (299), pp.451-475.
⟨10.1016/S0304-3975(02)00490-5⟩.
⟨inria-00103985⟩