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 cryptography
Search options answers only
not deleted
user 2253
Questions about the construction and analysis of protocols and algorithms for secure computation and communication (including authentication, integrity, and privacy aspects).
51
votes
Meaning of: "'If factoring large integers is hard, then breaking RSA is hard,' is unproven"
The easiest way to think about it is to think of the contrapositive.
The statement:
if factoring large integers is hard, then breaking RSA is hard
is equivalent to the following:
if breaki …
- 30.1k
1
vote
If P=NP, are there cryptosystems that would require n^2 time to break?
https://en.m.wikipedia.org/wiki/One-time_pad
A One Time Pad is secure regardless of complexity, as long as your numbers are truly random.
Even if you can try every key quickly, it's useless because …
- 30.1k
5
votes
What mathematics can be interesting for these CS areas?
As for cryptography, if you've got number theory, the only real thing I can think of to extend this is group/field theory. …
- 30.1k