CN117880762B - Short message data security encryption method based on wireless communication - Google Patents
Short message data security encryption method based on wireless communication Download PDFInfo
- Publication number
- CN117880762B CN117880762B CN202410275817.3A CN202410275817A CN117880762B CN 117880762 B CN117880762 B CN 117880762B CN 202410275817 A CN202410275817 A CN 202410275817A CN 117880762 B CN117880762 B CN 117880762B
- Authority
- CN
- China
- Prior art keywords
- short message
- sequence
- byte
- key
- data
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000004891 communication Methods 0.000 title claims abstract description 31
- 239000011159 matrix material Substances 0.000 claims abstract description 95
- 238000012546 transfer Methods 0.000 claims abstract description 29
- 230000005540 biological transmission Effects 0.000 claims description 7
- 230000001174 ascending effect Effects 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 4
- 238000006243 chemical reaction Methods 0.000 claims description 4
- 238000005070 sampling Methods 0.000 claims description 2
- 238000010276 construction Methods 0.000 claims 1
- 230000000694 effects Effects 0.000 abstract description 3
- 238000005516 engineering process Methods 0.000 description 5
- 238000011161 development Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000000605 extraction Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004140 cleaning Methods 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 230000009545 invasion Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000004083 survival effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/12—Messaging; Mailboxes; Announcements
- H04W4/14—Short messaging services, e.g. short message services [SMS] or unstructured supplementary service data [USSD]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/03—Protecting confidentiality, e.g. by encryption
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to the technical field of data encryption, in particular to a short message data security encryption method based on wireless communication, which comprises the following steps: the method comprises the steps of constructing a binary character string sequence and a binary character string frequency characteristic sequence of each piece of short message information data, calculating the information singular degree and the short message information characteristic similarity index between any two pieces of short message information data, extracting a short message information template sequence to be encrypted, constructing a key byte matrix, obtaining a byte change sequence of each key word in the key byte matrix, constructing a character string change index of each byte in the byte change sequence, obtaining the information richness of each key word in the key byte matrix, constructing a key byte transfer matrix of each piece of short message information data based on the information richness, and obtaining a plaintext and a ciphertext after encryption of each piece of short message information data by combining an AES encryption algorithm. The invention improves the safety of the wireless communication short message data and ensures the encryption effect of the short message data.
Description
Technical Field
The application relates to the technical field of data encryption, in particular to a short message data security encryption method based on wireless communication.
Background
With the development and continuous maturity of wireless communication technology, unprecedented opportunities are brought to the short message industry, and at the same time, great challenges are brought to the short message security problem. The security of the short message is the guarantee of the security, the integrity and the authenticity of the short message, when an enterprise sends important short message to a user and is subjected to malicious invasion, theft and damage, the user receives wrong short message, the normal development of the enterprise can be prevented, and even the survival development of the enterprise can be influenced to a certain extent.
In wireless communication, an attacker generally performs attack means such as tampering and counterfeiting on short message information transmitted by an enterprise in a wireless channel, so that a user receives wrong short message data, and the interests of the enterprise are extremely damaged. Therefore, in order to ensure the safety of the short message data transmission and protect the interests of enterprises, the short message data is generally required to be encrypted.
The safety and the integrity of the short message information are ensured by encrypting the short message data, the traditional data encryption technology comprises symmetric encryption and asymmetric encryption, and when a large amount of data is processed, a symmetric encryption algorithm is often adopted to improve the encryption speed. Common symmetric encryption algorithms, such as the AES encryption algorithm, can effectively confuse the relationship between plaintext and ciphertext. However, in the process of generating a key matrix by the traditional AES encryption algorithm, higher relation exists between key words, so that the security of data encryption is lower, and the security of short message data cannot be effectively improved.
Disclosure of Invention
In order to solve the technical problems, the invention provides a short message data security encryption method based on wireless communication so as to solve the existing problems.
The invention discloses a short message data security encryption method based on wireless communication, which adopts the following technical scheme:
The embodiment of the invention provides a short message data security encryption method based on wireless communication, which comprises the following steps:
Collecting a plurality of pieces of short message information data through a transmission end of wireless communication;
Obtaining a binary character string sequence of each piece of short message data according to each piece of short message data, obtaining a binary character string frequency characteristic sequence of each piece of short message data according to the binary character string sequence, obtaining the information singular degree between any two pieces of short message data according to the binary character string sequence of any two pieces of short message data and the relation between elements in the binary character string frequency characteristic sequence, obtaining the short message characteristic similarity index between any two pieces of short message data according to the information singular degree between any two pieces of short message data and the relation between the corresponding binary character string sequences, and obtaining a short message template sequence to be encrypted based on the short message characteristic similarity index between any two pieces of short message data by using a Markov clustering algorithm;
For each piece of short message data in a short message template sequence to be encrypted, constructing a key byte matrix of each piece of short message data according to a binary string sequence of each piece of short message data in the short message template sequence to be encrypted, acquiring a byte change sequence of each key word in the key byte matrix, constructing a string change index of each byte in the byte change sequence according to a relation among bytes in the byte change sequence of each key word in the key byte matrix, acquiring the information richness of each key word in the key byte matrix of each piece of short message data according to the string change index average value and the information entropy of all bytes in the byte change sequence of each key word, constructing a key byte transfer matrix of each piece of short message data based on the information richness, and encrypting each piece of short message data in the short message template sequence to be encrypted by using an AES encryption algorithm based on the key byte transfer matrix.
Preferably, the obtaining the binary string sequence of each piece of short message data according to each piece of short message data includes:
converting each piece of short message information data into ASCII codes of each piece of short message information data, performing binary conversion on the ASCII codes of each piece of short message information data to obtain all binary character strings of each piece of short message information data, and forming all binary character strings of each piece of short message information data into a binary character string sequence of each piece of short message information data.
Preferably, the obtaining the binary string frequency characteristic sequence of each piece of short message data according to the binary string sequence includes:
Counting the occurrence frequency of each binary character string in the binary character string sequence for the binary character string sequence of each piece of short message information data, and forming the binary character string frequency characteristic sequence of each piece of short message information data by all kinds of binary character strings in the binary character string sequence according to the ascending frequency sequence, wherein all the same binary character strings in the binary character string sequence are of the same kind.
Preferably, the degree of information singular between any two pieces of short message information data includes:
Calculating the ED editing distance between binary character strings with minimum frequency in the binary character string frequency characteristic sequences of any two pieces of short message information data, recording the ED editing distance as the minimum frequency distance, taking the opposite number of the minimum frequency distance as an index of an exponential function based on a natural constant, calculating the sum value of the ED editing distance between binary character strings with maximum frequency in the binary character string frequency characteristic sequences of any two pieces of short message information data and a number 1, calculating the ratio of the calculation result of the exponential function to the sum value, and obtaining the difference value of the number 1 and the ratio;
calculating the average value of ED editing distances among all binary character strings at corresponding positions in the binary character string frequency characteristic sequences of the ith and jth short message information data;
and taking the product of the difference value and the average value as the information singular degree between the ith and the jth short message information data.
Preferably, the feature similarity index of the short message between any two pieces of short message data includes:
Taking the opposite number of the information singular degree between any two pieces of short message information data as an index of an exponential function taking a natural constant as a base number;
Calculating Jack-like coefficients between binary character string sequences of any two pieces of short message information data and Jack-like coefficients between binary character string frequency characteristic sequences, and obtaining the ratio of the sum value of the two Jack-like coefficients to a proportionality constant which is preset to be larger than zero;
and taking the product of the calculation result of the index function and the ratio as a short message characteristic similarity index between any two pieces of short message data.
Preferably, the short message template sequence to be encrypted includes:
taking each piece of short message information data as one node of the undirected graph, taking a short message information characteristic similarity index between two pieces of short message information data as the side weight of the side between two nodes in the undirected graph, taking a weighted undirected graph consisting of all the nodes and the side weights of the side between the nodes as the input of a Markov clustering algorithm, and outputting the clustering result of all the pieces of short message information data by the Markov clustering algorithm to obtain each cluster;
And randomly sampling one piece of short message data from different clusters, and forming a short message template sequence to be encrypted by all the sampled short message data.
Preferably, the constructing a key byte matrix of each short message data according to the binary string sequence of each short message data in the short message template sequence to be encrypted, and obtaining a byte variation sequence of each key word in the key byte matrix, includes:
performing plaintext grouping on a binary character string sequence of each piece of short message data in a short message template sequence to be encrypted by using an AES encryption algorithm to obtain a plaintext matrix of each piece of short message data in the short message template sequence to be encrypted;
Taking a plaintext matrix of each piece of short message data in the short message template sequence to be encrypted as input of an AES encryption algorithm, and outputting a key byte matrix of each piece of short message data in the short message template sequence to be encrypted by the AES encryption algorithm;
and taking a sequence formed by all bytes of each key word in the key byte matrix as a byte change sequence of each key word in the key byte matrix.
Preferably, the character string change index of each byte in the byte change sequence is constructed according to the relation between bytes in the byte change sequence of each key word in the key byte matrix, and the expression is:
And for the byte change sequence of each key word in the key byte matrix, calculating the ED editing distance between each byte and other bytes in the byte change sequence, and taking the average value of the ED editing distances between each byte and all other bytes in the byte change sequence as the character string change index of each byte in the byte change sequence.
Preferably, the information richness of each key word in the key byte matrix includes:
And for each key word in the key byte matrix, respectively calculating the average value and the information entropy of the character string change indexes of all bytes in the byte change sequence of the key word, and taking the product of the information entropy and the average value as the information richness of the key word.
Preferably, the constructing the key byte transfer matrix of each sms message data based on the information richness includes:
for a key byte matrix of each piece of short message data in a short message template sequence to be encrypted, all key words in the key byte matrix are formed into a decision key word sequence according to the information richness ascending order;
Taking the 1 st key word in the decision key word sequence as the 1 st column vector of the key byte transfer matrix, taking the Y-th key word in the decision key word sequence as the 2 nd column vector of the key byte transfer matrix, taking the 2 nd key word in the decision key word sequence as the 3 rd column vector of the key byte transfer matrix, taking the Y-1 st key word in the decision key word sequence as the 4 th column vector of the key byte transfer matrix, and so on, so as to obtain the key byte transfer matrix, wherein Y represents the total number of the key words in the decision key word sequence.
The invention has at least the following beneficial effects:
according to the invention, through constructing the short message characteristic similarity index, the association between plaintext matrixes is eliminated, the phenomenon that short message information sent by enterprises is leaked simultaneously is eliminated, and meanwhile, a key byte transfer matrix is constructed, so that the situation that higher association exists between key words in the key byte matrix, and the security of data encryption is lower is avoided. Therefore, the encryption security of the short message information data is improved by eliminating the association between plaintext matrixes and avoiding higher association between key words in the key byte matrixes.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions and advantages of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are only some embodiments of the invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flow chart of steps of a method for securely encrypting short message data based on wireless communication;
Fig. 2 is a schematic diagram of a key byte transfer matrix extraction process.
Detailed Description
In order to further describe the technical means and effects adopted by the invention to achieve the preset aim, the following detailed description is given below of the specific implementation, structure, characteristics and effects of the wireless communication-based short message data security encryption method according to the invention in combination with the accompanying drawings and the preferred embodiment. In the following description, different "one embodiment" or "another embodiment" means that the embodiments are not necessarily the same. Furthermore, the particular features, structures, or characteristics of one or more embodiments may be combined in any suitable manner.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
The following specifically describes a specific scheme of the wireless communication-based short message data security encryption method provided by the invention with reference to the accompanying drawings.
The method for securely encrypting the short message data based on the wireless communication provided by the embodiment of the invention specifically provides the following method for securely encrypting the short message data based on the wireless communication, referring to fig. 1, the method comprises the following steps:
step S001, short message information data is obtained from a transmission end of wireless communication, and the short message information data is preprocessed.
In the process of transmitting the short message data through wireless communication, in order to improve the safety of the transmission of the short message data, the embodiment encrypts the short message data of the wireless communication transmission end, thereby avoiding the leakage or the falsification of the short message data. K pieces of short message data are collected through a transmission end of wireless communication, wherein the empirical value of K is 50. In order to avoid the situation that the content of the subsequent encryption has errors due to the deletion and the error of the short message information data, the data cleaning is performed on each piece of short message information data, and the specific process is not repeated.
So far, each piece of short message information data is obtained.
Step S002, obtaining a binary character string sequence according to the short message information data, calculating the information singular degree, obtaining a short message information feature similarity index according to the information singular degree, and constructing a short message information template sequence to be encrypted; and acquiring a key byte matrix according to the short message template sequence to be encrypted, calculating a character string change index, acquiring the information richness based on the character string change index, and constructing a key byte transfer matrix.
Because of the fact that there is a high possibility of high contact between the short message data transmitted through the wireless communication, for example, because of the limitation of the characters of the short message data, the enterprise transmits the short message notification and needs at least two pieces of short message information to convey clear content, and at the moment, the two pieces of short message data have a high relevance, and are easy to attack on the transmitted information content by an attacker at the moment, and when the two pieces of short message content are leaked, the enterprise is caused to complete notification and determine to leak. To avoid this, it is necessary to analyze the relationship between the message data.
Specifically, each piece of short message data is converted into ASCII codes of each piece of short message data by using ASCII code technology, then binary conversion is carried out on the ASCII codes of each piece of short message data, 8-bit binary character strings of each piece of short message data can be obtained, and a sequence formed by all binary character strings of each piece of short message data is used as a binary character string sequence of each piece of short message data. The ASCII code technique and binary conversion are known techniques, and specific processes are not described herein.
Further, in order to analyze the relation of the binary string sequences of the short message data more clearly, the characteristics of the binary string sequences of each short message data are extracted. And counting the occurrence frequency of each binary character string in the binary character string sequence for the binary character string sequence of each piece of short message information data, and taking the sequence formed by all binary character strings in the binary character string sequence according to the ascending order of the frequency as the frequency characteristic sequence of the binary character string of each piece of short message information data.
Based on the analysis, calculating the characteristic similarity index of the short message between the two pieces of short message data:
In the method, in the process of the invention, Representing the information singular degree between the ith and jth short message information data,/>As an exponential function based on natural constants,/>Edit distance function for ED,/>ED editing distance between binary character strings with minimum frequency in binary character string frequency characteristic sequence representing ith and jth short message information data is recorded as minimum frequency distance/>ED editing distance between binary character strings with maximum frequency in binary character string frequency characteristic sequence of ith and jth short message information data,/>Minimum value of binary character string number in binary character string frequency characteristic sequence representing ith and jth short message information data,/>The ED editing distance between the s binary character strings in the binary character string frequency characteristic sequence of the ith and the jth short message information data is represented;
short message characteristic similarity index between the ith short message data and the jth short message data is expressed by the index,/> As Jacquard similarity coefficient function,/>Jack similarity coefficient between binary string sequences representing ith and jth short message data,/>The jekcard similarity coefficient between the binary string frequency characteristic sequences of the ith and jth short message data is shown, M is a preset proportionality constant larger than zero, and can be set by an implementer by himself, and the proportionality constant is given a value of 2 in the embodiment without limitation.
Minimum distance of frequencyThe smaller and/>The smaller the message data, the closer the connection between the parts with the highest occurrence frequency and the lowest occurrence frequency between the two pieces of message data is, namely the lower the singularity between the two pieces of message data is, the lower the message singularity is; at the same time ED edit distance/>The smaller the message data, the stronger the relation exists between the two pieces of short message data at the moment, namely the lower the singularity between the two pieces of short message data is, the smaller the information singularity is. Thus, information singular/>The smaller and the Jacquard similarity coefficient/>The larger the/>The larger the short message feature similarity index is, the stronger the similarity relation between the two short message data is, and the larger the short message feature similarity index is.
Further, in order to improve the safety of the encryption of the short message information data, the situation that larger connection exists between the continuously pushed short message information data is avoided, and therefore the risk of tight connection between plaintext matrixes is reduced. And taking each piece of short message information data as one node of the undirected graph, taking the short message information characteristic similarity index between two pieces of short message information data as the side weight of the side between two nodes in the undirected graph, taking a weighted undirected graph consisting of all the nodes and the side weights of the side between the nodes as a short message information association undirected graph, taking the short message information association undirected graph as the input of a Markov clustering algorithm, outputting the Markov clustering algorithm as the clustering result of all pieces of short message information data, and obtaining each cluster, wherein the Markov clustering algorithm is a known technology, and the specific process is not repeated.
Specifically, short message data in different clusters have smaller relevance, in order to avoid generating high similarity between initial plaintext, one short message data is randomly sampled from different clusters, and then a sequence formed by all sampled short message data is used as a short message template sequence to be encrypted. Therefore, the condition of higher similarity between adjacent short message information data is avoided.
Further, in this embodiment, each 8-bit binary string in the binary string sequence of each piece of short message data in the short message information template sequence to be encrypted is used as each 8-bit byte, and the binary string sequence of each piece of short message data in the short message information template sequence to be encrypted is subjected to plaintext grouping by using an AES encryption algorithm (Advanced Encryption Standard, AES) to obtain a plaintext matrix of each piece of short message data in the short message information template sequence to be encrypted, and at this time, plaintext matrices of adjacent pieces of short message data in the short message information template sequence to be encrypted have smaller correlation, so that attack of an external person on the plaintext matrix can be effectively avoided.
Further, taking a plaintext matrix of each piece of short message data in the short message template sequence to be encrypted as input of an AES encryption algorithm, taking output of the AES encryption algorithm as a key byte matrix of 128 bits of each piece of short message data in the short message template sequence to be encrypted, wherein the AES encryption algorithm is a known technology, and specific processes are not repeated.
In the traditional algorithm, a plaintext is encrypted by using a key byte matrix, the key byte matrix is subjected to key expansion by using an AES key expansion algorithm, and the key expansion result is subjected to round key addition for 10 rounds. However, the key byte matrix in the traditional algorithm is easy to attack by an attacker, because a larger correlation exists between adjacent key words in the key byte matrix, and when a certain key word is revealed, other key words have a larger risk of revealing.
Further, in order to improve the security of the encryption of the short message data, the key byte matrix needs to be processed before the key expansion. And regarding a key byte matrix of each piece of short message data in the short message template sequence to be encrypted, taking a sequence formed by all bytes in each key word in the key byte matrix as a byte change sequence of each key word in the key byte matrix, wherein each byte is an 8-bit binary character string.
Based on the above processing, for the key byte matrix of 128 bits of each piece of short message information data in the short message information template sequence to be encrypted, the information richness of each key word in the key byte matrix is calculated:
In the method, in the process of the invention, String change index representing the f-th byte in the byte change sequence of the g-th key word in the key byte matrix,/>Representing the number of bytes in the byte variation sequence of the g-th key word in the key byte matrix,/>Edit distance function for ED,/>The ED editing distance between the f and the q bytes in the byte change sequence of the g-th key word in the key byte matrix is represented;
information richness of g-th key word in key byte matrix,/> Information entropy representing the string change index of all bytes in the byte change sequence of the g-th key word in the key byte matrix.
ED edit distanceThe larger the difference between character strings represented by the explanatory bytes is, the larger the variation from other bytes is reflected to some extent, and the larger the character string variation index is. In addition, information entropy/>The larger the byte is, the larger the disorder degree of the byte in the byte change sequence is, namely the more abundant the short message information is, and meanwhile, the average value of the character string change indexes isThe larger the character of the byte in the byte changing sequence of the key word is, the larger the character of the byte is, namely the more abundant the short message information is, the larger the information richness is.
So far, the information richness of each key word in the key byte matrix of each piece of short message data in the short message template sequence to be encrypted is obtained.
Further, in order to avoid that the key byte matrix is attacked by an attacker due to the fact that a plurality of adjacent key words have higher short message information at the same time, the implementation constructs a key byte transfer matrix, and a key byte transfer matrix extraction flow diagram is shown in fig. 2. For the key byte matrix of each piece of short message data in the short message template sequence to be encrypted, taking a sequence formed by all key words in the key byte matrix according to the ascending order of the information richness as a decision key word sequence, taking the 1 st key word in the decision key word sequence as the 1 st key word of the target key word sequence, taking the Y-th key word in the decision key word sequence as the 2 nd key word of the target key word sequence, taking the 2 nd key word in the decision key word sequence as the 3 rd key word of the target key word sequence, taking the Y-1 th key word in the decision key word sequence as the 4 th key word of the target key word sequence, taking the 3 rd key word in the decision key word sequence as the 5 th key word of the target key word sequence, taking the Y-2 key word in the decision key word sequence as the 6 th key word of the target key word sequence, and sequentially analogizing based on the mode, so as to obtain the target key word sequence, wherein Y represents the total number of key words in the decision key word sequence, namely the number of all key words in the key word matrix. And taking each key word in the target key word sequence as each column of a matrix, and taking the obtained matrix as a key byte transfer matrix of each piece of short message information data in the short message information template sequence to be encrypted. It should be noted that, all bytes of a key word are a column vector, that is, each key word is a column vector, and each key word in the target key word sequence is taken as each column of the key byte transfer matrix.
Thus, a key byte transfer matrix of each piece of short message data in the short message template sequence to be encrypted is obtained.
Step S003, acquiring a plaintext and a ciphertext after data encryption based on a key byte transfer matrix by using an AES encryption algorithm, and completing a short message data security encryption method based on wireless communication.
Furthermore, the key byte transfer matrix avoids the situation that the internal adjacent key words have higher short message information at the same time, and improves the security of data encryption. And taking the key byte transfer matrix of each piece of short message data in the short message template sequence to be encrypted as input of an AES encryption algorithm, performing key expansion and round key addition on the key byte transfer matrix, and outputting plaintext and ciphertext of each piece of short message data in the short message template sequence to be encrypted by the AES encryption algorithm to complete safe encryption of the short message data. The AES encryption algorithm is a well-known technique, and the specific process is not described in detail.
Thus, the above-mentioned process according to the present embodiment completes the short message data security encryption method based on wireless communication.
It should be noted that: the sequence of the embodiments of the present invention is only for description, and does not represent the advantages and disadvantages of the embodiments. And the foregoing description has been directed to specific embodiments of this specification. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
In this specification, each embodiment is described in a progressive manner, and the same or similar parts of each embodiment are referred to each other, and each embodiment mainly describes differences from other embodiments.
The above embodiments are only for illustrating the technical solution of the present application, and not for limiting the same; the technical solutions described in the foregoing embodiments are modified or some of the technical features are replaced equivalently, so that the essence of the corresponding technical solutions does not deviate from the scope of the technical solutions of the embodiments of the present application, and all the technical solutions are included in the protection scope of the present application.
Claims (7)
1. The short message data security encryption method based on wireless communication is characterized by comprising the following steps:
Collecting a plurality of pieces of short message information data through a transmission end of wireless communication;
Obtaining a binary character string sequence of each piece of short message data according to each piece of short message data, obtaining a binary character string frequency characteristic sequence of each piece of short message data according to the binary character string sequence, obtaining the information singular degree between any two pieces of short message data according to the binary character string sequence of any two pieces of short message data and the relation between elements in the binary character string frequency characteristic sequence, obtaining the short message characteristic similarity index between any two pieces of short message data according to the information singular degree between any two pieces of short message data and the relation between the corresponding binary character string sequences, and obtaining a short message template sequence to be encrypted based on the short message characteristic similarity index between any two pieces of short message data by using a Markov clustering algorithm;
For each piece of short message data in a short message template sequence to be encrypted, constructing a key byte matrix of each piece of short message data according to a binary string sequence of each piece of short message data in the short message template sequence to be encrypted, acquiring a byte change sequence of each key word in the key byte matrix, constructing a string change index of each byte in the byte change sequence according to a relation among bytes in the byte change sequence of each key word in the key byte matrix, acquiring the information richness of each key word in the key byte matrix of each piece of short message data according to the string change index average value and the information entropy of all bytes in the byte change sequence of each key word, constructing a key byte transfer matrix of each piece of short message data based on the information richness, and encrypting each piece of short message data in the short message template sequence to be encrypted by using an AES encryption algorithm based on the key byte transfer matrix;
The obtaining the information singular degree between any two pieces of short message information data according to the relation between elements in the binary character string sequence and the binary character string frequency characteristic sequence of the any two pieces of short message information data comprises the following steps:
Calculating the ED editing distance between binary character strings with minimum frequency in the binary character string frequency characteristic sequences of any two pieces of short message information data, recording the ED editing distance as the minimum frequency distance, taking the opposite number of the minimum frequency distance as an index of an exponential function based on a natural constant, calculating the sum value of the ED editing distance between binary character strings with maximum frequency in the binary character string frequency characteristic sequences of any two pieces of short message information data and a number 1, calculating the ratio of the calculation result of the exponential function to the sum value, and obtaining the difference value of the number 1 and the ratio;
calculating the average value of ED editing distances among all binary character strings at corresponding positions in the binary character string frequency characteristic sequences of the ith and jth short message information data;
Taking the product of the difference value and the average value as the information singular degree between the ith and the jth short message information data;
the construction of the key byte matrix of each short message data according to the binary string sequence of each short message data in the short message template sequence to be encrypted, and the acquisition of the byte variation sequence of each key word in the key byte matrix, comprises the following steps:
performing plaintext grouping on a binary character string sequence of each piece of short message data in a short message template sequence to be encrypted by using an AES encryption algorithm to obtain a plaintext matrix of each piece of short message data in the short message template sequence to be encrypted;
Taking a plaintext matrix of each piece of short message data in the short message template sequence to be encrypted as input of an AES encryption algorithm, and outputting a key byte matrix of each piece of short message data in the short message template sequence to be encrypted by the AES encryption algorithm;
taking a sequence formed by all bytes of each key word in the key byte matrix as a byte change sequence of each key word in the key byte matrix;
the key byte transfer matrix for constructing each short message information data based on the information richness comprises the following steps:
for a key byte matrix of each piece of short message data in a short message template sequence to be encrypted, all key words in the key byte matrix are formed into a decision key word sequence according to the information richness ascending order;
Taking the 1 st key word in the decision key word sequence as the 1 st column vector of the key byte transfer matrix, taking the Y-th key word in the decision key word sequence as the 2 nd column vector of the key byte transfer matrix, taking the 2 nd key word in the decision key word sequence as the 3 rd column vector of the key byte transfer matrix, taking the Y-1 st key word in the decision key word sequence as the 4 th column vector of the key byte transfer matrix, and so on, so as to obtain the key byte transfer matrix, wherein Y represents the total number of the key words in the decision key word sequence.
2. The method for securely encrypting sms data based on wireless communication of claim 1, wherein said obtaining a binary string sequence of each sms message data from each sms message data comprises:
converting each piece of short message information data into ASCII codes of each piece of short message information data, performing binary conversion on the ASCII codes of each piece of short message information data to obtain all binary character strings of each piece of short message information data, and forming all binary character strings of each piece of short message information data into a binary character string sequence of each piece of short message information data.
3. The method for securely encrypting the sms data based on the wireless communication of claim 2, wherein said obtaining the binary string frequency characteristic sequence of each sms message data according to the binary string sequence comprises:
Counting the occurrence frequency of each binary character string in the binary character string sequence for the binary character string sequence of each piece of short message information data, and forming the binary character string frequency characteristic sequence of each piece of short message information data by all kinds of binary character strings in the binary character string sequence according to the ascending frequency sequence, wherein all the same binary character strings in the binary character string sequence are of the same kind.
4. The method for securely encrypting the short message data based on the wireless communication according to claim 1, wherein the short message feature similarity index between any two pieces of short message data comprises:
Taking the opposite number of the information singular degree between any two pieces of short message information data as an index of an exponential function taking a natural constant as a base number;
Calculating Jack-like coefficients between binary character string sequences of any two pieces of short message information data and Jack-like coefficients between binary character string frequency characteristic sequences, and obtaining the ratio of the sum value of the two Jack-like coefficients to a proportionality constant which is preset to be larger than zero;
and taking the product of the calculation result of the index function and the ratio as a short message characteristic similarity index between any two pieces of short message data.
5. The method for securely encrypting the short message data based on the wireless communication according to claim 4, wherein the short message template sequence to be encrypted comprises:
taking each piece of short message information data as one node of the undirected graph, taking a short message information characteristic similarity index between two pieces of short message information data as the side weight of the side between two nodes in the undirected graph, taking a weighted undirected graph consisting of all the nodes and the side weights of the side between the nodes as the input of a Markov clustering algorithm, and outputting the clustering result of all the pieces of short message information data by the Markov clustering algorithm to obtain each cluster;
And randomly sampling one piece of short message data from different clusters, and forming a short message template sequence to be encrypted by all the sampled short message data.
6. The method for securely encrypting sms data based on wireless communication of claim 1, wherein said constructing a string change exponent for each byte in the byte change sequence based on a relationship between bytes in the byte change sequence for each key word in the key byte matrix comprises:
And for the byte change sequence of each key word in the key byte matrix, calculating the ED editing distance between each byte and other bytes in the byte change sequence, and taking the average value of the ED editing distances between each byte and all other bytes in the byte change sequence as the character string change index of each byte in the byte change sequence.
7. The method for securely encrypting sms data over wireless communication of claim 1, wherein the information richness of each key word in the key byte matrix comprises:
And for each key word in the key byte matrix, respectively calculating the average value and the information entropy of the character string change indexes of all bytes in the byte change sequence of the key word, and taking the product of the information entropy and the average value as the information richness of the key word.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410275817.3A CN117880762B (en) | 2024-03-12 | 2024-03-12 | Short message data security encryption method based on wireless communication |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410275817.3A CN117880762B (en) | 2024-03-12 | 2024-03-12 | Short message data security encryption method based on wireless communication |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117880762A CN117880762A (en) | 2024-04-12 |
| CN117880762B true CN117880762B (en) | 2024-05-14 |
Family
ID=90588749
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410275817.3A Active CN117880762B (en) | 2024-03-12 | 2024-03-12 | Short message data security encryption method based on wireless communication |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117880762B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101374251A (en) * | 2007-08-21 | 2009-02-25 | 康佳集团股份有限公司 | Method for encrypting short message and used terminal equipment thereof |
| CN101930458A (en) * | 2010-08-18 | 2010-12-29 | 杭州东信北邮信息技术有限公司 | Short message matching method based on characteristic value |
| CN110366183A (en) * | 2019-08-02 | 2019-10-22 | 中国工商银行股份有限公司 | Short message safety protecting method and device |
| CN111246407A (en) * | 2020-01-10 | 2020-06-05 | 北京智信通联信息技术有限公司 | Data encryption and decryption method and device for short message transmission |
| CN112688315A (en) * | 2020-12-16 | 2021-04-20 | 国网辽宁省电力有限公司经济技术研究院 | Attack and defense system and method based on electric vehicle power distribution network information physical system |
-
2024
- 2024-03-12 CN CN202410275817.3A patent/CN117880762B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101374251A (en) * | 2007-08-21 | 2009-02-25 | 康佳集团股份有限公司 | Method for encrypting short message and used terminal equipment thereof |
| CN101930458A (en) * | 2010-08-18 | 2010-12-29 | 杭州东信北邮信息技术有限公司 | Short message matching method based on characteristic value |
| CN110366183A (en) * | 2019-08-02 | 2019-10-22 | 中国工商银行股份有限公司 | Short message safety protecting method and device |
| CN111246407A (en) * | 2020-01-10 | 2020-06-05 | 北京智信通联信息技术有限公司 | Data encryption and decryption method and device for short message transmission |
| CN112688315A (en) * | 2020-12-16 | 2021-04-20 | 国网辽宁省电力有限公司经济技术研究院 | Attack and defense system and method based on electric vehicle power distribution network information physical system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117880762A (en) | 2024-04-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115333735A (en) | Safe data transmission method | |
| CN116775589A (en) | Data security protection method for network information | |
| CN112597519B (en) | Non-key decryption method based on convolutional neural network in OFDM encryption system | |
| CN106230578B (en) | A kind of safe arithmetic coding method of binary system of the three-dimensional Lorenz mapping control based on weighting processing | |
| CN113194213A (en) | PNG image information hiding and recovering method based on secret sharing and chaotic mapping | |
| CN115883109B (en) | Data compression encryption method and system for aviation system | |
| CN115426101B (en) | Data transmission method of cloud intercommunication platform | |
| CN116155620B (en) | Transaction data secure transmission method for card reader | |
| CN116071164B (en) | Digital asset tracing method based on blockchain management | |
| CN115296862A (en) | Network data secure transmission method based on data coding | |
| CN117880762B (en) | Short message data security encryption method based on wireless communication | |
| CN117829837A (en) | Data processing method and system for digital currency | |
| CN114169499A (en) | Packet cipher system identification method based on LeNet5-RF algorithm | |
| CN114401116B (en) | Trusted data transmission method based on HK-Means and security detection | |
| CN114866657B (en) | JPEG image encryption method for selecting plaintext safety and reducing size of ciphertext image file | |
| CN117955736B (en) | Network large-scale data security storage method | |
| CN118094628B (en) | Multi-main-body data cross-domain secure interaction system based on encryption algorithm | |
| CN110909335A (en) | Binary biological characteristic identification method for privacy protection | |
| CN117478310B (en) | USB data encryption transmission method | |
| CN117112513B (en) | Intelligent storage method for dynamic key of electronic seal | |
| CN117459322B (en) | Computer software data encryption method based on Internet of things | |
| CN116405293B (en) | Data encryption storage method of safe operation and maintenance system | |
| CN118018331B (en) | Privacy protection method and system for big data cloud service | |
| CN117560233B (en) | Method and system based on data interaction encryption | |
| CN118353609B (en) | VPDN technology-based lightweight operation and maintenance method for client |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |