A probabilistic logic over equational assertions is proposed in order to obtain a setting able to express security notions that have an intrinsic probabilistic nature and, at the same time, are sensitive to the algebraic properties of cryptographic primitives. Applications are provided in the analysis of security protocols, namely on the existence of off-line guessing attacks and measurement of their success probability.