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 modular-arithmetic
Search options not deleted
user 75391
Modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" upon reaching a certain value… the modulus.
0
votes
1
answer
310
views
In RSA encryption, can I calculate d given only m,n,c and e? [duplicate]
Newbie here. Not familiar with cryptography; just interested and reading up about it from time to time.
We know that the RSA problem (let's say $c=m^e \bmod N, c^d= m \bmod N$) is about recovering $ …
- 153
2
votes
1
answer
136
views
Finding a pair of exponents so that $c^a \bmod N = c^b \bmod N$
I am not very familiar with RSA, so this question may appear to be stupid.
Suppose that in RSA encryption, we are given $c$ (the ciphertext) and $N$ (the semi-prime modulus), can we find a pair of e …
- 153