šŸ–Šļø
Crypto
  • Crypto
  • Fundamentals
    • Divisibility, Factors and Euclid's Algorithms
    • Modular Arithmetic
    • Rings, Fields and Euler's Totient Function
  • Further Maths
    • Continued Fractions
  • RSA
    • Overview
    • Public Exponent Attacks
      • e=1
      • Small e
      • Multi-party RSA with Small e
      • Wiener's Attack
    • Choice of Primes
      • N is prime
      • Mersenne Primes
      • P=Q
      • Fermat Factorisation
    • Factorisation Methods
      • Pollard's p-1
  • Diffie-Hellman Key Exchange
    • Overview
    • Solving the DLP
      • Baby Step, Giant Step
Powered by GitBook
On this page

Was this helpful?

  1. RSA
  2. Public Exponent Attacks

e=1

PreviousPublic Exponent AttacksNextSmall e

Last updated 3 years ago

Was this helpful?

When $e=1$, the encryption is virtually useless

c=Me=M1=Mmodā€‰ā€‰Nc = M^e = M^1 = M \mod Nc=Me=M1=MmodN

At that point, ciphertext ccc is equal to MMM, and it's unencrypted.

from Crypto.Util.number import long_to_bytes

print(long_to_bytes(m))