<-- Prev

Public-Key Cryptography

Next -->
  • RSA Starter 3
    20 pts · 8494 Solves · 11 Solutions

    RSA relies on the difficulty of the factorisation of the modulus N. If the primes can be found then we can calculate the Euler totient of N and thus decrypt the ciphertext.

    Given N = p*q and two primes:

    p = 857504083339712752489993810777

    q = 1029224947942998075080348647219

    What is the totient of N?

    You must be logged in to submit your flag.


Level Up

level up icon

You are now level Current level