Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with chosen-plaintext-attack
Search options not deleted
user 21749
The attacker can specify his own plain text and encrypt or sign it.
1
vote
1
answer
620
views
Probabilistic RSA, IND CPA
Suppose we have classic RSA scheme. Let $n=pq$, $e$ public, $d$ secret.
Then message(M), not empty(not 0), is encrypted by choosing random $r$ and computing $A=(r^e)^e$ and $B=(Mr)^e$
$(A,B)$ is the …
- 235
1
vote
Probabilistic RSA, IND CPA
I think i got it.
Query:
Let $m={1,2}$, and query $oracle(m)=(A,B)$
Checking:
Lets compute $s=B^e=(m^er^e)^e=m^{e^2}A$
Lets compute $sA^{-1}=\frac{m^{e^2}r^{e^2}}{r^{e^2}}=m^{e^2}$
if $s=1$ then …
- 235