Contact
CoCalc Logo Icon
StoreFeaturesDocsShareSupport News AboutSign UpSign In
| Download
Project: RSAEncryption
Views: 79
p = next_prime(6763418746532746537645276453674532764532764532675467835817635476324567325437265436478548716); q = next_prime(12386478231648273462837469213462897368756756747364891346797812656476328476239871642789316571896); N = p*q; phiN = euler_phi(p)*euler_phi(q); e = 103; if gcd(phiN,e)==1: d = 1/e % phiN; print(N,e,d);
(83774939075449716608618477865723291204732403561335861686802305584238482961959606204440594165756060943792555644284872612097242131988207907083840607136229884526097004194687152181417080643, 103, 81334892306261860785066483364779894373526605399355205521167286974988818409669520586835528304235746886793931490203648662311330320841668344841042516992815138420819379251823537820992193367)
print(p,q);
(6763418746532746537645276453674532764532764532675467835817635476324567325437265436478548737, 12386478231648273462837469213462897368756756747364891346797812656476328476239871642789316572739)