Denial featured cryptography

• US 20050031120A1
• Filed: 05/25/2004
• Published: 02/10/2005
• Est. Priority Date: 02/01/1999
• Status: Abandoned Application

• Current Assignee: Gideon Samid
• Original Assignee: Gideon Samid
• Inventors: Samid, Gideon
• Application Number:
  US10/852,689
• Publication Number:
  US 20050031120A1
• Time in Patent Office: Days
• US Class Current: 380/28
• CPC Class Codes: G09C 1/02 by using a ciphering code in chart form
• CPC Class Codes: H04L 9/0838 Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these network architectures or network communication protocols for key exchange in a packet data network H04L63/061

Abstract

Daniel (alternatively written as DNL) is a cryptographic paradigm, featuring ease of matching: many plaintexts of choice to any give cipher (the deniability property). Consequently, the cipher itself cannot betray the specific plaintext that generated it, as it is “lost” in the large list of candidate plaintexts, all of which are decryption-generated from the ciphertext.

Claims

1. A method comprising:

inputting a plaintext;

transform the plaintext into a non-repeat plaintext;

outputting a raw-cipher from the non-repeat plaintext wherein the raw cipher includes at least one message by applying a reduced key to the raw cipher text; and

reproduce a first message by applying a first key to the raw ciphertext.

2. The method of claim 1, further comprising reproducing a second message by applying a second key to the raw ciphertext.

3. The method of claim 2, wherein the second key is more detailed than the first key.

4. The method of claim 1, comprising selecting a starting element for the first key.

5. The method of claim 2, comprising selecting a starting element for the second key.

6. The method of claim 1, comprising expanding the non-repeat plaintext such that the size of the raw ciphertext is different from the size of the plaintext.

7. The method of claim 1, wherein the first key and the second key each include a plurality of bridges, each bridge linking an element in the non-repeat plaintext.

8. The method of claim 1, wherein the first key and the second key each have a different starting element in an overall key.

9. The method of claim 1, wherein the raw ciphertext and the plaintext are different sizes.

10. The method of claim 1, comprising collapsing the raw ciphertext to reproduce the first message.

11. The method of claim 7, wherein each of the bridges represents a direction in a two-dimensional space.

12. The method of claim 11, wherein the directions include up, down, left and right.

13. The method of claim 1, wherein the ciphertext defines a path on the first key which defines a message.

14. The method of claim 1, wherein multiple message can be reproduced with a given key and ciphertext.

15. The method of claim 1, wherein the first key provides full access to elements of different colors.

16. The method of claim 1, wherein the ciphertext can be matched with a large number of potential keys.