(redirected from RSA cryptosystem)
Also found in: Dictionary, Medical, Financial.
Related to RSA cryptosystem: RSA cipher


(cryptography, company)
(The initials of the authors)

1. RSA Data Security, Inc.

2. Their cryptography systems, especially RSA encryption.

The RSA algorithm was first described in the paper:

[R. Rivest, A. Shamir, L. Adleman, "A Method for Obtaining Digital Signatures and Public-key Cryptosystems". CACM 21,2; 1978]


(1) (Rural Service Area) See MSA.

(2) (Rivest-Shamir-Adleman) A highly secure cryptography method by RSA Security, Inc., Bedford, MA (, a division of EMC Corporation since 2006. It uses a two-part key. The private key is kept by the owner; the public key is published.

Data are encrypted by using the recipient's public key, which can only be decrypted by the recipient's private key. RSA is very computation intensive, thus it is often used to create a digital envelope, which holds an RSA-encrypted DES key and DES-encrypted data. This method encrypts the secret DES key so that it can be transmitted over the network, but encrypts and decrypts the actual message using the much faster DES algorithm.

RSA is also used for authentication by creating a digital signature. In this case, the sender's private key is used for encryption, and the sender's public key is used for decryption. See digital signature.

The RSA algorithm is also implemented in hardware. As RSA chips get faster, RSA encoding and decoding add less overhead to the operation. See cryptography and digital certificate.

Secret Key vs. Public Key
The secret method uses the same key to encrypt and decrypt. The problem is transmitting the key to someone so they can use it. The public key method uses two keys. One kept secret and never transmitted, and the other made public. Sometimes the public key method is used to send the secret key of the private method, and then the message is sent using the private key method.
References in periodicals archive ?
The remaining of this paper is organized as follows: Section 2 re-visited the theoretical topics of RSA Cryptosystem and Section 3 provides the simulation environment of the proposed system.
Over years, numerous attacks on RSA illustrating RSA's present and potential vulnerability have brought our attention to the security issues of RSA cryptosystem.
This theorem ensures the encryption and decryption phases in the RSA cryptosystem as follows: a plaintext is encrypted by computing and is in turn decrypted by calculating [c.
For example, in the MultiPower RSA cryptosystem [10], the modulus n has the form n = [p.
One important, open question concerns whether cracking the RSA cryptosystem is, in fact, as hard as factoring.
have recently uncovered mathematical evidence that, in certain cases, using techniques rooted in algebra to break the RSA cryptosystem may indeed be easier than factoring.
N] key to decrypt the encrypted digital content, we insert the watermark s into the digital content M' along with a privacy homomorphism with respect to the multiplication operation under the RSA cryptosystem.
N]'; then he or she must insert the watermark into the encrypted digital content along with a privacy homomorphism into the RSA cryptosystem as discussed in subsection 3.
Adleman of the University of Southern California in Los Angeles first proposed the RSA cryptosystem, even 50-digit numbers seemed beyond reach.
In this section, we first define involved parties of a CAE scheme and then review the security notions with respect to RSA cryptosystems [15].