Near Matches
Ignore Exact
Everything
2
ERIKO-CHAN cipher (idea)
See all of ERIKO-CHAN cipher
, there is 1 more in this node.
Confirm
Do you really want to send novalis a message saying you like their work?
OK
X
(
idea
)
by
novalis
Sun Jan 07 2001 at 11:56:42
There are lots of bad keys, of the form A^n/B^m, where A, B, n, and m are
integer
s.
A known
plaintext
recovers the keystream. With a little work, it could possibly recover the key, but only for very long plaintexts.
The key cannot be re-used. Given 2
ciphertext
s encrypted with the same key, add them (mod 6 digitwise). This gives plaintext 1 + plaintext 2. It's pretty easy to recover the texts from this - there aren't that many possibile ways for 2 meaningful
English
text streams to be combined to form a given stream.
Similar (numerically almost equal) keys will give streams with the same set of initial digits. This can be
trivially
fixed by simply ignoring the first 15 or so digits.
Social Security number
Is it you, Sir, who cut me? Or is it I who cut you?
kid sister encryption
Polybius square
A short writing game
modulo
Stream Cipher
ciphertext
public key
dichotic gender paradigm
3D Turnip
(creator unknown)
Do Make Say Think
fangirl
continued fraction
Poetry in Motion at Poetry.com
Stork bites
gender-neutral pronoun
symmetric cipher
transposition cipher
plaintext
transgender
Trivially
Coal tar