Signing and Verifying Using Modular Arithmetic
Problem: Have the signing function create a number
that is:
- Large enough to be unique to the message, and
- Seemingly unrelated to the message.
Approach:
- Use exponentiation to create large numbers, and
- Use modular arithmetic to hide any relation of the number to the
message.