Abstract Algebra: Theory and Applications · Problem 7.8.2

Algebraic Coding Theory — Thomas Judson

Mathematics — Abstract Algebra · rsa-signed-message-sage

Problem

Construct a keypair for Bob using the first two primes greater than 2⋅10122 \cdot 10^{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. Encode the word Math using ASCII values in the same manner as described in this section (keep the capitalization as shown). Create a signed message of this word for communication from Alice to Bob. Output the three integers: the message, the signed message and the signed, encrypted message.

Browse the problem library