RSA
nounid
3966·updated May 12, 2026candidate
A public key cryptosystem developed by R. Rivest, A. Shamir and L. Adleman used for both encryption and digital signatures Scope Note: The RSA has two different keys, the public encryption key and the secret decryption key. The strength of the RSA depends on the difficulty of the prime number factorization. For applications with high- level security, the number of the decryption key bits should be greater than 512 bits.
Attested in
No recorded attestations. They are written when an MWE tagging stage is completed, stamped with the pack version and the document’s digest.
Classifications
Entity Type
Capability0%rule-basedmulti_axis_classifier_low_confidence.v1
Sensitivity
—60%llm-generatedllm:claude-haiku-4-5
Information Class
—70%llm-generatedllm:claude-haiku-4-5
Variants
- plural
- RSAS
- possessive
- RSA'S
- pluralpossessive
- RSAS'
Framework definitions
- §1
- A public key cryptosystem developed by R. Rivest, A. Shamir and L. Adleman used for both encryption and digital signatures Scope Note: The RSA has two different keys, the public encryption key and the secret decryption key. The strength of the RSA depends on the difficulty of the prime number factorization. For applications with high- level security, the number of the decryption key bits should be greater than 512 bits.
- §1 · legacy_primary
- A public key cryptosystem developed by R. Rivest, A. Shamir and L. Adleman used for both encryption and digital signatures Scope Note: The RSA has two different keys, the public encryption key and the secret decryption key. The strength of the RSA depends on the difficulty of the prime number factorization. For applications with high- level security, the number of the decryption key bits should be greater than 512 bits.DR-088 backfill from the noun definition column
Outgoing relationships
No outgoing triples
This term is not the subject of any RDF-style relationship yet.
Incoming relationships
No incoming triples
No other term currently asserts a relationship to this one.