Symmetric cipher table and symmetric key algorithm

Abstract

The invention discloses a symmetric cipher table. All or partial cipher characters in the symmetric cipher table correspond to common rows and common columns, as well as random rows and / or random columns (which makes the table difficult to crack) ; a few rows and / or columns can be formed by several contiguous zeros. The invention further discloses a symmetric key algorithm. A plaintext is divided into plaintext character segments, and the plaintext character segments are divided into plaintext character sets; the plaintext character sets correspond to elements (including one or more of row, column, region, table and difference elements) in the table and are subjected to forward cascading (i.e. the position of a previous element refers to the position of a next element), so that the plaintext character segments or the plaintext are encrypted into cipher characters in a tail reserving manner (i.e. the cipher characters correspond to the last plaintext character set in the plaintext character segment or the plaintext). A multiple-character plaintext can be encrypted into a cipher character set by using the symmetric key algorithm, so that the ciphertext becomes brief.

Description

technical field [0001] The invention relates to symmetric ciphers, in particular to a symmetric cipher table and a symmetric encryption method; the symmetric encryption method is based on the symmetric cipher table. Background technique [0002] In the patent application "a parametric cipher system and a direct communication method and an indirect communication method" (201410211178.0): (1) the cipher table Ac is a symmetric cipher table; (2) in Ac, the plaintext character group Fvg corresponds to the initial character Ecbd, and Ecbd corresponds to the special-purpose password character group Xcih, so that Fvg is encrypted into the ciphertext character group Fvg' (Fvg'=Xcih, or relevant to Xcih); (3) in Ac, in the special-purpose password character The public row Ic and the public column Hc are respectively arranged in order of size, so the i and h in the special password character Xcih are regular and non-random; Xcih corresponds to the public row and public column, but bec...

AI Technical Summary

Problems solved by technology

(1) For the safety of electronic payment, it is often necessary to use random verification codes; for example, online ticket purchases require the use of verification codes on computers, but it is often impossible to prevent "scalpers" from using ticket-grabbing software to rob tickets; (2) ) For example, when operating online banking, the mobile phone SMS verification code sent by the bank to the bank card user may be intercepted (shielded) by the mobile phone virus and secretly forwarded to the mobile phone designated by the criminal, causing the user's bank card to be stolen; (3) The magnetic stripe bank card being used is easy to be cloned and swiped by criminals; (4) When the IC chip bank card is used in shopping malls and supermarkets, the input password is easy to be peeped at; (5) The asymmetric encryption algorithm RSA (public The key encryption algorithm, which has been used in the USBKey of the bank, such as U-Shield), has a key length of 1024 bits or 2048 bits, resulting in relatively slow calculations and even relatively large power consumption. It is only suitable for small data and is not universal (need to download (6) Biometric identification (fingerprint, face, iris) not only has technical limitations, but also cannot identify the authenticity of the communication content (only the identity of the communicator can be identified) (7) Smartphone QR code payment (mobile payment) is convenient, but the payment password will be peeped by a Trojan virus, or the smartphone will be "hijacked" by a Trojan virus; (8) For harassing text messages, especially fraudulent text messages, Existing technology has no good solution, leading to rampant fraudulent text messages

Images