Home Page Javascript Download Core Servlets & Java Server Java Cryptography Java in 60 Min A Day Javascript Tutorial About Us Contact Us
Site Search
Free Javascript Lessons
Newest Java Articles
Checkbox Changer
Check Entry
Check All
Block Key Press
Basic Validation
Auto Email Link
JavaScript Forms: Agree Before Entry
Auto Tab
JavaScript Calendars: Time Entered - Day Highlighted
JavaScript Calendars: Days Left
Related SE Keywords
Java virtual machine
Java Applet
Javascript Lesson
Javascript Tutorial
Java Programming
Java Games
Java Xml
Java String
Cryptography Extensions
Free Web Master Tools
 
JavascriptDownload.net > Free Javascript Lessons > Java Cryptography Extensions > Chapter 5 / 10 - RSA Encryption Limitations

5.4.5 RSA Encryption Limitations

Every RSA initialization process requires the random selection of two very large primes, traditionally referred to as p and a, and computing n such that n=pq. Previously, we extolled the virtues of RSA over DSA, citing that RSA could be used for encryption and digital signature applications, while DSA was strictly for digital signature applications. In the real world, the encryption capabilities of RSA are rarely used for one simple reason: the length of the plaintext that can be encrypted is limited to the size of n. In fact, the real length is even smaller than n because of the overhead introduced by the algorithms. As a result, the predominate approach is to generate a random secret key and encrypt that key with the RSA keys. The message is then encrypted using a symmetric cipher with the generated secret key. The net-net is that two pieces of information are then sent over the wire. Let's talk about an example using Alice and Bob.

Add Comment
second line has an error, it has to be p and q and not a
29.10.2010 14:29:51
Arvind
 
homepage   |  about us  |  contact us
Powered By teknonova.com