Home / Computing / Ciphers and public keys

Ciphers and public keys

Compare Caesar shifts, frequency bars, and small RSA round trips.

    CS09 · Ciphers and public keys0.00 s · Ready

    Computing · Networks and security / Principles and exploration

    Ciphers and public keys experiment guide

    Compare Caesar shifts, frequency bars, and small RSA round trips.

    How does it work?

    The private key recovers values encrypted by the public key.

    Key relationship

    c = mᵉ mod n · m = cᵈ mod n

    Try this investigation

    1. Compare Caesar shifts, frequency bars, and small RSA round trips.
    2. Run and record each of the three reference settings.
    3. Change one variable and compare with the reference records.

    Interpreting your results

    What condition defines RSA exponent d?

    e·d ≡ 1 mod φ(n) · The private key recovers values encrypted by the public key.

    Assumptions and limitations

    Small RSA and Caesar are educational, not real security. Padding and secure key generation are omitted.