Timeline for Can RSA be used to encrypt p?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 26, 2017 at 1:59 | comment | added | fkraiem | More precisely, $u$ is the quotient of the Euclidean division of $p^{k\cdot \varphi(n)}$ by $q$ (the remainder is $1$). | |
| Sep 25, 2017 at 10:58 | comment | added | AdveRSAry | It could be any natural number i.e. $u \in \mathbb{N}$ That is basically the definition of mod operator. | |
| Sep 25, 2017 at 10:54 | comment | added | desowin | Could you please explain what is $u$? | |
| Sep 25, 2017 at 10:16 | history | answered | AdveRSAry | CC BY-SA 3.0 |