Multiple uncertainty encryption system with misleading function

Abstract

The invention discloses a multiple uncertainty encryption system with a misleading function, which aims at attacks such as rubber-hose attacks, key stealing, brute force attacks and the like. Multiple encryption is performed, and an algorithm and encryption multiplicity are uncertain, so the system has multiple uncertainty, a password analyzer cannot perform analysis, and even though the brute force attacks are adopted, a plaintext obtained only by incomplete single decryption is meaningless. The encryption multiplicity of the algorithm, encryption algorithms of each layer and keys of each layer are all uncertain, and are all included in a structural master key. The multiple uncertainty makes securer the algorithm. The system is required to comprise an improved one-time pad mechanism, and one-time pad has high reversibility, so the encryption system can obtain pseudo keys in two ways to mislead and confuse the password analyzer, and has high value in military affairs and special occasions.

Description

technical field

[0001] The invention belongs to the field of cryptography and relates to a multiple encryption system with misleading function and uncertain algorithm. Background technique

[0002] In the existing encryption algorithm design, the algorithm is single, and based on the Kerckhoff assumption, the encryption algorithm can be made public, and a cryptographic system should store all secrets in the key, so it does not involve the secrecy of the algorithm itself . Although Kerckhoff assumes that the cryptographic algorithm is public, it is not necessarily feasible to obtain the algorithm in general. Disassembly and reverse engineering are also software and hardware devices that need to obtain the algorithm. In principle, many key protection technologies can also be used to protect the algorithm. , the software and hardware of the algorithm can be protected to a certain extent, and it can prevent the opponent from obtaining it as much as possible. Even if the other p...

Examples

Embodiment Construction

[0026] For convenience, the example is relatively simple.

[0027] (1) First determine the algorithm used, AES128, AES192, AES256, IDEA, improved one-time pad, algorithm R agreed by a certain communication algorithm, and encode them respectively 00000000, 00000001, 00000010, 00000011, 00000100, 00000101.

[0028] (2) Determine that the length of the final ciphertext of the system is a multiple of 768. The last 768 block is the ciphertext obtained by filling the length of the plaintext and encrypting it.

[0029] (3) It is stipulated that the multiplicity of encryption shall not exceed 256, and the structure of the key is

[0030] GK=M||A 1 ||A 2 ||……||A M ||K 1 ||K 2 ||……||K M ,

[0031] Among them, M has a fixed length of 8 bits, and A i is 8 bits, K i Its length is determined according to an algorithm. If it is a stream cipher or an improved one-time pad, take a key of the same length as the final ciphertext, that is, the length after padding +768.

[0032] (4) B...

technical field

[0001] The invention belongs to the field of cryptography and relates to a multiple encryption system with misleading function and uncertain algorithm. Background technique

[0002] In the existing encryption algorithm design, the algorithm is single, and based on the Kerckhoff assumption, the encryption algorithm can be made public, and a cryptographic system should store all secrets in the key, so it does not involve the secrecy of the algorithm itself . Although Kerckhoff assumes that the cryptographic algorithm is public, it is not necessarily feasible to obtain the algorithm in general. Disassembly and reverse engineering are also software and hardware devices that need to obtain the algorithm. In principle, many key protection technologies can also be used to protect the algorithm. , the software and hardware of the algorithm can be protected to a certain extent, and it can prevent the opponent from obtaining it as much as possible. Even if the other p...

Examples

Embodiment Construction

[0026] For convenience, the example is relatively simple.

[0027] (1) First determine the algorithm used, AES128, AES192, AES256, IDEA, improved one-time pad, algorithm R agreed by a certain communication algorithm, and encode them respectively 00000000, 00000001, 00000010, 00000011, 00000100, 00000101.

[0028] (2) Determine that the length of the final ciphertext of the system is a multiple of 768. The last 768 block is the ciphertext obtained by filling the length of the plaintext and encrypting it.

[0029] (3) It is stipulated that the multiplicity of encryption shall not exceed 256, and the structure of the key is

[0030] GK=M||A 1 ||A 2 ||……||A M ||K 1 ||K 2 ||……||K M ,

[0031] Among them, M has a fixed length of 8 bits, and A i is 8 bits, K i Its length is determined according to an algorithm. If it is a stream cipher or an improved one-time pad, take a key of the same length as the final ciphertext, that is, the length after padding +768.

[0032] (4) B...