Skip to Content
Java Security Handbook
book

Java Security Handbook

by Jamie Jaworski, Paul J. Perrone, Venkata S.R. Krishna Chaganti
September 2000
Intermediate to advanced
552 pages
12h 9m
English
Sams
Content preview from Java Security Handbook

Appendix B. The Mathematics of RSA

This appendix covers the mathematics used in the Rivest, Shamir, Adelman (RSA) public-key encryption algorithm and provides algorithms for setting up an RSA system, performing encryption and decryption, and computing/verifying signatures.

The Math Behind RSA

In an RSA cryptosystem, two prime numbers, p and q, are generated whose product is n. The encryption key (that is, the public key), e, is a number that is relatively prime to (p–1)(q–1). The decryption key (private key), d, is calculated so that ed mod ((p–1)(q–1)) is 1. The values of p and q are critical to the security of RSA and should be securely discarded after an RSA system is set up.

At this point, you might have a few questions relative to prime numbers, ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Java Security, 2nd Edition

Java Security, 2nd Edition

Scott Oaks
Java Security

Java Security

Scott Oaks
Java Cryptography

Java Cryptography

Jonathan Knudsen
TCP/IP Sockets in Java, 2nd Edition

TCP/IP Sockets in Java, 2nd Edition

Kenneth L. Calvert, Michael J. Donahoo

Publisher Resources

ISBN: 0672316021Purchase book