# US 2022/0045856 A1 · Split Security Solutions for Video/Audio Using SpaceFlip Class Ciphers

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0045856 A1
- Document ID: US20220045856A1
- Status: Published application
- Kind: A1
- Application number: 17/510,324
- Filed: 2021-10-25
- Published: 2022-02-10
- Earliest claimed: 2020-04-22
- Inventors: Gideon Samid
- Web page: https://patentgrep.com/patent/US20220045856A1

## CPC

- G06F 21/602: {Providing cryptographic facilities or services}
- H04L 9/14: using a plurality of keys or algorithms
- H04L 9/002: {Countermeasures against attacks on cryptographic mechanisms (network architectures or network communication protocols for protection against malicious traffic H04L63/1441)}
- H04L 9/0618: {Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation}
- H04L 9/0836: {using tree structure or hierarchical structure}
- H04L 9/085: {Secret sharing or secret splitting, e.g. threshold schemes}
- H04L 9/0858: {Details about key distillation or coding, e.g. reconciliation, error correction, privacy amplification, polarisation coding or phase coding}
- H04L 9/0861: {Generation of secret information including derivation or calculation of cryptographic keys or passwords}
- H04L 9/0897: {involving additional devices, e.g. trusted platform module [TPM], smartcard or USB}
- H04L 9/16: the keys or algorithms being changed during operation
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 63/0471: {applying encryption by an intermediary, e.g. receiving clear information at the intermediary and encrypting the received information at the intermediary before forwarding}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Audio files and Video files are processed with a new level of security by first spotting parts thereof with a strong entropic impact, and treating these sensitive parts (e.g. human faces, secret gadgets) with equivocation generating ciphers that would withstand quantum computer cryptanalysis.

## Claims

### Claim 1

A method to limit the damage from a successful cryptanalysis of a ciphertext, P, by (i) identifying plaintext parts, P*, that when exposed cause the highest damage, and (ii) encrypting these parts with an equivocation generating cipher, E*, using a shared key, K*, while encrypting the other parts, P{circumflex over ( )}=P−P*, of the plaintext with a zero-equivocation cipher, E{circumflex over ( )}, using another shared key, K{circumflex over ( )};
communicating the two ciphertexts C*=E*(P*, K*) and C{circumflex over ( )}=E{circumflex over ( )}(P{circumflex over ( )}, K{circumflex over ( )}) to the intended recipient, along with re-assembly instructions so that the recipient will build back P after decrypting C* to P* (P*=D*(C*)), and decrypting C{circumflex over ( )} to P{circumflex over ( )} (P{circumflex over ( )}=D{circumflex over ( )}(C{circumflex over ( )}) wherein the process comprising:
(i) An Encryption Station, comprising:
(i)a: Plaintext Splitter P→P*+P{circumflex over ( )}+splitting information, μ
(i)b: Equivocation Generating Encryption (C*=E*(P*, K*)
(i)c: Zero-Equivocation Generating Encryption (C{circumflex over ( )}=E{circumflex over ( )}(P{circumflex over ( )}))
(i)d: Ciphertext Assembler (C*+C{circumflex over ( )}→C)
wherein the following steps are executed:
1. An external source submits a plaintext P to be S3 processed.
2. The plaintext splitter (PS) splits P to P* an P{circumflex over ( )}.
3. P* is encrypted to C*
4. P{circumflex over ( )} is encrypted to C{circumflex over ( )}
5. The ciphertext assembler module assembles C from C* and C{circumflex over ( )} and μ
(ii) An Decryption Station comprising:
(ii)a. Ciphertext Disassembly Module
(ii)b. Equivocation challenged Decryption Module
(ii)c Zero Equivocation Decryption Module
(ii)d. Plaintext Reassembly Module
wherein the following steps are executed:
(ii)1 Ciphertext Disassembly (C→μ, C*, C{circumflex over ( )})
(ii)2. Equivocation Challenged Decryption, D* (C*→P*)
(ii)3. Zero Equivocation Decryption, D{circumflex over ( )} (C{circumflex over ( )}→P{circumflex over ( )})
(ii)4. Plaintext Reassembly (P*, P{circumflex over ( )}, μ→P).

### Claim 2 (depends on 1)

The method of claim 1 applied to image security where P* is any of the following:
(i) listed sensitive items: machinery, gadgets, constructions that are listed in a reference ledger as being specially sensitive, in need to prevent their cryptanalysis with the highest priority,
(ii) human identifying features: mainly faces, birth marks, and tattoos.

### Claim 3 (depends on 2)

The method of claim 2 where facial recognition software scans an image before encrypting it, identifies rectangles depicting human faces, and marks them for E* encryption, where the rest of the image will be marked for E{circumflex over ( )} encryption.

### Claim 4 (depends on 1)

The method of claim 1 applied to securing audio files wherein P* is determined by (i) voice recognition for a target speaker, such that what the target speaker says is regarded as P* and the balance as P{circumflex over ( )}, and by (ii) voice transcription, where the transcribed words are checked against a list of words that need extra high protection.

### Claim 5

A method to effect a secret transposition of a large bit string, P, and communicate it from its transmitter to its recipient by using equivocation generating cipher to encrypt the transposition protocol, with a cipher E* which operates on the basis of large quantities of unilateral randomness and short quantity of bilateral randomness, and where the only shared information between the transmitter and the recipient is the shared randomness, while a third party will face an equivocation challenge due to the overall large amount of randomness used to effect the transposition.

### Claim 6 (depends on 5)

The method in claim 5 wherein P is mapped into an N-dimensional space, Ω, using a mapping algorithm FNΩ, where each bit of P occupies an N-dimensional address in Ω, and where Ω is divided to n N-dimensional cubes, ωi for i=1, 2, . . . n, and where the address and size of each of the n cubes is recorded in cube-address file, Q, and where the content of each N-dimensional cube is mapped onto a linear string, ci for i=1, 2, . . . n using a mapping algorithm, FNω which is different from FNΩ, and where the n ci strings are concatenated in an order O, to form a string C, and where O is added to file Q, and where next C and Q are transmitted to a recipient, and where the recipient breaks C apart to the n ci strings, and then the recipient uses FNω to map ci for i=1, 2, . . . n to the n corresponding N-dimensional groups, thereby reconstructing Ω, and where next the recipient maps Ω to P using FNΩ.
