Abstract Algebra: Theory and Applications · Problem 7.8.1

Algebraic Coding Theory — Thomas Judson

Mathematics — Abstract Algebra · rsa-keypair-construction-sage

Problem

Construct a keypair for Alice using the first two primes greater than 101210^{12}. For your choice of EE, use a single prime number and use the smallest possible choice. Output the values of nn, EE, and DD for Alice. Then use Sage commands to verify that Alice's encryption and decryption keys are multiplicative inverses.

Browse the problem library