US 2020/0092080 A1Published application

Unbreakable communication cypher without a preliminary sharing of random elements

OwnerMikhail M. Mestechkin, Tanya Mestechkinainventors

Life of this patent

Estimating the term…

Loading patent…

Abstract

Proposed secure communication methods are based on a specific numbering of every n-block (the block number is a cyphered text). Because of a random number included in block plain text, the block number itself becomes random. Since any random number is used only once, the method satisfies the Shannon criterion for the unbreakable code, but does not require a delivery of the random elements to recipient in advance. Recipient should know only its position in a block. Reciprocal math procedures, including a special hash-function of binomial coefficients, allow extracting the plain text from the block number. The system distinguishes immediately a false cypher message. We programmed three restricted algorithms: “dictionary”, “anagram”, and “division” (maximal block carries ≈95 exbibyte as compared to 64 kibibyte in the main unite of AES). The necessary equipment is an average quality commercial computer for each communicating party.

Claims3

Dependent claims

the process of information transfer between two terminals, each equipped by a commercial computer supplied by the program described in claims 2, 3, and connected to the internet;

the program encrypts each block of a plain text combining it with a random element (number, set of letters, etc. not preliminary delivered to the recipient) and, thus, guarantees an absolute security of the communication line, satisfying the Shannon criterion of unbreakable code;
the program starts from a sequence of mathematical manipulations, which transform a block of plain text and a random number into a unique natural number, which, therefore, itself becomes random;
the way of combination of plain text with a random element (positions, etc.) serves as a key;
the program at the recipient's terminal restores the entire block of the plain text from the obtained number and simultaneously remove the random elements by means of reciprocal mathematical procedures;
this principle of coding satisfies the Shannon criterion of an unbreakable code, but does not require a preliminary delivery of random elements.

2 more elements

Dependencies are inferred from the claim text.