CN115843360A - Symmetric encryption and decryption method based on exponential complexity - Google Patents
Symmetric encryption and decryption method based on exponential complexity Download PDFInfo
- Publication number
- CN115843360A CN115843360A CN202080102633.7A CN202080102633A CN115843360A CN 115843360 A CN115843360 A CN 115843360A CN 202080102633 A CN202080102633 A CN 202080102633A CN 115843360 A CN115843360 A CN 115843360A
- Authority
- CN
- China
- Prior art keywords
- random
- information
- key
- plaintext
- method based
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Theoretical Computer Science (AREA)
- General Health & Medical Sciences (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses a symmetric encryption and decryption method based on exponential complexity, which belongs to the technical field of information and comprises the following steps: step one, determining and disclosing a basic code table; step two, carrying out digital coding on the information plaintext to obtain a digital plaintext; thirdly, encrypting the digital plaintext by adopting a symmetric encryption method based on exponential complexity to obtain an information ciphertext; step four, information transmission; fifthly, decrypting the information ciphertext by adopting a symmetric decryption method based on exponential complexity to generate a random ciphertext; step six, decrypting the random ciphertext according to the corresponding relation to obtain a digital plaintext; and seventhly, decoding the digital plaintext to obtain the information plaintext. The invention satisfies the exponential security and simultaneously has lower ciphertext expansion rate, and can realize high-efficiency encryption and decryption.
Description
The invention discloses a symmetric encryption and decryption method based on exponential complexity, belongs to the technical field of information security, and relates to improvement of the symmetric encryption and decryption method.
With the development of internet technology, information security relates to aspects of people's life, and the requirements of more and more fields such as mobile payment, social software, personal information inquiry and the like on information security are higher and higher.
In the technical field of information security, information encryption is a core of information security. The cryptographic schemes in modern cryptography are based on various degrees of computational complexity assumption, which is generally assumed to be NP-hard. Many commercial schemes, such as DES, RSA, ECC, elgamal, etc., assume that the corresponding cryptographic attack is a complex problem. However, these assumptions do not have a strict proof. Worse yet, quantum algorithms have been found that can resolve any integer in polynomial time. Therefore, designing an encryption scheme based on the problem of complex deterministic indexes has important theoretical and practical application values.
The symmetric cipher scheme based on exponential complexity provided by the invention is based on strict exponential complexity problem, and the encryption and decryption processes are very efficient. Therefore, the method can be widely applied to various technical fields such as information communication safety, computer network safety and the like.
Disclosure of Invention
The invention aims to provide a symmetric cryptographic method which is high in efficiency and strictly theoretically ensured, and provides technical support for ensuring the safety of information communication.
In order to achieve the purpose, the invention provides the following technical scheme:
the symmetric encryption and decryption method based on the exponential complexity is characterized in that: comprises the following steps:
the method comprises the following steps: determining a basic code table according to the information content required to be transmitted and disclosing the basic code table;
step two: a sender inputs an information plaintext on coding equipment, and the coding equipment codes the information plaintext into a digital plaintext according to a basic code table;
step three: the encryption device adopts a symmetric encryption method based on exponential complexity to generate a random key, a seed key, a random recursive function and an initial key corresponding to the random recursive function, and then encrypts a digital plaintext to obtain an information ciphertext;
step four: the information network equipment discloses the information cipher text through a public channel, and transmits a random key, a seed key, a random recursive function and an initial key corresponding to the random recursive function to a decryption device through a secure channel;
step five: the decryption device decrypts the information ciphertext by adopting a symmetric decryption method based on exponential complexity to generate a random ciphertext;
step six: the decryption device decrypts the digital plaintext corresponding to the random ciphertext by using the random key according to the corresponding relation between the random ciphertext and the digital plaintext;
step seven: the decoding device decodes the digital plaintext into the information plaintext, and displays the information plaintext content to a receiving party through an output end.
Further, the basic code table in step one is determined by any one or both of the receiver and the sender, or a third party as required, and is a one-to-one correspondence between the basic element set of the information content and the integer interval, and once determined, is fixed; the number of basic elements of the information content is K, and the integer interval is [0,K-1].
Further, the symmetric encryption method based on exponential complexity in step three specifically includes: (1) grouping digital plaintext; (2) Randomly selecting a finite field, and selecting a random key to carry out randomized encryption on each group of the digital plaintext on the finite field to obtain a random ciphertext of a new group; (3) Randomly selecting a polynomial matrix as seed key M (x) in the finite field, and randomly selecting a recursive function sigma and its corresponding initial key U sigma based on the group number t (t) And encrypting the random cryptograph by using the seed key and the initial key to obtain an information cryptograph.
Further, the grouping of the digital plaintext in the step (1) specifically includes: the digital plaintext V is selected randomly to have a fixed length L according to the sequence, dividing the data into t groups, wherein the grouping result is V = { V = } j I j =1,2, …, t }, where V is j ＝(v j,1 ,v j,2 ,…,v j,L )，v j,i Is the ith corresponding single digital plaintext element in the jth grouping; if the last group is not long enough then one way is fixed to add redundancy to make it L in length.
Further, the finite field F q Number of elements q = p k Wherein p is a random prime number, k is an integer greater than or equal to lambda, and lambda is set according to the artificially set enemy attack frequency 2 λ To be determined.
Further, the step (2) is specifically: selecting a random key s =(s) in a finite field 1 ,…,s L θ, c), for each plaintext block V j All randomly generate a grouping random key u with the length c j ＝(u j,1 ,u j,2 ,…,u j,c ) And satisfies 0. Ltoreq. U j,i Q is less than or equal to q, i is less than or equal to 0 and less than or equal to c, and a Hash function H with theta as key is used θ Acting on the vector (s, u) j ) Upper score group V j Random encryption key H θ (s,u j ) By H θ (s,u j ) Encryption V j Obtaining the random cryptogram U of the group j ＝(V j +H θ (s,u j ),u j ) Wherein(s) 1 ,…,s L ) Is an element on the finite field, and theta is a mapping from L + c dimension finite field to L dimension finite field (i.e., F) q L+c →F q L ) Hash function of (H) θ C is an integer of 1 or more.
Furthermore, the seed key M (x) is a product of 2 (L + c) random triangular polynomial matrices, wherein there are L + c upper triangular polynomial matrices and L + c lower triangular polynomial matrices, respectively; the diagonal line of the upper triangular polynomial matrix and the lower triangular polynomial matrix is an algebraic domain F q The non-diagonal elements of the non-zero elements are sparse polynomials; what is needed isThe sparse polynomial is obtained by extraction which is not put back from a sparse polynomial set; the sparse polynomial set is constructed recursively according to the following steps: (a) Randomly choosing K elements in the set {1,2, …, q } forms a new set m = { m = k I k =1,2, …, N }, where N is the rounding-up of q/2; (b) In a finite field F q Is random up to each element m of the set m k Selecting a corresponding m k A second order polynomial, the N polynomials being summed to form a polynomial; (c) If the polynomial generated in step (b) is not in the sparse set of polynomials, placing the polynomials in the sparse set of polynomials, otherwise returning to step (b); (d) Repeating the steps (a) to (c) until the number of elements of the sparse polynomial set is (L + c) 3 And (4) stopping.
Further, the recursive function σ is a randomly selected one-to-one mapping function from the set {1,2,.. Gtt } to itself; the starting key U sigma (t) Random secrets for the σ (t) th packet.
Further, the encrypted random cryptogram specifically includes: first, a first new packet starts, using seed key M (x) and start key Usigma (t) The information key X sigma corresponding to the first new group is obtained through calculation (1) ＝M(Uσ (t) ) The information ciphertext corresponding to the first new packet is C sigma (1) ＝Xσ (1) ·Uσ (1) (ii) a Then, 1 is sequentially paired<n ≦ t of other new packets, respectively their corresponding information key X σ (n) ＝M(Uσ (n-1) ) And their corresponding information ciphertexts C sigma (n) ＝Xσ (n) ·Uσ (n) 。
Further, the symmetric decryption method based on exponential complexity in the fifth step specifically includes: (1) Using seed key M (x) and start key U σ (t) Calculating the first new block information cipher text C sigma (1) Corresponding random cryptogram U sigma (1) ＝M -1 (Uσ (t) )·Cσ (1) (ii) a (2) In sequence to 1<Other new groupings where n is ≦ t,decrypting the nth new block information ciphertext C sigma in a recursive manner (n) Corresponding random cryptogram U sigma (n) ＝M -1 (Uσ (n-1) )·Cσ (n) 。
Further, the correspondence relationship between the random cryptogram and the digital plaintext in the sixth step is V j ＝U j [1:L]-H θ (s,U j [L+1:L+c]) Wherein, 1: l denotes the elements in the vector in order from 1 to L.
Furthermore, the coding device is a computer device integrating a data information collector and a processor loaded with a basic code table; the encryption device is a computer device which is connected with the coding device and the information network device, integrates an output port and a processor, and is loaded with a symmetric encryption method based on exponential complexity; the information network equipment is computer equipment which integrates an output port and a processor and converts an information ciphertext into a standard encrypted signal; the decryption device is a computer device which is connected with the decoding device and the information network device, integrates an output port and a processor, and is loaded with a symmetric encryption method based on exponential complexity; the decoding device is a computer device which integrates an output port and a processor loaded with a basic code table; the public channel is a public network channel; the safety channel is a safety private network channel set by one or both of the receiver and the sender.
Further, the data information collector is usually a camera, various keyboards (including a screen input keyboard of a smart phone, keys of a cash dispenser, and the like), a microphone, and the like; the information content to be transferred is generally data such as a user password, a chat log and the like.
The invention has the beneficial effects that: by using the technology of generating the random key for encrypting the plaintext by using the random polynomial matrix as the seed key and the random cryptogram, the seed key attack problem is converted into the solving problem of polynomial reduction, the password security is established on the problem of exponential difficulty, the ciphertext expansion rate is low while the security is met, and efficient encryption and decryption can be realized.
In order to make the object, technical scheme and beneficial effect of the invention more clear, the invention provides the following drawings for explanation:
fig. 1 is a flowchart of a symmetric encryption and decryption method based on exponential complexity in an embodiment of the present invention.
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It is to be noted that the features in the following embodiments and examples may be combined with each other without conflict.
It should be noted that the drawings provided in the following embodiments are only for illustrating the basic idea of the present invention, and the components related to the present invention are only shown in the drawings rather than drawn according to the number, shape and size of the components in actual implementation, and the type, quantity and proportion of the components in actual implementation may be changed freely, and the layout of the components may be more complicated.
In the information transmission process, in order to keep secret, the transmitted information needs to be encrypted; then, the cipher text is transmitted to a target receiver through an economical and quick channel, and meanwhile, a password corresponding to the cipher text needs to be transmitted to an information receiver in a certain secret way; the information receiver uses the cipher to decrypt the cipher text to obtain the information.
Example 1: in this embodiment, it is assumed that a user (sender) of a certain chat software sends a message to a friend (receiver) through a smart phone loaded with the software, and for convenience of demonstrating the method of the present invention, it is assumed that the content of the sent message is "hello".
As shown in fig. 1, the symmetric encryption and decryption method based on exponential complexity in this embodiment includes:
s1: determining a basic code table according to the information content required to be transmitted and disclosing the basic code table;
s2: a sender inputs information plaintext on an input keyboard of the smart phone, and coding equipment codes a basic code table corresponding to the information plaintext into digital plaintext;
s3: the smart phone of the sender generates a random key, a seed key, a random recursive function and a corresponding initial key by adopting a symmetric encryption method based on exponential complexity, and then encrypts a digital plaintext to obtain an information ciphertext;
s4: the communication module of the smart phone of the sender discloses the information ciphertext through a public channel through a wireless network/a mobile network, and transmits a random key, a seed key, a random recursive function and a corresponding initial key to the smart phone of the receiver through a safety channel;
s5: the smart phone of the receiver decrypts the information ciphertext by adopting a symmetric decryption method based on exponential complexity to generate a random ciphertext;
s6: the smart phone of the receiver decrypts the digital plaintext corresponding to the random ciphertext by using the random key according to the corresponding relation between the random ciphertext and the digital plaintext;
s7: the smart phone of the receiving party decodes the digital plaintext into the information plaintext by using a decoding algorithm and displays the information plaintext content to the receiving party through the display screen.
In step S1:
the chat software officially takes English alphabets and numbers corresponding to the Pinyin alphabets as information to be transmitted, can determine 27 alphabet tables with basic alphabet tables of sigma = a, b, c, …, z, and forms information plaintext by arranging and combining the alphabet elements, wherein the alphabet elements are grouped redundant supplementary characters. According to the number 27 of the elements of the basic alphabet, determining an integer interval [0,26], and mapping each letter in sigma to the integer interval one by one for alphabet number coding: "a → 0,b → 1, …, z → 25, > 26".
In step S2:
the sender inputs the information plaintext 'hello' into the chat software on the input keyboard of the smart phone and clicks to send the information plaintext, and the coding program of the chat software is operated on the smart phone to code the information plaintext, so that the digital plaintext V = '13 7 0'.
In step S3:
the symmetric encryption method based on the exponential complexity specifically comprises the following steps: s301, grouping digital plaintext; s302, randomly selecting a finite field, and randomly encrypting each group of the digital plaintext by selecting a random key on the finite field to obtain a random ciphertext of a new group; s303 randomly selects a polynomial matrix as a seed key M (x) on the finite field, and randomly selects a recursive function sigma and a corresponding initial key U sigma based on the group number t (t) And encrypting the random cryptograph by using the seed key and the initial key to obtain an information cryptograph.
Number of assumed adversary attacks 2 100 Randomly selecting a finite field F q The number of elements q =3 100 。
The seed key M (x) is a product of 2 (L + c) random triangular polynomial matrixes, wherein L + c upper triangular polynomial matrixes and L + c lower triangular polynomial matrixes are respectively arranged; the diagonal line of the upper triangular polynomial matrix and the lower triangular polynomial matrix is an algebraic domain F q The non-diagonal elements of the non-zero elements are sparse polynomials; the sparse polynomial is obtained by extraction which is not put back from a sparse polynomial set; the sparse polynomial set is constructed recursively according to the following steps: (a) Randomly selecting K elements in the set {1,2, …, q } to form a new set m = { m = { m } k I k =1,2, …, N }, where N is an upward integer of q/2; (b) In a finite field F q Is random up to each element m of the set m k Selecting a corresponding m k A second order polynomial, the N polynomials being summed to form a polynomial; (c) If the polynomial generated in step (b) is not in the sparse set of polynomials, placing the polynomials in the sparse set of polynomials, otherwise returning to step (b); (d) Repeating steps (a) -c until the sparse polynomialThe number of the elements in the set is (L + c) 3 And (4) stopping.
The recursion function σ is a randomly selected one-to-one mapping function from the set {1,2.. Multidot.t } to itself; the starting key U sigma (t) Random secrets for the σ (t) th packet.
S301: the digital plaintext V is sequenced in order, and in consideration of the calculation complexity and readability of the embodiment, the embodiment selects a fixed length L =3, and the fixed length L =3 is divided into t =2 groups, and V = { V = { (V) } j I j =1,2} = { (13 8), (0 14) }. If the last block contains a different number of digits than before, the block redundancy supplement character ". Times.e. (0 14) is added to the last block.
S302: selecting a random key s = (1,2,3, theta, c) on the finite field, and for each plaintext block V j All randomly generate a block random key u of length c =2 j = (1,2), satisfies 0. Ltoreq. U j,i Q is less than or equal to q, i is more than or equal to 0 and less than or equal to c, and a hash function H with theta =2 as key is used θ Acting on the vector (s, u) j ) Upper score group V j Random encryption key H θ (s,u j ) By H θ (s,u j ) Encryption V j Obtaining the random cryptogram U of the group j ＝(V j +H θ (s,u j ),u j ) Wherein(s) 1 ,…,s L ) Is an element on the finite field, and theta is a mapping from L + c dimension finite field to L dimension finite field (i.e., F) q L+c →F q L ) Hash function of (H) θ C is an integer of 1 or more.
S303, encrypting the random hidden text specifically comprises the following steps: first, a first new packet starts, using seed key M (x) and start key Usigma (t) Calculating to obtain an information key X sigma corresponding to the first new packet (1) ＝M(Uσ (t) ) The information ciphertext corresponding to the first new packet is C sigma (1) ＝Xσ (1) ·Uσ (1) (ii) a However, the device is not suitable for use in a kitchenThen, sequentially to 1<n ≦ t of other new packets, respectively their corresponding information key X σ (n) ＝M(Uσ (n-1) ) And their corresponding information ciphertexts C sigma (n) ＝Xσ (n) ·Uσ (n) 。
In step S5:
the symmetric decryption method based on exponential complexity specifically comprises the following steps: (1) Using seed key M (x) and start key Usigma (t) Calculating the first new block information cipher text C sigma (1) Corresponding random cryptogram U sigma (1) ＝M -1 (Uσ (t) )·Cσ (1) (ii) a (2) In sequence to 1<The other new groups with n less than or equal to t adopt a recursive mode to decrypt the nth new group information ciphertext C sigma (n) Corresponding random cryptogram U sigma (n) ＝M -1 (Uσ (n-1) )·Cσ (n) 。
In step S6:
the corresponding relation between the random cryptograph and the digital plaintext is V j ＝U j [1:L]-H θ (s,U j [L+1:L+c]) Wherein, 1: l denotes the elements in the vector in order from 1 to L.
The foregoing embodiments are merely illustrative of the principles and utilities of the present invention and are not intended to limit the invention. Any person skilled in the art can modify or change the above-mentioned embodiments without departing from the spirit and scope of the present invention. Accordingly, it is intended that all equivalent modifications or changes which can be made by those skilled in the art without departing from the spirit and technical spirit of the present invention be covered by the claims of the present invention.
Claims (12)
- The symmetric encryption and decryption method based on the exponential complexity is characterized by comprising the following steps of:the method comprises the following steps: determining a basic code table according to the information content required to be transmitted and disclosing the basic code table;step two: a sender inputs an information plaintext on coding equipment, and the coding equipment codes the information plaintext into a digital plaintext according to a basic code table;step three: the encryption device adopts a symmetric encryption method based on exponential complexity to generate a random key, a seed key, a random recursive function and an initial key corresponding to the random recursive function, and then encrypts a digital plaintext to obtain an information ciphertext;step four: the information network equipment discloses the information cipher text through a public channel, and transmits a random key, a seed key, a random recursive function and an initial key corresponding to the random recursive function to a decryption device through a secure channel;step five: the decryption device decrypts the information ciphertext by adopting a symmetric decryption method based on exponential complexity to generate a random ciphertext;step six: the decryption device decrypts the digital plaintext corresponding to the random cryptogram by using the random key according to the corresponding relation between the random cryptogram and the digital plaintext;step seven: the decoding device decodes the digital plaintext into the information plaintext, and displays the information plaintext content to a receiving party through an output end.
- The symmetric encryption and decryption method based on exponential complexity of claim 1, wherein the basic code table of step one is determined by any one or both of the receiver or the sender, or a third party as required, and is a one-to-one correspondence between the basic element set of the information content and the integer interval, and is fixed once determined; the number of basic elements of the information content is K, and the integer interval is [0,K-1].
- The exponential-complexity-based symmetric encryption and decryption method according to claim 1, wherein the exponential-complexity-based symmetric encryption method of step three specifically comprises: (1) grouping digital plaintext; (2) Randomly selecting a finite field, and selecting a random key to carry out randomized encryption on each group of the digital plaintext on the finite field to obtain a random ciphertext of a new group; (3) Randomly selecting a polynomial matrix as a seed key M (x) over the finite field and basing the seed key M (x)Randomly selecting a recursive function sigma and its corresponding starting key Usigma in the packet number t (t) And encrypting the random cryptograph by using the seed key and the initial key to obtain an information cryptograph.
- Step (1) according to claim 3, wherein the grouping of the digital plaintext in step (1) is specifically:randomly selecting a fixed length L from the digital plaintext V according to the sequence, and dividing the digital plaintext V into t groups, wherein the grouping result is V = { V = j I j =1,2, …, t }, where V j ＝(v j,1 ,v j,2 ,…,v j,L )，v j,i Is the ith corresponding single digital plaintext element in the jth grouping; if the last group is not long enough then one way is fixed to add redundancy to make it L in length.
- The method of claim 3, wherein the finite field F is randomly selected q Number of elements q = p k Wherein p is a random prime number, k is an integer larger than or equal to lambda, and lambda is based on artificially set enemy attack times 2 λ To be determined.
- Step (2) according to claim 3, wherein step (2) is in particular: selecting a random key s =(s) in finite field 1 ,…,s L θ, c), for each plaintext block V j All randomly generate a block random key u of length c j ＝(u j,1 ,u j,2 ,…,u j,c ) And satisfies 0. Ltoreq. U j,i Q is less than or equal to q, i is less than or equal to 0 and less than or equal to c, and a Hash function H with theta as key is used θ Acting on the vector (s, u) j ) Upper score group V j Random encryption key H θ (s,u j ) By H θ (s,u j ) Encryption V j Obtaining the random cryptogram U of the group j ＝(V j +H θ (s,u j ),u j ) Wherein(s) 1 ,…,s L ) Is an element on the finite field, and theta is a mapping from L + c dimension finite field to L dimension finite field (i.e., F) q L+c →F q L ) Hash function of (H) θ C is an integer of 1 or more.
- The step (3) of claim 3, wherein the seed key M (x) is a product of random 2 (L + c) triangular polynomial matrices, wherein there are L + c upper triangular polynomial matrices and L + c lower triangular polynomial matrices, respectively; the diagonal line of the upper triangular polynomial matrix and the lower triangular polynomial matrix is an algebraic domain F q The non-diagonal elements of the non-zero elements are sparse polynomials; the sparse polynomial is obtained by extraction which is not put back from a sparse polynomial set; the sparse polynomial set is constructed recursively according to the following steps: (a) Randomly selecting K elements in the set {1,2, …, q } to form a new set m = { m = { m } k I k =1,2, …, N }, where N is the rounding-up of q/2; (b) In a finite field F q Is random up to each element m of the set m k Selecting a corresponding m k A second order polynomial, the N polynomials being summed to form a polynomial; (c) If the polynomial generated in step (b) is not in the sparse set of polynomials, placing the polynomials in the sparse set of polynomials, otherwise returning to step (b); (d) Repeating the steps (a) to (c) until the number of elements of the sparse polynomial set is (L + c) 3 And (4) stopping.
- Step (3) according to claim 3, wherein said recursive function σ is a randomly selected one-to-one mapping function from the set {1,2,. Said.., t } to itself; the starting key U sigma (t) Random secrets for the σ (t) th packet.
- The step (3) according to claim 3, wherein the encrypted random cryptogram is specifically: first, a first new packet starts, using seed key M (x) and start key Usigma (t) The information key X sigma corresponding to the first new group is obtained through calculation (1) ＝M(Uσ (t) ) The information ciphertext corresponding to the first new packet is C sigma (1) ＝Xσ (1) ·Uσ (1) (ii) a Then, 1 is sequentially paired<n ≦ t of other new packets, respectively their corresponding information key X σ (n) ＝M(Uσ (n-1) ) And their corresponding information ciphertexts C sigma (n) ＝Xσ (n) ·Uσ (n) 。
- The symmetric encryption and decryption method based on exponential complexity according to claim 1, wherein the symmetric encryption and decryption method based on exponential complexity in step five specifically comprises: (1) Using seed key M (x) and start key U σ (t) Calculating the first new block information cipher text C sigma (1) Corresponding random cryptogram U sigma (1) ＝M -1 (Uσ (t) )·Cσ (1) (ii) a (2) In sequence to 1<The other new groups with n less than or equal to t adopt a recursive mode to decrypt the nth new group information ciphertext C sigma (n) Corresponding random cryptogram U sigma (n) ＝M -1 (Uσ (n-1) )·Cσ (n) 。
- The symmetric encryption and decryption method based on exponential complexity of claim 1, wherein the correspondence relationship between the random plaintext and the digital plaintext in step six is V j ＝U j [1:L]-H θ (s,U j [L+1:L+c]) Wherein, 1: l denotes the elements in the vector in order from 1 to L.
- The symmetric encryption and decryption method based on exponential complexity of claim 1, wherein the coding device is a computer device integrating a data information collector and a processor loaded with a basic code table; the encryption device is a computer device which is connected with the coding device and the information network device, integrates an output port and a processor, and is loaded with a symmetric encryption method based on exponential complexity; the information network equipment is computer equipment which integrates an output port and a processor and converts an information ciphertext into a standard encrypted signal; the decryption device is a computer device which is connected with the decoding device and the information network device, integrates an output port and a processor, and is loaded with a symmetric encryption method based on exponential complexity; the decoding device is a computer device which integrates an output port and a processor loaded with a basic code table; the public channel is a public network channel; the safety channel is a safety private network channel set by one or both of the receiver and the sender.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2020/104889 WO2022021005A1 (en) | 2020-07-27 | 2020-07-27 | Symmetric encryption and decryption method based on exponential complexity |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115843360A true CN115843360A (en) | 2023-03-24 |
Family
ID=80037219
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202080102633.7A Pending CN115843360A (en) | 2020-07-27 | 2020-07-27 | Symmetric encryption and decryption method based on exponential complexity |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN115843360A (en) |
| WO (1) | WO2022021005A1 (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115333777B (en) * | 2022-07-13 | 2024-07-23 | 广州城建职业学院 | Data encryption method, system, device and storage medium |
| CN116032624B (en) * | 2022-12-30 | 2023-07-21 | 北京长鹰恒容电磁科技有限公司 | Data transmission method based on fusion encryption |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019010421A1 (en) * | 2017-07-07 | 2019-01-10 | Ligatti Jay | Systems and methods for generating symmetric cryptographic keys |
| CN107800533B (en) * | 2017-09-26 | 2021-07-09 | 南京航空航天大学 | Information encryption and hiding method and decryption method based on language grammar |
| CN109344627B (en) * | 2018-08-16 | 2021-05-28 | 中国科学院重庆绿色智能技术研究院 | Novel Shannon perfect secrecy method |
| CN109409106B (en) * | 2018-09-25 | 2021-05-28 | 中国科学院重庆绿色智能技术研究院 | Novel Shannon perfect secrecy method of infinite alphabet |
-
2020
- 2020-07-27 CN CN202080102633.7A patent/CN115843360A/en active Pending
- 2020-07-27 WO PCT/CN2020/104889 patent/WO2022021005A1/en active Application Filing
Also Published As
| Publication number | Publication date |
|---|---|
| WO2022021005A1 (en) | 2022-02-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110677237B (en) | File encryption method with chaos-like characteristic | |
| AU702766B2 (en) | A non-deterministic public key encryption system | |
| EP1834438B1 (en) | Cryptography related to keys | |
| CN110795762B (en) | Reserved format encryption method based on stream cipher | |
| CN112383397B (en) | Heterogeneous signcryption communication method based on biological characteristics | |
| Agrawal et al. | Elliptic curve cryptography with hill cipher generation for secure text cryptosystem | |
| CN101019367A (en) | Method and system for computational transformation | |
| US20020159588A1 (en) | Cryptography with unconditional security for the internet, commercial intranets, and data storage | |
| Mondal et al. | Review on DNA cryptography | |
| Roy et al. | A novel encryption model for text messages using delayed chaotic neural network and DNA cryptography | |
| Saarinen | The STRIBOBr1 authenticated encryption algorithm | |
| CN114710261A (en) | AES key arrangement method | |
| CN115843360A (en) | Symmetric encryption and decryption method based on exponential complexity | |
| CN102946315B (en) | A kind of method and system adopting packet mode to construct MAC code | |
| CN109344627B (en) | Novel Shannon perfect secrecy method | |
| Rabah | Theory and implementation of data encryption standard: A review | |
| CN109409106B (en) | Novel Shannon perfect secrecy method of infinite alphabet | |
| CN108768923A (en) | A kind of real-time encrypted method of chat of the Encryption Algorithm based on Quantum Reversible Logic circuit | |
| KR20040053209A (en) | Public key cryptographic method based on braid groups | |
| Simmons | Symmetric and asymmetric encryption | |
| Ojugo et al. | Cryptography: Salvaging exploitations against Data integrity | |
| JP2003304237A (en) | Method for creating common key, encryption method using the common key, method for managing common key, method for authentifying solid by solid number of terminal, program for executing these methods, and application software including the program | |
| JP2003115831A (en) | Common key generation method, enciphering method using common key, program therefor, recording medium recording the same program, enciphering device, deciphering method and deciphering device | |
| Malla et al. | A novel encryption scheme for secure SMS communication | |
| US11502818B2 (en) | System to secure encoding and mapping on elliptic curve cryptography (ECC) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |