Site Navigation
Categories:
Asymmetric-key cryptosystems
Electronic commerce
Wikipedia articles in need of updating
Articles with Alice and Bob explanations

Summary Of: RSA

RSA is widely used in... and Adleman devised RSA independently of Cocks... RSA involves a public... The keys for the RSA algorithm are generated the following way... Here is an example of RSA encryption and decryption... RSA is generally combined with some... Because RSA encryption is a... RSA without padding is not semantically secure... RSA has the property that the product of two ciphertexts is equal to the encryption of... practical RSA implementations typically embed some form of structured... RSA padding schemes must be carefully designed so as to prevent sophisticated attacks which may be... used a construction that turned RSA into a semantically secure encryption scheme... RSA can also be used to... The security of the RSA cryptosystem is based on two mathematical problems... Full decryption of an RSA ciphertext is thought to be infeasible on the assumption that both of these problems are... is an RSA public key and... Currently the most promising approach to solving the RSA problem is to factor the modulus... RSA keys are typically 1024... it is generally presumed that RSA is secure if... could bypass RSA by guessing the symmetric key... how RSA public keys are distributed is important to security... was able to mount a practical attack against RSA implementations of the... and RSA Laboratories has released new versions of PKCS... discovered 508 out of 512 bits of an RSA key in 10 iterations... RSA Earns Accolades for its Founders... On using RSA with Low Exponent in a Public Key Network... RSA demo with Java and Javascript... Example of an RSA implementation with PKCS...

Encyclodia Page On: RSA

These Are Links To Other Documents
South Africa | RSA (disambiguation) | cryptography | algorithm | public-key cryptography | signing | electronic commerce | Ron Rivest | Adi Shamir | Leonard Adleman | MIT | Clifford Cocks | mathematician | UK | GCHQ | MIT | 2003 | 21 September | 2000 | filing date | patent application | patents | US | key | prime numbers | modulus | totient | coprime | congruence relation | probabilistically tested | PKCS#1 v2.0 | least common multiple | 65537 | extended Euclidean algorithm | modular arithmetic | Chinese Remainder Theorem | side channel attacks | smart cards | Alice | Bob | exponentiation by squaring | Fermat's little theorem | totient | modular multiplicative inverse | square-and-multiply algorithm | modular exponentiation | padding scheme | Chinese remainder theorem | Johan Håstad | Don Coppersmith | deterministic encryption algorithm | chosen plaintext attack | semantically secure | chosen-ciphertext attack | padding | PKCS#1 | adaptive chosen ciphertext attack | Optimal Asymmetric Encryption Padding | RSA-PSS | sign | hash value | RSA-PSS | | RSA Factoring Challenge | Integer factorization records | factoring large numbers | RSA problem | padding scheme | RSA problem | integer factorization | As of 2005 | RSA-200 | bits | personal computer | 1999 | RSA-155 | TWIRL | Peter Shor | Shor's algorithm | quantum computer | polynomial time | primality tests | Fermat factorization | Pollard's p − 1 algorithm | DES | symmetric cryptosystems | Bob | random number generator | man-in-the-middle attack | digital certificates | public key infrastructure | Kocher | 2003 | Boneh | Brumley | Secure Socket Layer | Chinese remainder theorem | cryptographic blinding | 1998 | Daniel Bleichenbacher | adaptive chosen ciphertext attack | padding scheme | Secure Socket Layer | Optimal Asymmetric Encryption Padding | branch predictor | simultaneous multithreading | Clifford Cocks | Quantum cryptography | Cryptographic key length | Computational complexity theory | Diffie-Hellman key exchange | RSA Factoring Challenge | List of software patents | doi | ISBN 0-8493-8523-7 | Cormen, Thomas H. | Charles E. Leiserson | Ronald L. Rivest | Clifford Stein | Introduction to Algorithms | ISBN 0-262-03293-7 | RSA Laboratories | PKCS | standard | public-key cryptography | primitives | encryption | signature | ASN.1 | v | Public-key cryptography | CEILIDH | Cramer-Shoup | DH | DSA | ECDH | ECDSA | EKE | ElGamal encryption | ElGamal signature scheme | GMR | IES | Lamport | MQV | NTRUEncrypt | NTRUSign | Paillier | Rabin | Schnorr | SPEKE | SRP | STS | XTR | Discrete logarithm | Elliptic curve cryptography | RSA problem | CRYPTREC | IEEE P1363 | NESSIE | NSA Suite B | Digital signature | Fingerprint | PKI | Web of trust | Key size | v | d | Cryptography | History of cryptography | Cryptanalysis | Cryptography portal | Topics in cryptography | Symmetric-key algorithm | Block cipher | Stream cipher | Public-key cryptography | Cryptographic hash function | Message authentication code | Random numbers | Steganography | Categories | Asymmetric-key cryptosystems | Electronic commerce | Wikipedia articles in need of updating | Articles with Alice and Bob explanations |
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "RSA".