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 answers only
not deleted
user 452
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`.
5
votes
Affine cipher and plaintext attacks, how to find the base modulo?
Well, to start off with, we have:
$$k_1 m_1 + k_2 - n_1 p = c_1$$
$$k_1 m_2 + k_2 - n_2 p = c_2$$
$$k_1 m_3 + k_2 - n_3 p = c_3$$
Where we know $m_1, c_1, m_2, c_2, m_3, c_3$, and we don't know $k_1 …
- 151k
6
votes
Accepted
AES with linear S-Box
does the cipher become entirely affine and hence trivially weak?
Yes; the AES sbox is the only source of nonlinearity (the ShiftRows and MixColumns are linear, and AddRoundKeys for a fixed key is …
- 151k