author = {Peter Wayner},
  title = {Mimic Functions},
  journal = {Cryptologia},
  month = {July},
  year = {1992},
  volume = {XVI},
  number = {3},
  pages = {193--214},
  keywords = {compression; subliminal channels; context-free grammar},
  abstract = {A mimic function changes a file $A$ so it assumes the
    statistical properties  of another file $B$. That is, if $p(t,A)$ is the
    probability of some substring $t$ occuring in $A$, then a mimic function
    $f$, recodes $A$ so that $p(t,f(A))$ approximates $p(t,B)$ for all
    strings $t$ of length less than some $n$.
    This paper describes the algorithm with its functional inverse, Huffman
    coding. The paper also provides a description of more robust and more
    general mimic functions which can be defined using context-free grammars
    and  van Wijngaarden grammars.}
  author = {Peter Wayner},
  title = {Strong Theoretical Steganography},
  journal = {Cryptologia},
  month = {July},
  year = {1995},
  volume = {XIX},
  number = {3},
  pages = {285--299},
  coden = {CRYPE6},
  issn = {0161-1194},
  keywords = {Mimic function; natural language processing; RSA},
  abstract = {Hiding the existence of a message can be an important technique
    in this era of terabit networks. One technique for practicing this
    obfuscation, Mimic Functions, is derived from Context-Free Grammars and
    can be as secure as inverting RSA or factoring Blum integers. This paper
    discusses the implications of the result and presents a practical solution
    for securely hiding information from inspection.}