8773
TOPICS
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Strong RSA Cryptosystem
The RSA cryptosystem was invented by R. Rivest, A. Shamir, and L. Adleman.
This Demonstration
• generates a large RSA modulus
(up to 700 decimal digits);
• creates the corresponding public and private keys,
and
;
• provides a simple, practical way to encrypt and decrypt messages in various UNICODE supported languages.
Contributed by:
Rudolf Muradian
SNAPSHOTS
RELATED LINKS
RSA Encryption
(
Wolfram
MathWorld
)
RSA Encryption and Decryption
(
Wolfram Demonstrations Project
)
Secret Codes in The Wolfram Demonstrations Project (But No Dinosaurs)
(
Wolfram Blog
)
PERMANENT CITATION
"
Strong RSA Cryptosystem
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/StrongRSACryptosystem/
Contributed by:
Rudolf Muradian
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Binary-Based Cryptosystem
Ridge Liu
RSA Encryption and Decryption
S. M. Blinder
Complex One-Time Pad
Rudolf Muradian
Vernam Cipher (One Time Pad)
Rudolf Muradian
Neural Cryptography
Hector Sanchez
Encryption with the Enigma Machine
Gasper Zadnik
Decoding the Arecibo Message
Andrew Read
Hashing Words in Cryptography
Daniel de Souza Carvalho
Single Character Image Steganography
Héctor Sánchez
Effect of Keyword Length on the Letter Frequency in Encrypted Messages
Erik Mahieu
Related Topics
Cryptography
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+