Cryptology ePrint Archive: Report 2000/011

Tailored Key Encryption (TaKE) Tailoring a key for a given pair of plaintext/ciphertext

Gideon Samid

Abstract: Abstract. The prevailing cryptographies are attacked on the basis of the fact that only a single element in the key space will match a plausible plaintext with a given ciphertext. Any cryptography that would violate this unique-key assumption, will achieve added security through deniability (akin to One Time Pad). Such cryptography is being described. It is achieved by breaking away from the prevailing notion that the key is a binary string of a fixed length. The described key is random-size non-linear array: a graph constructed from vertices and edges. The binary naming of the vertices and edges, and the configuration are all part of the key. Such keys can take-on most of the necessary complexity, which allows the algorithm itself to be exceedingly simple (a-la Turing Machine).

Category / Keywords: foundations / deniability, random-size key, topological cipher

Date: received 21 Apr 2000

Contact author: gideon at dgsciences com

Available format(s): PDF | BibTeX Citation

Version: 20000421:184503 (All versions of this report)

Short URL: ia.cr/2000/011

Discussion forum: Show discussion | Start new discussion