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 affine-cipher
Search options not deleted
user 32368
A type of monoalphabetic substitution cipher, wherein each letter in an alphabet is mapped to its numeric equivalent, encrypted using a simple function `(ax + b) mod m`.
0
votes
1
answer
2k
views
Perfect secrecy of affine cipher
Given any probability distribution P r on the set
$\{k ∈ \mathbb{Z}_{26} : \gcd(k, 26) = 1\}$.
Show that the Affine Cipher achieves perfect secrecy if the key (k, a)
is used with probability $Pr(k) ·( …
- 31