<sectionid="description"> El cifrado RSA se basa en el siguiente procedimiento: Genere dos primos distintos p y q. Compute n = pq y φ = (p-1) (q-1). Encuentra un entero e, 1 <e<φ,such=""that=""gcd(e,φ)="1."a=""message=""in=""this=""system=""is=""number=""the=""interval=""[0,n-1].=""text=""to=""be=""encrypted=""then=""somehow=""converted=""messages=""(numbers=""[0,n-1]).=""encrypt=""text,=""for=""each=""message,=""m,=""c="me"mod=""n=""calculated.=""decrypt=""following=""procedure=""needed:=""calculate=""d=""ed="1"φ,=""c,=""m="cd"n.=""there=""exist=""values=""of=""e=""and=""me=""call=""which=""unconcealed=""messages.=""an=""issue=""when=""choosing=""should=""not=""too=""many=""instance,=""let=""p="19"q="37."φ="18*36=648."if=""we=""choose=""then,=""although=""gcd(181,648)="1"it=""turns=""out=""all=""possible=""messagesm=""(0≤m≤n-1)=""are=""calculating=""any=""valid=""choice=""some=""it's=""important=""at=""minimum.=""find=""sum=""e,=""1<e<φ(1009,3643)=""so=""value=""<=""section=""><h2> Instrucciones </h2><sectionid="instructions"></section><h2> Pruebas </h2><sectionid="tests"><pre><codeclass="language-yml">tests: - text: <code>euler182()</code> should return 399788195976. testString: 'assert.strictEqual(euler182(), 399788195976, "<code>euler182()</code> should return 399788195976.");'</code></pre></section><h2> Semilla de desafío </h2><sectionid="challengeSeed"><divid="js-seed"><pre><codeclass="language-js">function euler182() { // Good luck! return true; } euler182();</code></pre></div></section><h2> Solución </h2><sectionid="solution"><pre><codeclass="language-js">// solution required</code></pre></section></e<φ,></section>