PSS: Probabilistic Signature Scheme
What you'll learn: How RSA-PSS provides provably secure digital signatures and why it's the modern replacement for older padding methods.
The Problem with PKCS#1 v1.5 Signatures
You've learned RSA signature generation and PKCS#1 v1.5 padding. While widely deployed, PKCS#1 v1.5 has a weakness: it's deterministic. The same message always produces the same signature, and its security relies on assumptions that are hard to prove mathematically. Security researchers prefer provable security — schemes where we can mathematically demonstrate security properties.
What is RSA-PSS?
Probabilistic Signature Scheme (PSS) is a modern RSA padding scheme specifically designed for digital signatures. Unlike PKCS#1 v1.5, PSS is probabilistic (randomized) and comes with a security proof showing it's as secure as the RSA problem itself.
How PSS Works
Think of PSS like adding a unique, random "seal" to each signature:
- Hash the message you want to sign
- Generate random salt (fresh for each signature)
- Combine hash and salt through a clever mathematical process involving mask generation functions
- Apply RSA signing to the padded result
The randomness means signing the same message twice produces different signatures (both valid). This randomization defeats certain classes of attacks and enables the security proof.
Why PSS is Preferred
- Provable security: Mathematical proof reduces to the hardness of RSA
- Randomization: Protects against subtle cryptanalytic attacks
- Modern standard: Required in new protocols (TLS 1.3, JWT with PS256)
- No known weaknesses: Unlike PKCS#1 v1.5's theoretical vulnerabilities
Key Takeaway: RSA-PSS provides provably secure digital signatures through randomized padding, making it the recommended choice over deterministic PKCS#1 v1.5 signatures for modern applications.