Attacks · Channel & cryptanalysis
More recordings need not uniquely determine the secret. Anti-unicity framing keeps ambiguity alive even as the observer’s ledger grows.
~7 min readContinue: Quantum
The archive attacker believes that enough film uniquely names the secret. Stack sessions, grow the ledger, wait for classical unicity distance to deliver a single surviving hypothesis. The conversion is patience: observation volume becomes certainty. Unicity myths are patience dressed as mathematics: wait for the archive to crown one answer.
Classical Shannon unicity stories train this instinct. Redundant languages plus enough ciphertext eventually leave one plaintext. Ambient authentication with reusable secrets makes “watch enough logins” feel inevitable. Marketing myths treat archive size as destiny. Shannon’s classical story is not wrong for redundant languages — it is the wrong story for empty effective channels.
Under empty effective mutual information and structured ambiguity, the archive can grow while uniqueness stays away. More film need not uniquely determine φ. Anti-unicity is the visitor framing: the notebook fills; the secret does not fall out under the named model. Pair this page with correlation and unicity-distance theory for the formal depth. Anti-unicity does not mean “delete logs”; it means logs need not uniquely name φ under the model.
Read the dual plates as ambient success versus mechanism denial for archive unicity: the surface plate shows why classical estates pay; the denial plate shows which ENI6MA check family stops the conversion without dumping an NDA attack-to-stage matrix. Claims below stay model-scoped.
Watch enough → unique secret
How to read: reels pile up; ambient myth says more film uniquely determines φ. Takeaway: classical unicity treats archive as destiny.
Ambient unicity success is the meter that finally crosses uniqueness.
More film ≠ unique secret
How to read: “watch enough” myths crossed out; I_eff = 0 and ambiguity hold. Takeaway: under the model, unicity stays away.
Model-scoped empty MI keeps the meter from crowning a single secret — anti-unicity is the design goal opposite classical Shannon collapse for authorization transcripts.
Ceremony archives do not crown φ.
Stitch and unicity myths travel together.
This paper presents an end-to-end security argument for an ENI6MA-style interactive proof in which the attacker gains nothing in Shannon’s sense of perfect secrecy. The mechanism combines a one-time, entropy-dependent projection of the alphabet into six perceptual leaves; ring-rotation diffusion that spreads symbol appearances across a large configuration space; confusion from a private bijective map to six synonyms; and a second-layer enumeration of the 6! leaf permutations.
Invited paper (Transactions on Information-Theoretic Security, Vol. I, No. 1, 2026) examining two contemporary pressures: the widening reach of quantum computation and ever-faster classical hardware. The authors argue for cryptographic systems whose security does not rest solely on the difficulty of a mathematical problem and that leave no recoverable trace of the secret in the observable record.
This essay presents a membership-only proof-of-knowledge protocol in which a prover convinces an observer she knows secrets without revealing them. Three intertwined ideas (balanced partitions into six equal leaves, independent ring rotations that eliminate positional anchors, and a private bijection that permutes leaf labels) throttle leakage to at most log₂6 bits per round and, in expectation, to essentially zero useful signal for predicting the next character.
A quantitative information-theoretic analysis of how much an adversary can learn by observing a complete ENI6MA / Rosario–Wang authentication ceremony. The paper separates surface bits (Shannon entropy of symbols an observer can record) from effective bits (secret-relevant mutual information those recordings pin down), and argues that effective mutual information with the secret remains zero across rounds and ceremonies under the named model.
Anti-unicity claims are model-scoped: the observer’s ledger of (C_i, O_i) may grow while O_{1:n} need not uniquely determine the hidden state when effective mutual information stays empty under the axioms. Structured ambiguity preserves many hypotheses consistent with the archive. Companion papers (toward perfect secrecy, new dimensions, observer-bit model) formalize surface-versus-effective bits and non-unicity for authorization transcripts — not a claim that logs should be deleted.