INNER CODE UNIT · C++

p

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

            p = toPrime((p - 1) / 2);
        }


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

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

        d = extEuclid(eilor , e);

        while(d < 0 ) {
            d += eilor;
        }

        pubKey.append(toArray(e, _rsa / 8));
        pubKey.append(toArray(modul, _rsa / 8));

View source record →

📰 Research Paper
Loading…
⏳ Fetching content…