Cryptology ePrint Archive: Report 2015/510

Equivoe-T: Transposition Equivocation Cryptography

Gideon Samid

Abstract: Plaintext is mixed with AI-generated dis-information which binds the cryptanalyst to an irreducible set of mutually exclusive plausible plaintext candidates.

As impractical as Vernam "One Time Pad" cipher has been, it's security strategy: equivocation is fundamentally superior to the prevailing strategy: intractability. Intractability erodes, equivocation endures. Alas, Vernam was an overkill. Equivocation works even if only a few plaintext candidates are left as an irreducible set, which is what Equivoe-T offers.

The AI engine builds decoys off the plaintext such that each decoy has a counter-meaning, or at least an off-meaning per the guarded plaintext, while claiming at least threshold plausibility to “pump” entropy into the irreducible field of plaintext candidates. Equivoe-T uses a complete transposition algorithm that guarantees the existence of a key that matches any two arbitrarily selected permutations of the n transposed elements. Therefore every decoy qualifies as a plaintext. The transposed elements may be words, letters, a mix, or otherwise. n can be selected to add intractability to the built-in equivocation since the key space grows fast (|Ktransposition| = n!).

Category / Keywords: foundations / equivocation, transposition, artificial intelligence

Date: received 27 May 2015

Contact author: gideon at bitmint com

Available format(s): PDF | BibTeX Citation

Note: Thank You for taking the time looking this over

Version: 20150527:192341 (All versions of this report)

Short URL: ia.cr/2015/510

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]