Paper 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).
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- deniabilityrandom-size keytopological cipher
- Contact author(s)
- gideon @ dgsciences com
- History
- 2000-04-21: received
- Short URL
- https://ia.cr/2000/011
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2000/011,
author = {Gideon Samid},
title = {Tailored Key Encryption ({TaKE}) Tailoring a key for a given pair of plaintext/ciphertext},
howpublished = {Cryptology {ePrint} Archive, Paper 2000/011},
year = {2000},
url = {https://eprint.iacr.org/2000/011}
}
