A remark about long attacks on ping-pong protocols

The paper presents some long attacks on cryptographic ping-pong protocols in the Dolev–Yao intruder model. The length of these attacks reaches the upper bound on the attack length proven in the previous works of the author. (In Russian).