View Single Post
  #2  
Old 06-03-2016, 16:42
Syoma Syoma is offline
reverse engineer
 
Join Date: May 2009
Posts: 338
Rept. Given: 35
Rept. Rcvd 77 Times in 50 Posts
Thanks Given: 15
Thanks Rcvd at 78 Times in 51 Posts
Syoma Reputation: 77
Quote:
Originally Posted by UniSoft View Post
This is not the RSA !!!
Did you ever read the topic? I wrote
It is the standard x^y mod n = c like RSA uses but with bad modulo N.
I did not write it is RSA. My suggestion was there may be simple math solution in number theory.

Just reviewed most popular directions. Do not see any simple solution.
x^7 = 3*3*31*4129*1499933*6041353 mod 2^64

Last edited by Syoma; 06-03-2016 at 16:54. Reason: Brutforce only?
Reply With Quote
The Following User Says Thank You to Syoma For This Useful Post:
dila (06-05-2016)