Emergent Steganography

Imagine I give you a children's 'connect-the-dots' book. The secret is not which picture you draw, but the specific, weird sequence of dot numbers I tell you to follow. The sequence is the secret algorithm. Even if you know I'm using the same book, you can't guess my sequence just by looking at the final picture.

In cryptographic terms:

I propose moving the secret from a key \(k\) within a public function \(F(k, ·)\), to the generative description of the function itself \(F_{RC}(·)\). The adversary's task shifts from key-space search over \(K\) to algorithm-space search over the combinatorial space of valid rule chains derivable from a rule library \(R\).

From a trust issue to the manifestation of a steganographic structure

I'm about to hand a sensitive document to several friends for review. I'm afraid to wake up a Sunday morning to see my precious document all over the internet, clueless of how it happened. How to reduce the cognitive burden of such a horrid thought so I can sleep a bit more carelessly on Saturday night?

To answer that question, I started to frantically draft multiple cryptographic chains in a desperate attempt to secretly embed the identities of each of my recipients inside the handed document. I was trying hard to combine multiple techniques such as watermarking, data encryption—and even QR code transformations—until I realized that, before someone even managed to crack the different encryptions I was chaining, they would have needed to know the actual sequence of transformations used to have a chance at extracting the hidden information.

That is how my work began on the Emergent Steganography framework.

In the following sections I will explain the framework's core concepts.

While I will try to keep things relatively intuitive and employ as little jargon as possible, a few mathematical objects and a bit of cryptographic lexicon will need to be introduced.

A more formal version of the framework is available for those of you who are more comfortable with symbols and jargon: Emergent Steganography — A Framework for Algorithm-Generating Information Hiding.

Defining the pieces

Before this becomes mystical, let us slow down and name the pieces.

There is:

• A payload — the information I want to hide. Call it \(D\). A sequence of bits. Nothing romantic.

• A carrier — the visible object that will host it. Call it \(C\). A document. An image. A sound file. Something that looks ordinary.

Now comes the interesting part.

Instead of one monolithic hiding technique, I define small reversible moves.

I call each of these a rule.

A rule is simply:

• A transformation that takes something of one type,

• Turns it into something of another type,

• And can be perfectly undone.

If a rule scrambles, it must be able to unscramble. If it reshapes, it must be able to reshape back. Nothing is allowed to evaporate.

Mathematically, this is called a bijection — a transformation that never loses or duplicates information.

Why is that non-negotiable?

Because if even one step leaks information, the secret may not come back intact.

So every rule carries its own forward motion and its precise reversal.

Fitting the gears

Now imagine I collect many such reversible moves.

This collection is my rule library \(R\).

Individually, each rule is simple. Almost boring.

But I do not use them alone.

I chain them.

A rule chain is an ordered sequence of compatible rules, where each step produces exactly the kind of object the next step knows how to transform.

Like gears that actually fit.

Because each individual move is reversible, the entire chain is reversible.

That is the quiet structural guarantee.

Running the machinery

The embedding process is nothing more than:

Apply the rules in order.

The extraction process is:

Apply the same rules in reverse order, undoing each one.

If every step is perfectly reversible, then the entire structure is reversible.

And this is the one property the framework promises — not probabilistically, not heuristically, but structurally:

If you know the exact chain, you recover the exact data.

No guessing. No approximation. No entropy loss.

Formally, yes, it reduces to:

\[ \boxed{X(RC, E(RC, D, C)) = D} \]

But conceptually, it simply says:

If you know how it was hidden, you can unhide it exactly.

The framework in action

I built a proof-of-concept to test the tangible feasability of the idea. The Julia implementation can be cloned from Github — EmergentSteganographyDemo.jl.

The code repository contains a README that should help you get started with manipulating the package.

Just a word of caution: this isn´t in any case a definitive product. The prototype is testable as is, but not ready for any other purposes. There are many ways to make it cleaner, but my intention was to get a minimal workable artifact to play with.

Did I solve my initial issue?

Well, almost but not quite yet. This framework is just a basis that helped me construct a solution to my initial issue, i.e., lowering the risk of leak and, if it does eventually happen, being able to trace it back to its potential root cause.

I further elborate on the instanciation of the solution in Cryptographic Document Attribution.

Emergent Steganography as a philosophical lens

Now here is where things get interesting. If we apply the framework to hermeneutics (the practice of extracting and comparing meanings from a scriptural text) then interpretations become attempts to build the possible inverse rule chains between a meaning (payload) and a its observable representation (carrier). More on this topic in The Structure of Meaning.

Another adjacent philosophical stance connected to this framework is Bijectivism, where I tried to reframe reversibility as a structural necessity to any transformation instead of an afterthought.

Last note

While my first intent was operational, I believe that the underlying structure behind Emergent Steganography can be used as a complementary lens to reason about connections, in a broad sense. Feel free to borrow that lens and try it on your own domain of expertise to see if it helps make things more legible.