INNER CODE UNIT · C++

e

QuasarApp/Qt-Secret · src/Qt-RSA/qrsaencryption.cpp:265

            e = randomNumber() % eilor;
        }


        modul = 0;
        while ((modul = p * q) < 0) {
            p = toPrime((p - 1) / 2);
        }


        if (!(e % 2)) --e;

        do {
            e -= 2;
        } while((!isMutuallyPrime(eilor, e)));

        d = extEuclid(eilor , e);

View source record →

📰 Research Paper
Loading…
⏳ Fetching content…