freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-182-rsa-encryption.english.md

id	challengeType	title
5900f4231000cf542c50ff35	5	Problem 182: RSA encryption

Description

The RSA encryption is based on the following procedure: Generate two distinct primes p and q.Compute n=pq and φ=(p-1)(q-1). Find an integer e, 1

Instructions

Tests

tests:
  - text: <code>euler182()</code> should return 399788195976.
    testString: assert.strictEqual(euler182(), 399788195976, '<code>euler182()</code> should return 399788195976.');

Challenge Seed

function euler182() {
  // Good luck!
  return true;
}

euler182();

Solution

// solution required