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 encryption
Search options not deleted
user 819
Encryption is the process of transforming plaintext using a cipher into ciphertext to make it unreadable to anyone except those possessing the key. Decryption is the process of transforming that ciphertext back into plaintext, using the key.
5
votes
Is the polynomial reconstruction problem really "intractable"?
The polynomial $p$ of degree $k$ can be reconstructed if at least $k+1$ correct points
are known (that is, we know that $(x_i,y_i), 0 \leq i \leq k$ are correct meaning that
$y_i = p(x_i), 0 \leq i \ …
- 2,781
2
votes
Is there a way to use Shamir Secret Sharing with updatable data?
If you don't update the shares, then any $T$ share holders will be able to reconstruct only the original secret $S_{\scriptstyle{\text{old}}}$, and
not the updated version $S_{\scriptstyle{\text{new}} …
- 2,781