Score:0

RSA with p and q being generated by pow expression of weak random seed

kw flag

n, e and modulus of RSA are given and n is very large. p and q are primes generated by pow(7, random_seed, modulus), and the seed that p and q used is very close. How can I get p and q, or is there any other way to decrypt this RSA?

Maarten Bodewes avatar
in flag
$n$ is calculated using $p$ and $q$. How is the `modulus` set in the given algorithm? How did you make sure that the result is indeed prime? Is this some kind of riddle, assignment, CTF or homework?
I sit in a Tesla and translated this thread with Ai:

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.