# Tag Info

### Is a prime shifting method for RSA modulus generation safe?

No it is not secure, at least for small amount of shifts. Lets assume we applied $k$ bits circular shift to $p$ and obtained $q$. The relationship between $p$ and $q$ becomes: $q = 2^{k}.p-m.2^{n} +m$....
1 vote

### 1-out-of-2 Oblivious Transfer with RSA

Yes, reductions modulo $N$ are missing in the question, for $m_0+k_0$, $m_1+k_1$ (even though they do nothing for the parameters used), and the final $17−22=−8$, which after reduction modulo $N=15$ ...

### RSA perfect square phi

Thank you so much @fgrieu for the detailed and understandable answer. I quickly implemented it in python for anyone else interested in this: ...
Accepted

### Prove that if $e.d \equiv 1 \text{ mod } pq$ then it's impossible to have $e.d \equiv 1 \text{ mod } (p-1)(q-1)$

Now I want to prove that for the same pair $(e,d)$ it no longer holds that: That you are running into difficulties proving it may be due to the fact that it is, as you have laid out, not true. ...
### What happens if we know that for an RSA key pair, the equation $d^e \equiv c \pmod{n}$ holds?
Reformulating: it's asked if disclosing the integer $c=d^e\bmod n$ compromises the security of an otherwise secure RSA public key $(n,e)$ with private exponent $d$. I'll assume $0<d<n$, as ...