TWI330485B - Robust hyper-chaotic encryption-decryption system and method for digital secure-communication - Google Patents

Description

1330485 IX. Description of the invention: ^ [Technical field to which the invention pertains] The present invention relates to an ultra-washing system and method for secure communication, in particular, a robust ultra-washing encryption and decryption for digital secure communication. System and method.

[Previous Skills J With the widespread use of computers and the Internet, the security of communications is becoming more important. However, in the general data digital communication, most of them have no function of encryption and decryption, that is, the function of digital security communication. In addition, with the development of the washing technology, more and more research has begun to focus on the possibility of using the __ silk communication. Due to the irregularity, non-periodicity, non-removability, and sensitivity of the nonlinear system, the characteristics of the wash-synchronization technology between the two nonlinear systems, the wash system The disc can be used for secure communication. In the - wash secret communication, the wash signal can be used as a masking stream to expand the information' and then by the synchronization between the sender and the receiver, the 6 information can be returned to the previous report. The research is mainly on analog signals. Only a few studies have focused on the confidential communication of digital signals. Regarding the research on digital secure communication, although it is found that the use of one of the logical mapping chaotic systems can indeed produce a sequence with unpredictability; however, due to the lack of precision of the person's system has only a small overall state, it is vulnerable to State count attack. In addition, even the Newcomb left loop function and the parameter_loop are used to strengthen the strength of the county. It is the ship's assumption that this kind of purity is still vulnerable to attack under the assumption of K. On the other hand, many studies are mixed with the secrets of confidentiality, and the results show that the system will be attacked by the mapping of the output order; the reason is that the scale of the single wash system has its touch map bribe, borrow This is to distinguish between different battery systems and rebuild their equations. To solve this problem, most of the research proposed focuses on how to enhance the complexity of the output sequence. These studies can be broadly divided into three categories. Class--: In order to make the initial message impossible, the map is mapped to generate the initial signal to the scam. The second category: the use of several mappings; at any time, the use of special mapping, which is based on the previous order or the user-defined mechanism characteristics, these three methods are still only one - Lya chest v positive index - county system, this still limits the complexity of chaotic dynamics. In addition, the available area of the parameter value is the disadvantage of the discontinuous 浑 _ step system. The system's 浑 state is based on its parasitic mosquitoes. However, it is regrettable that the parameters of the face are all money, and the towel - some of the participation will lead to "* window". Here, the "empty window" is defined as the material track of the surface system on the computer. Namo is her. Scales, coffee _ small, so the remaining parameter space may be attacked by the brute force counting method. A conventional logic map L can be defined as . x(W) = L(r, x(1)) = τ χ (1) (divination (1)), where r is a parameter and 〇 is 4. In the above equation, the sequence generated when 3 57 < r__4 is aperiodic and non-convergent. In the absence of 3.57, the parameter r of the equation "empty window" is open and set. ❹ , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , The only thing that can be used in the equation is that when (4) is the only way to spread the sentence, the scorpion is distributed in the range of 0 and 1. The choice of the value of this view is extremely limited.

SUMMARY OF THE INVENTION J. The present invention is directed to providing a robust super 8 solution system for secure communication, which has a large parameter space to avoid attacks by brute force etiquette and cannot use today's computing technology. Rebuild the system. Another object of the present invention is to provide a strong-type super-Niger reading shirt for secret communication, which can be used for the input of different initial vectors. , view to improve the level of confidentiality. A further object of the present invention is to provide a robust super-washing and listening secret for a secure communication, which can generate a full-band map to convey the towel in the public channel, and view even the assumption of the attack in Congri. It is also difficult to reconstruct the map in the state. In order to achieve the above object, the present invention provides a robust super-axis encryption and decryption system, which first includes a transmitting end and a receiving end. The transmitting end includes a super-sound signal generating n', which can carry the - losing message as one of the super secret signals in the masking sequence, and the - transmitting end parameter adjusting device, for adjusting the parameters of the super-discrete tiger generating n 'Through this super-signal generation material will turn the plaintext message and the masking sequence into super-silk text. The mosquito is first generated by the super stalk to the receiving end. The receiving end includes a super-synchronous signal receiving receiver 330485, which is used to generate a masking sequence for one of the hyper-chaotic signals, and converts the hyper-chaotic, text and de-masking sequences into a decrypted plaintext message; The parameter adjusting device is configured to adjust the parameter of the super-chaotic signal synchronous receiver to generate a super-wash signal by super-synchronizing with the masking sequence of the transmitting end after receiving the super-hidden ciphertext To mask the sequence. Further, the robust hyperchaotic encryption and decryption method of the present invention includes a process of adding and decrypting. The encryption process comprises the following steps: First, the plaintext message is deconstructed into a sequence of {ρ(1)}, and then the sequence is loaded into a masking sequence of the super-chaotic signal by a mutual exclusion or operation to generate a hyper-hidden ciphertext. The decryption process includes the following steps: after receiving the ciphertext at the receiving end, by performing a super/浑 synchronization with the masking sequence of the transmitting end, a de-masking sequence for the super-wash signal is generated, and then the mutex is mutually exclusive. Or the operation converts the ciphertext into a decrypted plaintext message. The masking sequence is preferably generated according to the input initial vector 乂(9) and parameters, and the demasking sequence is preferably generated according to the input initial vector y(9) and parameters; thereby, if different initial vectors are used for the same plaintext message, Can produce different ciphertexts. The initial vector X(〇) is preferably randomly generated at the transmitting end, and then replaced by y(9) (4) to the miscellaneous end, and then replaced by χ(9) at the simple receiving end; thereby, the masking sequence is to be masked The sequence is equivalent and the ciphertext will be decrypted correctly. 10 Real: [Implementation] As shown in Figure i, in the general secret communication scheme, after source coding, encryption, channel coding and modulation::, after receiving the signal, by reversing the above steps, Channel transmission. Set up Beixun. In the present invention, the entry corresponds to the source coding step, and the output corresponds to the step of channel coding and modulation. μ, =2 图卿, _ this (four) 1 material over material encryption and decryption system is included - (four) 1G and - Wei Lai. (4) The transmission (4) includes a super-track number generator 2〇 and a transmission-end parameter adjustment device 3〇. The super-signal generator 20 disposed at the transmitting end 10 is configured to load a plaintext message 22 into a mask _ 24 of the super-axis signal, and the thief sequence (4) is generated by the super-wash signal generator 20. And the transmitting end parameter adjusting device 3 __ the entire super-signal number generates the parameter of the II 2G, thereby making the super-discipline H 2G get (10) Longman shouting 22 touch thief sequence 24 into - super-corrected text 5 {). The super-Courmet 5 () complement is transmitted from the transmitting end 10 to the receiving end 6 by the super-sound signal generator 20. The receiving end 11 1330485 60 includes a super-signal synchronous receiver 70 and a receiving end parameter adjusting device 80. The receiving end parameter adjusting device 80 is configured to adjust the parameter of the super-washing signal synchronous receiving fasting 70, whereby the super-washing signal synchronous receiver can borrow the transmitting end 1 after receiving the super-hidden ciphertext 50 The masking sequence 24 of the scorpion achieves a hyperchaotic synchronization to produce a de-masking sequence 76 that is a hyper-chaotic signal. In addition, the hyper-chaotic sync receiver 7〇 also converts the hyper-hidden ciphertext 〇 and the de-masking sequence 76 into a decrypted plaintext message 90 by mutual exclusion or operation. u

In addition, the robust ultra-washing encryption and decryption system uses two robust ultra-washing tools, which consist of a number of robust logical mappings of one carrying map and several hidden mappings. Where the robust logic maps to a uniformly distributed map with a larger parameter space, which is defined using a robust logic function as follows: L(7,x)= Ύ x(lx) (modi) 3 x(lx ) (modi) (T/4)(modl) , lint where 1ext , ^2= 1/2+ //4- [r/4] . , the largest integer / , medium [ω] is - equal to or less than o 1/4- [r/4] long, 7" value range can be extended beyond 4 according to the above-mentioned robust face function function 1330485. When #如) is greater than 1, the above-mentioned equation can transfer the mapping greater than 1 to the value _ of G~1, and the cap group-type single county has to make the value of x constant in the order, and continues in (4)_, The mapping will be unevenly distributed' resulting in an "empty window" for the mapping. Therefore, when X) is less than 1, the second equation above can be scaled to (in the range of M.) By using the modular operation and the proportional operation, the mapping can be distributed to the 〇. Within a range of ~1. 5 times 73⁄4 flats, he writes 2 states 20 uses a first robust hyperchaos tool, which can be defined as: x(i> = F(r,x^) χ( ))=[χι(0} >>5

Xn(l)]T,^X(i'I)HL(r1^^^, you, X) is a robust logic function, as mentioned above, and

C

Cc^ cn ... Cl; c·21 Ί >1 Cn2 ... c:n It is a positive random age matrix in which all elements are 〇<Cij <Bu and ^Cirlfori,j=l, .."n. In addition, the masking sequence 24 may define nxi(i)' to be generated by the transmitting end 1〇 of the super-secret H 2〇 wheel from her (four) with the parameter 13 1330485 'where the initial vector is Defined as: χ(0):=[Χι(〇),,(9)丁' χη ], where Xi(〇) 6{(〇,1)\ {1/2}}; and the parameter includes—for order The random matrix of the columns c = [Cij], where 0 <Cij<bi, W".., n, and - wash parameter vector γ = [τί, ..., rJT, where γθ4, and the super-wash signal is synchronously received The function of the device 70 is defined by a second robust hyperchaotic tool:

Yw = Gfeyd’sCZ^r, #1)), where /)=[γι(ί), i>o. The demasking sequence 76 can be defined as: ί) = yi(1), which is generated by the super-washed sync receiver 70 of the receiving end 60 in accordance with the input initial vector y(9) and parameters. It should be noted here that the first robust hyperchaos tool and the second robust hyperchaos tool belong to x(i) and y(i), respectively, and have the same parameters C and r. In addition, the robust encryption and decryption method according to the present invention includes an encryption and a decryption process, wherein the encryption process is: deconstructing the plaintext message into a sequence, and loading the sequence into a sequence by mutual exclusion or operation. In the masking sequence of the chaotic signal, a hyper-hidden ciphertext is generated; the decryption process is: after receiving the ciphertext at the receiving end, generating a chaotic sequence of chaotic signals by achieving superchaotic synchronization with the masking sequence of the transmitting end. The ciphertext is converted to the decrypted 14 1330485 plaintext message by mutual exclusion or operation. After the plaintext message 22 enters the transmitting end 10, it will be deconstructed into a sequence. If the real digit of the first robust hyperchaotic tool is represented as a claw, and the length of each ρω is (!, the relationship can be expressed as: d = m_ < 1. Under this condition, The encryption procedure performed by the sender is defined as: z(0=Lx 丨(0丄, d ζ(ί)® P(i), where © stands for mutual exclusion or operation, and Lxil· represents the first ί digit from X. The decryption process performed at the receiving end can be defined as: ^(〇= <, P (1)= Z(1)© '), where P1 is - decrypt the plaintext message. It should be noted that the initial vector X(G) It is randomly generated by the returning end, then replaced by y(9) and transmitted to the receiving end, and then replaced by X(9) at the receiving end; after the above steps 'ζω=ζω, i>Q. And because of the first strong super The washing tool has the same initial direction i and z - z() as the second strong type of super-guard, so that the ciphertext 5 〇 can be correctly decrypted, that is, Ρ 0)=ρω. Due to the concealment in communication (the most important digit, that is, the dropping of these digits is not used in encryption, the ik function of the masking sequence 24 can be enhanced. The more difficult it is, the more difficult it is for essay 5() to be analyzed. 15 丄..., and the increase in confidentiality is at the expense of its computing resources, and the hidden two digits can get good randomness. The super-red 浑 浑 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 - - - - - - - - - - - - - - - - - - - - - - - - - - In order to know whether the Lyapunov positive exponent number is φ in the tool dimension, we will use the numerical method to analyze the robust super-washing tool. When the tool has a higher dimension, it will have more The Lyapunov positive 'number. By this, the secret of the output masking paste 24 is more complicated. In the following example, the number of strong logical mappings is set to 2 (that is, n=2). In this case -r**», This two-coupling robust logical mapping has two parameters τ1 and ^2. In the Q» diagram, the two Lyap_ exponents of the two-faced robust logical mapping are at a ratio of 16, 1/30, and r 2 is a certain value. 29 6668 case painted " ° fruit" 'page shows that the rich γ 1 value is greater than or 荨 at 4, two Lyapunov 曰Both are positive, that is, the tool is indeed hyperchaotic and has no "empty J. Similarly, when n is equal to 3, 4, and 1〇, where 7 is a fixed value at jg n' and W The range is from 〇 to 16, and the number of Lyapunov exponents is shown in the first evil ~ young map. It can be seen that when the #η value increases, the number of Lyapunov positive indices will also increase, and there is no "empty window". 16 1330485 and all the values in the tool are greater than 4. The following will perform cryptanalysis for the s-heeling-type ultra-washing encryption and decryption system, which will be described as an example. The accuracy is 48 bits and has two shackles. Robust mapping. When n=2 (n is the number of robust logical maps), the first robust hyperchaotic tool can be expressed as: J Xi(0 = • [x2(0 = (l-c22)L(yux^) + c22L(y2, X2^) In this example, there are four parameters Cu, C22, γ i and γ 2, and the total number of parameters selectable is 2' 2192. This provides - a large parameter space. Moreover, since the generation of the masking sequence 24 is relatively sensitive to parameters, the attacker will be very difficult to find the correlation between the parameter and its corresponding masking sequence 24. • This will be shown as an experiment. Taking the equation of the first robust hyperchaotic tool mentioned above as an example. Secondly, a set of C and I parameters are selected, and a reference masking sequence ke is generated based on the basis. Then, the most variable > The important bits of 1 produce 2 γ γ 1. With different 7-1 and the same r 2 and C, 200 masking sequences Sbase+1-48 are generated, where the masking sequence is marked with ... 100. Finally, We calculate the bit error rate between ' and u8. As can be seen from Figure 4, even a small change in 17 1330485 for a parameter 2χ2_48 In the following, the generated sequence does differ. In addition, the attacker may determine the mapping by analyzing the output sequence of the branch mapping. The tool is expanded into a method for calculating the unknown value. For example, the tool wire type has five unknown variables, namely ri, T2, Cii, (3) and χ2(1). When the equation is expanded to W, the attacker will have an extra solution. The three variables, namely "and ^. On the whole, the equation given to the person can solve the = solid unknown. However, in the robust super-cylinder, the attacker will not be able to reconstruct the mapping by the expansion method" Thanks to the following two color changes. First, the masking sequence ζ ") 24 is the first healthy type of ultra-cylinder - incomplete output sequence, the most important of which are all missing, that is, the masking sequence ζ 24 is not equal to Xl(1). If the equation 忖 four &(1), each ζ(1) falls off the J-bit 'four Xl(1) possible combinations are (10). Second, the kernel-single operation is used to calculate the mapping function in the robust logic shot. Fragment nonlinear mapping is not --- one Map.- The output of the known L map has an input probability of r/4 X2. In this case, eight [maps are needed. The possible combinations are (χ2) 8. Let r be less than 2, _, and Hey, the attacker will need a total of (28) 4xl, 248 possible combinations of equations to solve the unknown Wei with the above two. If you use a computer that processes the 18 1330485 unit for 1THz, it can handle it every second. If it is used to calculate the combination of the above example, it will take nearly one million years and the next year to rebuild the 苐-strong super-bubble tool. Today's technology _ can not rely on the first - miscellaneous super pool wash tools. In order to show the performance of the first-strong super-washing tool, the following will demonstrate the fine track in the hard body. The tool goes as follows: The number of robust logical maps is two, the actual digits of 4 are represented as (four) digits, and the hidden digits, ie d. Then, it is expressed in hexadecimal (one digit is four digits). The tool is operated by 49 bits ("bit represents - symbol bit"). A masked signal stream is 40 bits long and has two hidden digits. Thereby, the plaintext message 22 will be segmented into segments of 4 bits long. Figure 5 is a data flow of the first robust hyperchaotic tool shown in the hypertext signal generator. In this data stream, each time a masking sequence Z(]' is generated, eight multiplication operations are required. The 49-bit x (i), X2(i), r丨, r 2, 〇11, and C22 are rounded and multiplied. In the operation, scal and sca2 respectively mark two for normalization and _factor, namely 1 (Τι/4χ_1) and (7T75SHT) ° and V2= χαΛ-jm- [ri/4], 19 1330485 V3=m~ J^ITr^_ iV4 = \/2+J^I~W^^ Indicates four conditions to determine whether to use - the configuration operation is a proportional operation. Since 7ι, 72 are determined by the user and are operated The process remains the same 'so the heart, ..., call and call the wheel vector. Field <7?2 (7?3< χ2Μ <77 4), scai (sca2) is selected to adjust the mapped value proportionally Otherwise, multiply by the constant 1. Figure 6 is a block diagram of the first robust super-washing tool applied to the hardware. For the sake of region and performance, a one-stage pipeline flow multiplier is used. It takes eight rounds to generate a masking sequence. In addition to the 49-bit 7-inch second-order multiplier, this secret has two more scratchpads that are more detailed than the temporary bit of the temporary dragon, namely "scratchpad A" and " Register And four adders and subtractors. The square "circle" is used to count #NEG(x)=1_x, and the square "(four)(four)" is used to check that the input is in the secret Iint range. The loop is placed in the form of a fast post and passed through TSMC. 13um The program is synthesized. Figure 7 shows the simulation results. In this non-paradigm, the Qianchao network connection table is accurate, and the encryption rate of the first robust hyper-chaotic tool can reach 5〇〇 per thousand per second. When n-2, the first-strong super-washing tool will use the following parameter values to demonstrate: 20 1330485 xi(0)= 0.26e7bf70710c χ2 (9)=0.3cebe4e04ecb Τι = 15.000000000 7 2 = 23.0000000000

Cu = O.feOOOOOOOOOO c22 = O.faOOOOOOOOOO 苐8 The picture shows the encrypted result of the plaintext message "The Digital Encryption". The plaintext message is encoded in the Ascii code format, and then the data sequence is encrypted by a masking sequence generated by the first robust hyperchaotic tool in accordance with the parameter values. The result also shows that the receiving end can reply to the plaintext by the above parameters. According to the above description and the schema, the present invention can achieve the intended purpose, that is, the present invention can provide a larger parameter space, and can be used for the same plaintext message. The input of different initial vectors correspondingly generates different super-wash ciphertexts, and may generate incomplete carrying maps in the common channel, thereby achieving a high security level. [Simple description of the diagram] Figure 1 is a block diagram of a general secure communication scheme. Figure 2 is a block diagram of a robust hyper-cryptographic decryption system in accordance with the present invention. The 3A to 3D graphs are numerically analyzed based on the results of the robust-type 21 1330485 ί屯 tool, which shows the Lyapunov exponent vs. /, n=2, 3, 4, 10. Figure 4 is the result of a bit error rate between Sbase and Sbase-i^48 in a beta test, which shows one of the features of the present invention: a masking sequence will be generated sensitively according to the input parameters. The fifth figure is a data flow demonstration of one of the powerful super-washing tools used in the ultra-chaotic signal generator according to the present invention. The sixth figure is a block diagram of the first robust hyperchaotic tool used in the hard demonstration signal generator according to the present invention. The seventh figure is a simulation result table of the first robust hyperchaotic tool demonstration according to the present invention, wherein the number of strong logical maps of the first robust super military washing tool is two. The eighth figure is an example of an encryption example of the encryption system of the first-strong hyper-washing tool, wherein the number of robust logical mappings of the first-strong hyper-washing tool is two. 22 1330485

[Main component symbol description] Transmitter 10 plaintext message 22 Transmitter parameter adjustment device 30 Receiver 60 Demasking sequence 76 Decrypted plaintext message 90 Super scrubbing signal generator 20 Masking sequence 24 Chaos ciphertext 50 Super chaotic signal synchronous receiver 70 receiving end parameter adjustment device 80

twenty three

Claims (1)

1330485,% of the year of the Mf date revision of the tenth, the scope of application for patents: I - _ _ _ _ _ _ _ _ super-transfer system, the data can be transmitted from a sender to a receiver in a confidential manner, including: - a super-wash signal generation, set in the transmission flip, for loading a plaintext message into a masking sequence of one of the hyper-chaotic signals; the operation of the hyper-chaotic signal generator utilizes a first robust hyper-chaos tool The first robust hyperchaotic tool system includes a plurality of coupled robust logical maps, a carry map and a plurality of occult maps, and can be defined as: χ1 2 F(r, xw):: where χω=[Χι( 〇, . . , ,丁^x(iV[L(r ι,χ/^ν .-L(rn,^^ robust logic function, which can be defined as: L(r,x)= rx〇x)(m〇dl),X e iext ' ^ x(lx) (modi) ^ (7/4) (modi) ,xe lint where lext e 77 2], ^1 =1/2- l/4-ll^I,77 2=1/2+/^17^ / T f ~f where [[called as the largest integer less than or equal to ω, and c;! loyal...g, which is a positive random_combined matrix, where • ·* ·····♦ ^nl Cn2 ... 24 丄330485 and for i,j= L ,n; the x(_ = L ( 7, χ ω); and the masking sequence generated by the hyperchaos. hole number generating state is used to encrypt the plaintext message and can be defined as: ζ(1)=Xl(1); a transmitting end parameter adjusting device is disposed in the transmitting end for adjusting The parameter of the hypertext signal generator is such that the plaintext message and the masking sequence are mutually exclusive or converted into a hyper-hidden ciphertext; a super-chaotic signal synchronizing receiver is disposed in the receiving end for Generating a sequence of super-chaotic signals to mask the sequence, and converting the hyper-hidden ciphertext and the de-masking sequence into a decrypted plaintext message; All elements are 0 < Cij < 1 robust logical mapping is defined as: Receive 鸲 parameter adjustment device, set in the receiving end, used to adjust the parameters of the super-washed signal synchronous receiver to make it super-received After the hacking ciphertext, it is possible to generate a chaotic sequence for the chaotic signal by achieving superchaotic synchronization with the masking sequence of the transmitting end. 2. If the application for the exclusive group item is used for the security, the sturdy and super-precise encryption and decryption system, the operation of the super-washed-signal synchronous receiver set at the receiving end utilizes a second strong type Cylinders, which include a plurality of light-combined Wei mappings, - carrying Nasaki and several hidden images 25 shots 3. If you apply for the second item of the noodles, _ Communication's robust super-washing encryption solution When the parameter..., the number of Lyap·positive indices of the first-strong super-washing tool increases as the number of robust hyperchaotic maps used by the hybrid-type super-washing tool increases. 4. As described in the second paragraph of the patent application, the robust super-washing and cleaning of the miscellaneous communication is the second strong-type super-axis. The y(i) = G(r, strict) can be defined. :=,,)), where i>o; and the thief-ordered person who receives the H generated by the super-technical step to convert the ciphertext into a decrypted plaintext message and can be defined as = y丨1. 5. If you apply for a patent 丨 丨 丨 之 通 通 通 通 强 强 强 强 强 强 强 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 Fori, j=i,...,n, and —washing parameter vector 『[γι,...,Ύη], where 7i2 4f〇ri=l,...,n. 6. The robust ultra-washing encryption and decryption system for secure communication as described in claim 1, wherein when the parameter γ24, the number of Lyapunov positive indices of the second robust super-bubble tool follows the second The robust hyper-chaos tool 26 uses an increase in the number of robust super-maps. It is stated in the first paragraph of the patent scope that is based on the robust over-the-counter encryption solution (10) of the confidential communication, and its anger Wei Duanling, the super thief horn generator, transmits the super hacked ciphertext to the receiving end. 8. - The method of tying the silk communication, the method of transmitting the data from the sender to the receiver in a confidential manner, including: A plaintext message is deconstructed into a {p(i)} sequence, which is generated according to the input initial vector x(0) and the parameter--a masked sequence of the hyper-chaotic signal, and the {p(1)} sequence is mutually exclusive or different. Loading the masking sequence to generate a super-bubble ciphertext; and de-blending, at the receiving end, comprising the steps of: generating a de-masking sequence of the super-chaotic signal according to the input initial vector y(9) and the parameter And achieving a hyperchaotic synchronization with the masking sequence of the transmitting end, and converting the ciphertext into a decrypted plaintext message by the mutual exclusion or operation of the ciphertext and the demasking sequence; wherein the initial vector X(9) is from the transmitting end Randomly generated, then replaced by y (9) and then transmitted to the receiving end, and then replaced by x (9) at the receiving end, the foregoing parameters include a random matrix of n rows and n columns C = 27 1330485 N 'where 0 < Cij < l fori, j=l,...,n, and a glimpse Wash the parameter vector Γ=[γι,.",γη]τ, where Yi2 4fori=i,.,n. 9. The robust ultra-wash encryption and decryption method for secure communication as described in claim 8 wherein the real number of a first robust super-predator tool is expressed in m, and each P(i) The length is d digits, and the relationship is: d = πΝ, f. along! Under the above conditions, the encryption process performed at the transmitting end can be defined as: z) =L Xi(1)"^,c(1) = z(1) © p(i), where + ® represents each other斥 or operation, U 丄 represents the most digits from x. For example, in the method of claim 9, the robust over-the-wash encryption method for secure communication, in which the condition τ, the decryption process performed at the receiving end can be defined as: > =L yi1" ;, p(i)= ζ~(ί)®π where “for-decrypt plaintext messages. U·For example, the robust super-bubble encryption used for secure communication as described in item 8 of the patent application scope” The super-hidden ciphertext is transmitted to the receiving end by the solution_hardware.