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.
All labels observed (2)
| Label | Occurrences |
|---|---|
| PSS (Probabilistic Signature Scheme) canonical | 1 |
| RSASSA-PSS | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9931450 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: PSS (Probabilistic Signature Scheme) Context triple: [EMSA-PSS, basedOn, PSS (Probabilistic Signature Scheme)]
-
A.
DSA (Digital Signature Algorithm)
DSA (Digital Signature Algorithm) is a widely used public-key cryptographic standard for creating and verifying digital signatures, originally based on principles similar to those of the ElGamal signature scheme.
-
B.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
C.
Elliptic Curve Digital Signature Algorithm
Elliptic Curve Digital Signature Algorithm is a public-key cryptographic method that uses elliptic curve mathematics to create compact, secure digital signatures for authentication and data integrity.
-
D.
Merkle puzzles
Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
-
E.
The Sigma Protocol
The Sigma Protocol is a posthumously published thriller novel by Robert Ludlum that follows a man uncovering a vast global conspiracy tied to secret financial and political powers.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: PSS (Probabilistic Signature Scheme) Target entity description: 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.
-
A.
DSA (Digital Signature Algorithm)
DSA (Digital Signature Algorithm) is a widely used public-key cryptographic standard for creating and verifying digital signatures, originally based on principles similar to those of the ElGamal signature scheme.
-
B.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
C.
Elliptic Curve Digital Signature Algorithm
Elliptic Curve Digital Signature Algorithm is a public-key cryptographic method that uses elliptic curve mathematics to create compact, secure digital signatures for authentication and data integrity.
-
D.
Merkle puzzles
Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
-
E.
The Sigma Protocol
The Sigma Protocol is a posthumously published thriller novel by Robert Ludlum that follows a man uncovering a vast global conspiracy tied to secret financial and political powers.
- F. None of above. chosen
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 ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: PSS (Probabilistic Signature Scheme) Description of subject: 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.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.