A selective forgery attack produces valid digital signatures without recovering the private key, but only for messages meeting specified constraints. Unlike universal forgery, it does not cover every attacker-chosen message; unlike existential forgery, it targets a restricted message class. section 9.3
Bleichenbacher RSA forgery
Under specific conditions, including an RSA public exponent of 3, an attacker can forge signatures for messages whose digest ends with a bit set to 1. Insufficient padding validation makes the constrained forgery possible. section 9.3 section 9.7
Distinguish the attack classes and defensive implications:
- Universal forgery signs any chosen message, whereas selective forgery signs only messages satisfying constraints. section 9.3
- Enforce message formatting and padding rules; PKCS #1 v1.5 supplies formatting constraints for RSA signatures. section 9.7
