Hi!

Just to avoid to reinvent the wheel...

Has anyone already managed to solve this problem?

Find a key k from this expression:

k^65537 mod M = N, where:

M and N are known huge integers (64 bytes long)

^ denotes the exponentiation operation

mod denotes the modulus operation (in C denoted as %, integer remainder between two integers)

In other words: the problem is to find the integer n-th root of an huge integer; the further modulus operation may make the things more difficult.

I digged through the net, but I could not find nothing interesting.

I suspect that some faster approach must exist, different from the classical RSA-breaking problem (which consist in finding two primes whose multiplication yields the modulus operand M).

My best regards to all.

## Bookmarks