PSS (Probabilistic Signature Scheme)
E830589
PSS (Probabilistic Signature Scheme) is a cryptographic digital signature method that enhances security by incorporating randomness into the signing process, commonly used with RSA in modern security standards.
Observed surface forms (1)
| Surface form | Occurrences |
|---|---|
| RSASSA-PSS | 1 |
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic scheme
ⓘ
digital signature scheme ⓘ probabilistic signature scheme ⓘ |
| alsoKnownAs | RSA-PSS NERFINISHED ⓘ |
| basedOn | RSA public-key cryptosystem NERFINISHED ⓘ |
| commonlyUsedWith | RSA NERFINISHED ⓘ |
| compatibleWith | RSA key pairs of various sizes ⓘ |
| componentOf | modern public key infrastructure ⓘ |
| designedFor | digital signatures ⓘ |
| discouragesUseOf | deterministic RSA PKCS#1 v1.5 signatures ⓘ |
| enhances | security of RSA signatures ⓘ |
| hasParameter |
hash function choice
ⓘ
mask generation function choice ⓘ salt length ⓘ |
| hasProperty |
message recovery not provided by default
ⓘ
probabilistic ⓘ provably secure under certain assumptions ⓘ |
| hasStep |
mask generation
ⓘ
message hashing ⓘ modular exponentiation with private key ⓘ salt generation ⓘ |
| improvesOver | RSA PKCS#1 v1.5 signature scheme NERFINISHED ⓘ |
| introducedBy |
David Pointcheval
NERFINISHED
ⓘ
Mihir Bellare NERFINISHED ⓘ Phillip Rogaway NERFINISHED ⓘ |
| oftenUsedWith |
SHA-256
ⓘ
SHA-384 ⓘ SHA-512 ⓘ |
| provides | existential unforgeability under chosen-message attack (EUF-CMA) under assumptions ⓘ |
| recommendedBy | modern cryptographic best practices for RSA signatures ⓘ |
| requires |
private key
ⓘ
public key ⓘ |
| securityProvedIn | random oracle model ⓘ |
| standardizedIn |
FIPS 186-4
NERFINISHED
ⓘ
FIPS 186-5 NERFINISHED ⓘ IEEE P1363a NERFINISHED ⓘ PKCS #1 v2.1 NERFINISHED ⓘ PKCS #1 v2.2 NERFINISHED ⓘ RFC 8017 NERFINISHED ⓘ |
| usedIn |
TLS
NERFINISHED
ⓘ
X.509 certificates NERFINISHED ⓘ code signing ⓘ digital document signing ⓘ |
| uses |
hash function
ⓘ
mask generation function ⓘ randomized padding ⓘ |
| verificationInvolves |
modular exponentiation with public key
ⓘ
recomputing hash and masks ⓘ |
| yearProposed | 1996 ⓘ |
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.