DSA (Digital Signature Algorithm)
E700388
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.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Digital Signature Algorithm | 3 |
| DSA (Digital Signature Algorithm) canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T7934637 — 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: DSA (Digital Signature Algorithm) Context triple: [ElGamal, relatedTo, DSA (Digital Signature Algorithm)]
-
A.
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.
-
B.
EdDSA
EdDSA (Edwards-curve Digital Signature Algorithm) is a modern public-key signature scheme designed for high performance, security, and resistance to side-channel attacks, commonly used with curves like Ed25519.
-
C.
RSA
RSA is a widely used public-key cryptographic algorithm that enables secure key exchange and digital signatures in many internet security protocols.
-
D.
RSA
RSA is the three-letter World Rugby trigram used to represent the South Africa national rugby union team in international competitions and official records.
-
E.
ElGamal
ElGamal is a public-key cryptosystem based on the discrete logarithm problem, widely used for secure encryption and digital signatures in various cryptographic protocols.
- 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: DSA (Digital Signature Algorithm) Target entity description: 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.
-
A.
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.
-
B.
EdDSA
EdDSA (Edwards-curve Digital Signature Algorithm) is a modern public-key signature scheme designed for high performance, security, and resistance to side-channel attacks, commonly used with curves like Ed25519.
-
C.
RSA
RSA is a widely used public-key cryptographic algorithm that enables secure key exchange and digital signatures in many internet security protocols.
-
D.
RSA
RSA is the three-letter World Rugby trigram used to represent the South Africa national rugby union team in international competitions and official records.
-
E.
ElGamal
ElGamal is a public-key cryptosystem based on the discrete logarithm problem, widely used for secure encryption and digital signatures in various cryptographic protocols.
- F. None of above. chosen
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic standard
ⓘ
digital signature algorithm ⓘ |
| abbreviationOf | Digital Signature Algorithm NERFINISHED ⓘ |
| basedOn | discrete logarithm problem ⓘ |
| category | asymmetric cryptography ⓘ |
| comparedWith |
ElGamal signature scheme
NERFINISHED
ⓘ
RSA NERFINISHED ⓘ |
| cryptographicPrimitive | modular exponentiation ⓘ |
| definedIn | Digital Signature Standard NERFINISHED ⓘ |
| designedFor | digital signatures ⓘ |
| domainParameterType |
g
ⓘ
p ⓘ q ⓘ |
| fullName | Digital Signature Algorithm NERFINISHED ⓘ |
| hasVariant |
ECDSA
NERFINISHED
ⓘ
EdDSA NERFINISHED ⓘ |
| inspiredBy | ElGamal signature scheme NERFINISHED ⓘ |
| introducedInYear | 1991 ⓘ |
| keyType |
private key
ⓘ
public key ⓘ |
| mathematicalStructure | multiplicative group modulo prime ⓘ |
| notUsedFor |
encryption
ⓘ
key exchange ⓘ |
| operation |
signature generation
ⓘ
signature verification ⓘ |
| originalKeySizeIncrement | 64-bit increments ⓘ |
| originalKeySizeRange | 512–1024 bits ⓘ |
| publishedInYear | 1994 ⓘ |
| requires |
generator g
ⓘ
large prime modulus p ⓘ subgroup order q ⓘ |
| securityDependsOn | random per-message nonce k ⓘ |
| signatureComponent |
r
ⓘ
s ⓘ |
| signatureGenerationUses | private key ⓘ |
| signatureVerificationUses | public key ⓘ |
| standardizedBy | NIST NERFINISHED ⓘ |
| standardizedIn | FIPS 186 NERFINISHED ⓘ |
| standardRevision |
FIPS 186-2
NERFINISHED
ⓘ
FIPS 186-3 NERFINISHED ⓘ FIPS 186-4 NERFINISHED ⓘ FIPS 186-5 NERFINISHED ⓘ |
| updatedKeySize |
2048 bits
ⓘ
3072 bits ⓘ |
| usedFor |
authentication
ⓘ
data integrity ⓘ non-repudiation ⓘ |
| usesHashFunction | cryptographic hash function ⓘ |
| vulnerableIf |
nonce k is predictable
ⓘ
nonce k is reused ⓘ |
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: DSA (Digital Signature Algorithm) Description of subject: 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.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Digital Signature Algorithm
this entity surface form:
Digital Signature Algorithm
this entity surface form:
Digital Signature Algorithm