Novel symmetric key algorithm for high speed encryption

Abstract

A novel symmetric key algorithm for high speed encryption comprises an encryption algorithm and a decryption algorithm, wherein the encryption algorithm comprises the following steps: grouping plaintexts M to obtain Mi; generating basic keys R1 and R2 by using a random number generator; collecting statistics about a plaintext length L, and filling Mn-1 with plaintext, that is, firstly filling a binary key generator identification code, calculating remaining bits, and filling with random binary code; getting a key offset generator G; encrypting a Mn-1 plaintext group; obtaining an encrypted key Keyi; encrypting all the plaintext groups; encrypting the basic keys R1 and R2, to obtain a cipher key CR; and completing the encryption, and transmitting the obtained ciphertext. The novel symmetric key algorithm has the advantages that the probability of key repetition is zero, and the encryption subkey of each plaintext segment is unique and random, so that the security is high; and the encryption speed is fast, that is, only two offsets, two modular operations, one multiplication, two additions, one judgment, two different or same 10-step basic operations are needed.

Description

technical field [0001] The invention relates to the technical field of information encryption, in particular to a novel symmetric key algorithm for high-speed encryption. Background technique [0002] With the improvement of computer performance and the rise of big data, our requirements for data processing and computing power have increased geometrically. At the same time, with the emergence of side-channel attacks, many highly secure cryptographic algorithms have been destroyed, and the original highly secure AES (Advanced Encryption Standard) algorithm was cracked in the 128-bit system. People began to design and find algorithms with faster encryption efficiency and higher security. [0003] The current mainstream symmetric key algorithms or stream cipher algorithms typically include the RC4 algorithm, the RC6 algorithm, the Rijndael algorithm in AES encryption, and the national secret standard SM4 algorithm. [0004] (1) RC4 algorithm: RC4 encryption algorithm is a str...

AI Technical Summary

Problems solved by technology

But for the adversary, the length of the plaintext is known when the ciphertext is intercepted. Assuming that the length of the plaintext message sent is N, the length of the ciphertext is also N. Then when the value of N is smaller than the computing power of the adversary, there is no secrecy sex at all

In addition, because the one-time encryption key is randomly distributed, and assuming that the plaintext has a certain prior probability distribution, then according to the posterior probability distribution of the ciphertext, it can also pose a certain threat to the plaintext

[0010] (2) Inconvenience in actual use: Assuming that a long message is encrypted, a codebook of the same length as the message sample itself is required, because the codebook is the key itself, so the key must be safely sent to the receiver

However, the stream cipher algorithm is not provably secure, but only sacrifices provable security to compromise practicality

[0012] Chinese invention patent CN201610467088.7, the publication date is 2016.09.21, discloses an AES data encryption method based on FPGA-based online key generation, but the encryption method has too many rounds of encryption, the encryption method is single, and the key will appear repeatedly , data security cannot be guaranteed

[0013] Therefore, there is an urgent need for an efficient key algorithm with one-time pad, fast encryption speed, and non-recurring keys, but there is no report about this algorithm at present

Images