RSA

(redirected from RSA algorithm)
Also found in: Medical, Financial, Encyclopedia.

RSA

 (är′ĕs′ā′)
n.
An algorithm used in public key cryptography, commonly used in various protocols for secure online transmission of data.

[From the initial letters of the surnames of its inventors, Ronald Rivest (born 1947), American cryptographer, Adi Shamir (born 1952), Israeli cryptographer, and Leonard Adleman (born 1945), American computer scientist.]

RSA

abbreviation for
1. (Placename) Republic of South Africa
2. (Art Terms) Royal Scottish Academy
3. (Art Terms) Royal Scottish Academician
4. (Art Terms) Royal Society of Arts
5. (Military) (in New Zealand) Returned Services Association

RSA

Republic of South Africa.
Translations

RSA

[ˌɑːrɛsˈeɪ] n abbr (=Republic of South Africa) → RSA f(= République sud-africaine)
Mentioned in ?
References in periodicals archive ?
RSA Algorithm is one of the most important public cryptosystems used for high secure transmission of data.
The RSA algorithm involves three steps; namely key generation, encryption and decryption as presented in Figure 7.
Pehlivan, "The design and implementation of hybrid RSA algorithm using a novel chaos-based RNG," Elsevier Journal of Chaos, Solitons & Fractals, vol.
Some designs only focus on utilizing the Montgomery Multiplication method to accelerate modular exponentiation operations as required by the RSA algorithm [14,15].
Third, EB-GDSDA technique is applied for energy efficiency and the data security is being done by encrypting it by RSA algorithm.
We have designed a chaotic cryptosystem model named "CZ-Butterfly Effect Encryption Model" (CZ-BEEM), which combines CZ encryption, CZ algorithm, DHM (Diffie-Hellman-Merkle) or RSA algorithm, and LDPC (Low-Density Check-Parity Code) algorithm.
RSA Algorithm achievement with Federal information processing Signature for Data protection in Cloud Computing.Int.J.Comp.Tech.
Because a malicious node can fake a pair (Hdr, K), the controller chooses a collision-resistant hash function H, and sign the hash value of Hdr: [sigma] = enc(h(Hdr), Private.rsa) by the RSA algorithm. So the message (S, Hdr, a) is broadcast to the set S:
This point is illustrated by the progression from the RSA algorithm that relies on factoring very large integers.
As we know that an RSA algorithm is secure if and only if the public key [n.sup.*] = pq is large enough to secure against factorization, where p and q are set as the private key.
Combined with RSA algorithm, IT can achieve a digital signature.