Steganographic use of Arithmetic Coding with Stochastic Ordered CFG. Inspired by http://www.nic.funet.fi/pub/crypt/old/mimic/mimic.text ⚠️ experimental ⚠️. Try it, it's probably fast enough for actual use now (depending on the grammar)!

fnordomat 3d4224fa30 version 0.0.5 1 week ago
benches 24a44bd587 towards #3: stochastically detecting runaway expansion. also enables the checks #2 and #3 and check for missing start symbol when running --validation 1 week ago
devtools 7db36c0ac3 apply power method to $A^p$ not $A$, where $p$ is the lcm of all possible periods of the transition matrix, to prevent (optional, features = "linalg") static runaway detection from being foxed by periodic, non-mixing behaviour 1 week ago
examples fe21021583 example grammar: variations of a scary bitcoin spam/scam mail. 2 weeks ago
src 3d4224fa30 version 0.0.5 1 week ago
.rgignore c8e5be87ca cleanup; some unit tests for the grammar file parser; introducing grammar file format v0.0.1 2 weeks ago
Cargo.lock b305dd21de minor cleanup 1 week ago
Cargo.toml 3d4224fa30 version 0.0.5 1 week ago
README.md 37f33cd39e Update 'README.md' 1 week ago

README.md

  • PROOF OF CONCEPT * PROOF OF CONCEPT * PROOF OF CONCEPT * PROOF OF CONCEPT *

Steganographic use of Arithmetic Coding with Stochastic Ordered CFG.

Like this:

encode: 01101110100101 -> (()(())(())())

decode: (()(())(())()) -> 01101110100101

Similar to, and inspired by http://www.nic.funet.fi/pub/crypt/old/mimic/mimic.text

Beware: experimental. The crypto lacks an independent review. However, the methodology appears to be sound and the program should now be fast enough for practical use.