CN111950007B

CN111950007B - Text information hiding method and device, electronic equipment and storage medium

Info

Publication number: CN111950007B
Application number: CN202010814684.4A
Authority: CN
Inventors: 药青; 邹仕洪; 张广伟; 黄浩东
Original assignee: Yuanxin Technology
Current assignee: Yuanxin Information Technology Group Co ltd
Priority date: 2020-08-13
Filing date: 2020-08-13
Publication date: 2022-02-22
Anticipated expiration: 2040-08-13
Also published as: CN111950007A

Abstract

The embodiment of the application provides a text information hiding method and device, electronic equipment and a storage medium. The method comprises the following steps: inserting a text to be hidden into any one of M +1 positions determined by M second characters in a preset random character set to obtain M +1 text character strings; for each text character string, exchanging positions of each character in the text character string with other characters, and for each character, calculating a difference value between a character distance between the characters before and after the character exchange position and a character distance of a corresponding character in the text to be hidden; for each character of each text character string, calculating to obtain a comprehensive difference value of different text character sets obtained before and after the character exchange position according to a difference value between a character distance between the characters before and after the character exchange position and a character distance of a corresponding character in the text to be hidden; and taking one or more text character sets corresponding to the comprehensive difference values meeting the preset requirements as target character sets.

Description

Text information hiding method and device, electronic equipment and storage medium

Technical Field

The present application relates to the field of information security technologies, and in particular, to a text information hiding method and apparatus, an electronic device, and a computer-readable storage medium.

Background

At present, the requirement on information security is higher and higher, means for protecting the information security are richer and richer, and a plurality of encryption and decryption methods for text information are disclosed. In some special cases, where it is not appropriate to encrypt text information or as an aid to encryption, text hiding is also often employed.

The basic principle of text hiding stores text information needing to be protected in a large amount of text information which has similar characteristics but does not need to be protected, so that an information stealer cannot easily acquire the protected text information by analyzing the probability characteristics of the text. The existing text hiding method mainly utilizes normal text data collected from a network as a text library for hiding, and texts to be hidden are easy to find.

Disclosure of Invention

The purpose of the present application is to solve at least one of the above technical drawbacks, and to provide the following solutions:

in a first aspect, a method for hiding text information is provided, where the method includes:

sequentially inserting a text to be hidden into any one of M +1 positions determined by M second characters in a preset random character set to obtain M +1 text character strings, wherein the text to be hidden comprises a plurality of unordered first characters, the first characters comprise N characters, M and N are positive integers, and the random character set comprises M second characters of preset multiples corresponding to each character in the N characters;

for each text character string, exchanging each character in the text character string with other characters according to a preset transposition rule, and calculating a difference value between a character distance between the character before and after the character exchange position and a character distance of a corresponding character in the text to be hidden for each character;

for each character of each text character string, calculating to obtain a comprehensive difference value of different text character sets obtained before and after the character exchange position according to a difference value between the character distance between the character before and after the character exchange position and the character distance of the corresponding character in the text to be hidden;

and taking one or more text character set sets corresponding to the comprehensive difference values meeting the preset requirements as target character sets.

In a second aspect, an apparatus for hiding text information is provided, the apparatus comprising:

the device comprises a hiding module, a processing module and a processing module, wherein the hiding module is used for sequentially inserting a text to be hidden into any one of M +1 positions determined by M second characters in a preset random character set to obtain M +1 text character strings, the text to be hidden comprises a plurality of unordered first characters, the first characters comprise N characters, M and N are positive integers, and the random character set comprises M second characters of preset multiples corresponding to each character in the N characters;

the transposition calculation module is used for exchanging each character in the text character string with other characters according to a preset transposition rule aiming at each text character string, and calculating a difference value between a character distance between the character before and after the character exchange position and a character distance of a corresponding character in the text to be hidden aiming at each character;

the difference calculation module is used for calculating to obtain a comprehensive difference value of different text character sets obtained before and after the character exchange position according to the difference value between the character distance between the characters before and after the character exchange position and the character distance of the corresponding character in the text to be hidden aiming at each character of each text character string;

and the character set determining module is used for taking one or more of the text character set sets corresponding to the comprehensive difference values meeting the preset requirements as target character sets.

In a third aspect, an electronic device is provided, which includes:

one or more processors;

a memory;

one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs configured to: the method for hiding textual information according to the first aspect of the present application is performed.

In a fourth aspect, a storage medium is provided, which is a computer-readable storage medium, and a computer program is stored thereon, and when being executed by a processor, the computer program implements the text information hiding method shown in the first aspect of the present application.

The beneficial effect that technical scheme that this application provided brought is: according to a preset transposition rule, exchanging positions of each character in the text character string with other characters, calculating a difference value between a character distance between the characters before and after the character exchange position and a character distance of a corresponding character in the text to be hidden aiming at each character, so that the difference degree of each character and the corresponding character of the text to be hidden can be obtained and further the comprehensive difference value of the text character set obtained by exchanging is determined, and the integral difference degree of the text character set and the text to be hidden can be obtained according to comprehensive judgment of the comprehensive difference value, so that the difference degree of the finally obtained target character set and the text to be hidden is small, and the analysis of which text is to be hidden is difficult, and the probability of finding the text to be hidden in the target character set is extremely low.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings used in the description of the embodiments of the present application will be briefly described below.

Fig. 1 is a schematic flowchart of a text information hiding method according to an embodiment of the present application;

fig. 2 is a schematic flow chart of a text information hiding method according to an embodiment of the present application;

FIG. 3 is a detailed flowchart of step S201 in FIG. 2;

FIG. 4 is a detailed flowchart of step S102 in FIG. 1;

FIG. 5 is a detailed flowchart of step S402 in FIG. 4;

fig. 6 is a schematic flow chart of a text information hiding method according to an embodiment of the present application;

fig. 7 is a schematic flowchart of a text information hiding method according to an embodiment of the present application;

fig. 8 is a schematic structural diagram of a text information hiding apparatus according to an embodiment of the present application;

fig. 9 is a schematic structural diagram of an electronic device for hiding text information according to an embodiment of the present application.

Detailed Description

Reference will now be made in detail to embodiments of the present application, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are exemplary only for the purpose of explaining the present application and are not to be construed as limiting the present invention.

As used herein, the singular forms "a", "an", "the" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. It will be understood that when an element is referred to as being "connected" or "coupled" to another element, it can be directly connected or coupled to the other element or intervening elements may also be present. Further, "connected" or "coupled" as used herein may include wirelessly connected or wirelessly coupled. As used herein, the term "and/or" includes all or any element and all combinations of one or more of the associated listed items.

To make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.

The text information hiding method, the text information hiding device, the electronic equipment and the computer readable storage medium aim to solve the technical problems in the prior art.

The following describes the technical solutions of the present application and how to solve the above technical problems with specific embodiments. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments. Embodiments of the present application will be described below with reference to the accompanying drawings.

Those skilled in the art will understand that the "terminal" described in the present application may be a Mobile phone, a tablet computer, a PDA (Personal Digital Assistant), an MID (Mobile Internet Device), etc.; a "server" may be implemented as a stand-alone server or as a server cluster comprised of multiple servers.

Referring to fig. 1, an embodiment of the present application provides a text information hiding method, where the text information hiding method may be applied to a terminal or a server, and the method includes:

s101: inserting a text to be hidden into any one of M +1 positions determined by M second characters in a preset random character set to obtain M +1 text character strings, wherein the text to be hidden comprises a plurality of unordered first characters, the first characters comprise N characters, M and N are positive integers, and the random character set comprises M second characters of preset multiples corresponding to each character in the N characters.

The text to be hidden comprises a plurality of unordered first characters, the unordered characters comprise N characters, and the numerical value of N is not limited. The characters in the present application may be a letter, a number and/or a word. The vocabulary can be a word or a Chinese character. The words may be Chinese words or English words, such as "mom" or "mother". Specifically, the text to be hidden includes the character "I, A, I, A, U, I, A, P, P, I", or the text to be hidden includes the character "cool, very, weather, today". The characters can be letters such as character "I" and letter "A", and can also be words such as "cool and very". When the character of the text to be hidden is "I, A, I, A, U, I, A, P, P, I", the text to be hidden includes "I, A, U, P" four characters, i.e., N is 4. Wherein, the character "I" includes 4, the character "A" includes 3, the character "U" includes 1, and the character "P" includes 2.

The random character set includes M second characters of a preset multiple corresponding to each of the N characters. The random character set comprises M second characters of preset multiple corresponding to each character in the N characters, and if one second character corresponds to one first character, the second character is the same as or similar to the first character. In the present application, if the character is a letter or a number, and the second character corresponds to the first character, the second character is the same as the first character; if the character is a word, the second character is the same as or similar to the first character. When the words are similar, it may be that the words have similar meanings. Specifically, if the vocabulary is "today" and "today" represents time, the similar vocabulary of "today" may be "morning", "noon", "evening", "yesterday", "previous day", "this year", "last year", etc. The similar vocabulary can be consistent with or inconsistent with the character length of the corresponding vocabulary, and in the application, the similar vocabulary is consistent with the character length of the corresponding vocabulary, if the 'today' is two Chinese characters, the corresponding similar vocabulary is also two Chinese characters, the similar vocabulary can not be three Chinese characters and other Chinese characters, and if the 'today' display vocabulary can not be 'one hour ago'.

When the characters of the text to be hidden are "I, A, I, A, U, I, A, P, P, I", N is 4, the text to be hidden has 10 characters in total, and assuming that the preset multiple is 4, the number of each character of the random character set is 4 times the preset multiple of the text to be hidden, and the total number of the characters of the random character set is 4 times the total number of the characters of the text to be hidden, that is, the random character set includes 4 × 4I characters, 3 × 4 a characters, 1 × 4U characters, 2 × 4P characters, and the random character set has 40 characters in total. Wherein, the characters of the random character set are formed after random arrangement.

When the random character set includes M second characters, then M +1 positions are included in the random character set. Specifically, a position is arranged between every two characters, the front of the first character of the random character set is a position, and the back of the last character of the random character set is a position, so that the random character set has m +1 positions in total. For example, the random character set includes 3 characters "1, 2, 3", and 4 positions in the character set to be hidden, in front of 1, between 1 and 2, between 2 and 3, and behind 3.

And inserting the text to be hidden into any one of M +1 positions determined by the M second characters in a preset random character set to obtain M +1 text character strings. And inserting the hidden text into a position to obtain a text character string.

Referring to fig. 2, before the text to be hidden is sequentially inserted into any one of M +1 positions determined by M second characters in the preset random character set, the text information hiding method further includes:

s201: and generating an imitation character set according to the text to be hidden, wherein the imitation character set comprises M second characters which are corresponding to each character of the N characters of the text to be hidden by preset times, and the character type of the imitation character set is the same as or similar to that of the text to be hidden.

The set of mimic characters mimics the characters comprised by the text to be hidden. The mimic character set includes M second characters of a preset multiple corresponding to each of the N characters of the text to be hidden.

Referring to fig. 3, generating a mimic character set according to a text to be hidden may include:

s301: and acquiring the character type and the number corresponding to each character of the text to be hidden.

After the hidden text is determined, the character type and the number corresponding to each character of the hidden text can be obtained. If the text to be hidden is "I, A, I, A, U, I, A, P, P, I", the text to be hidden can be obtained to include 4 characters, which are "I", "a", "U", and "P", respectively. The text to be hidden comprises 4I characters, 3A characters, 1U character, 2P characters and 40 characters in total.

S302: and acquiring the same or similar characters corresponding to each character in preset multiples.

The same or similar characters corresponding to each character may be stored in advance. The proximity of each character may be preset by the user. When the character type and the number corresponding to each character of the text to be hidden are acquired, the same or similar characters of the preset multiple of the number corresponding to each character can be acquired according to the same or similar characters corresponding to each character which are stored in advance.

S303: and generating a simulation character set according to the same or similar characters of preset multiples of the number corresponding to each character.

After the same or similar characters with the preset multiple of the number corresponding to each character are obtained, the same or similar characters with the preset multiple of the number corresponding to each obtained character can be collected together to generate an imitation character set.

S202: the second characters in the simulated character set are randomly arranged to generate a random character set.

And randomly arranging the characters in the imitation character set to obtain a random character set. When the second characters in the imitation character set are randomly arranged, each second character of the imitation character set can be numbered, each character obtains a corresponding number, the number numbers are randomly arranged by using a random number generation algorithm to obtain a randomly arranged number, and the second characters are placed at the positions of the corresponding number to obtain the random character set.

S102: and aiming at each text character string, exchanging each character in the text character string with other characters according to a preset transposition rule, and calculating a difference value between the character distance between the character before and after the character exchange position and the character distance of the corresponding character in the text to be hidden aiming at each character.

The M +1 text character strings are processed, the processing method of each text character string is the same, and only one text character string processing scheme is described in the application.

Character distance, which represents how far or near the distance between two characters is. The character distance between two characters can be determined according to the number of other characters between the two characters. Specifically, if there are 0 other characters between two characters, that is, there is no other character between two characters, the character distance between two characters is 1, and the character distance between two characters increases by 1 every time a character is added between two characters. For example, if the character string is "a, a", the character distance between the two characters a and a is 1, and if the character string is "a, B, a", the character distance between the two characters a is 2. It can be understood that according to the idea of the present technical solution, other character distances with different proportions may also be determined, for example, an initial value of the character distance is changed to 0 or 2 when there is no character between two characters; the increase value of the character distance, such as 2 or 3, is changed for each character added between two characters.

Before exchanging positions of characters in the text character string with other characters, a difference value between a character distance between each kind of characters in the text character string and a character distance of the text to be hidden can be calculated. The difference value represents the degree of difference, and the smaller the difference value is, the more similar the arrangement order of the characters of the text string and the arrangement order of the characters of the text to be hidden are. The method for calculating the difference value is not limited, for example, the method can use the average value, the variance, the standard deviation, or the like, or the scheme that different methods use the combination of weights.

For a text character string, exchanging positions of one character of the text character string with other characters, calculating and recording a difference value between a character distance of the character after exchanging the characters and a character distance of a corresponding character of a text to be hidden, and then exchanging positions of all characters for a second character to obtain an exchanged difference value of each character. It can be understood that, for a text string, a new text string can be obtained if one character is exchanged in position, so that when a text string exchanges positions with other characters, different text strings can be obtained, that is, a text character set. In the present application, when a character is exchanged with another character, the exchange may be performed in an initial state of a text string. That is, when all the characters of the first character are exchanged, the second character is exchanged in a state where the character string is before the exchange character position when the position exchange of the second character is performed. It will be appreciated that the location of the second character may also be exchanged for a string based on the first character exchange.

And then, calculating the second text character string to obtain the difference values of the characters of all the text character strings.

S103: and for each character of each text character string, calculating to obtain a comprehensive difference value of different text character sets obtained before and after the character exchange position according to the difference value between the character distance between the characters before and after the character exchange position and the character distance of the corresponding character in the text to be hidden.

According to step S102, a difference value between a character distance between each character of the text character set and a character distance of a corresponding character in the text to be hidden, which is obtained before and after the character exchange position of each text character string, can be obtained. And the comprehensive difference value is the sum of the difference values of the character distances of all characters in a text character set and the character distances of corresponding characters in the text to be hidden.

Specifically, according to the following formula, for each character of each text character string, a comprehensive difference value of different text character sets obtained before and after the character exchange position is calculated according to a difference value between a character distance between the character before and after the character exchange position and a character distance of a corresponding character in the text to be hidden:

wherein S is the comprehensive difference value of the text character set, P_iThe method is characterized in that the method is a text character set and a to-be-hidden text, wherein the difference value of character distances of the ith character of the to-be-hidden text is the text character set, n is the type of the character of the text character set and the to-be-hidden text, and n is a positive integer.

S104: and taking one or more text character sets corresponding to the comprehensive difference values meeting the preset requirements as target character sets.

The preset requirement is not limited, if a difference threshold value can be preset, if the comprehensive difference value of a text string is smaller than the difference threshold value, the text string meets the preset requirement; or selecting the character string with the minimum comprehensive difference value. Different numbers of target character sets can be selected according to different use scenes. The comprehensive difference value of the target character set is small, the difference between the target character set and the text to be hidden is small, and it is difficult to analyze which text is to be hidden.

According to the text information hiding method provided by the embodiment of the application, each character in a text character string is exchanged with other characters according to a preset transposition rule, the difference value between the character distance between the characters before and after the character exchange position and the character distance of the corresponding character in the text to be hidden is calculated for each character, so that the difference degree between each character and the corresponding character of the text to be hidden can be obtained, the comprehensive difference value of the text character set obtained through exchange is further determined, the overall difference degree of the text character set and the text to be hidden can be obtained according to comprehensive judgment of the comprehensive difference value, the difference degree of the finally obtained target character set and the text to be hidden is smaller, which text to be hidden is difficult to analyze is the text to be hidden, and the probability that the text to be hidden in the target character set can be found is extremely low.

Referring to fig. 4, an embodiment of the present application further provides a possible implementation manner, where for each text string, exchanging positions of each character in the text string with other characters according to a preset transposition rule, and calculating a difference value between a character distance between the character before and after the character exchange position and a character distance of a corresponding character in a text to be hidden for each character, including:

s401: for each text string, the character types included in the text string are traversed.

And each text character string can be traversed to obtain the character types included in the text character string.

S402: and calculating the difference value between the character distance between the characters and the character distance of the corresponding character in the text to be hidden aiming at each character of each text character string.

When the position of the characters is not exchanged, the difference value between the character distance between the characters and the character distance of the corresponding character in the text to be hidden is calculated, so that the difference value can be found if the difference value before the characters are exchanged is smaller.

S403: aiming at each character of each text character string, taking the second character of the character as a character to be exchanged, exchanging the position of the character to be exchanged and the character in the preset character distance one by one within the preset character distance of the character to be exchanged, and calculating and recording the difference value between the character distance between the character after each exchange and corresponding to the character to be exchanged and the character distance of the corresponding character in the text to be hidden; taking the next same character next to the character to be exchanged as the character to be exchanged; and when the positions of the characters to be exchanged and the characters within the preset character distance are exchanged one by one, the text to be hidden is regarded as the text character string does not exist.

When the character includes a plurality of characters for each character of each text string, the position of the first character of the character is not exchanged with the positions of other characters. Starting with the second character, the second character of such character is taken as the character to be exchanged. The character distance is preset and can be set according to requirements. Optionally, the preset character distance is 70% -90% of the length of the text character string, so that characters can be sufficiently exchanged, and the text character set obtained after exchange is more similar to the text to be hidden.

When the characters in the preset character distance comprise a plurality of characters, the positions of the characters to be exchanged and the plurality of characters can be exchanged one by one, and each character to be exchanged is exchanged with one character exchange position, so that a text character set can be obtained. And (4) exchanging positions one by one, namely exchanging the characters to be exchanged and each character in the characters to be exchanged, so as to calculate and record the difference value between the character distance between the characters corresponding to the characters to be exchanged and the characters corresponding to the characters in the text to be hidden after each exchange. Specifically, when the characters to be exchanged and the characters within the preset character distance are exchanged one by one, the preset character distance comprises a plurality of un-exchanged characters, the characters to be exchanged and one of the un-exchanged characters are exchanged, the un-exchanged characters at the exchanged position are used as the exchanged characters, the difference value between the character distance between the characters corresponding to the characters to be exchanged and the character distance between the characters corresponding to the characters to be exchanged after each exchange and the character distance between the characters corresponding to the characters to be exchanged and the corresponding characters in the text to be hidden is calculated and recorded, and the positions of the characters to be exchanged are reset; and repeatedly executing the steps of exchanging the character to be exchanged with one of the un-exchanged characters at the position, taking the un-exchanged character at the exchanged position as the exchanged character, calculating and recording the difference value between the character distance between the character corresponding to the character to be exchanged and the character distance of the corresponding character in the text to be hidden after each exchange, and resetting the position of the character to be exchanged until the un-exchanged character is not included in the preset character distance.

If the character to be exchanged is the ith character of one character, taking the (i + 1) th character of the character to be exchanged as the character to be exchanged when the next same character of the character to be exchanged is taken as the character to be exchanged, wherein the ith character of the character is not the character to be exchanged any more. Specifically, if the second character of one character is used as the character to be exchanged, positions of the character to be exchanged are exchanged with all characters within a preset character distance one by one, and after the difference value between the character distance between the character after each exchange and the character corresponding to the character to be exchanged and the character distance of the corresponding character in the text to be hidden is calculated and recorded, the second character completes all position exchange, and the second character does not need to exchange positions with other characters within the preset character distance any more. The next same character next to the second character is the third character of the character. And taking the third character of the character as a character to be exchanged, taking the second character as the character not to be exchanged any more, exchanging the positions of the third character of the character and the characters within a preset character distance one by one, and calculating and recording the difference value between the character distance between the characters corresponding to the characters to be exchanged and the character distance of the corresponding character in the text to be hidden after each exchange.

When the positions of the characters to be exchanged and the characters within the preset character distance are exchanged one by one, the text to be hidden is regarded as the text character string does not exist, so that the sequence of the characters of the text to be hidden is not disturbed; when the difference value between the character distance between the characters corresponding to the characters to be exchanged and the character distance of the corresponding characters in the text to be hidden is calculated and recorded after each exchange, the position and the characters of the text to be hidden need to be considered, so that the actual situation is met.

S404: repeatedly executing each character of each text character string, taking the second character of the character as a character to be exchanged, gradually exchanging the position of the character to be exchanged and the character in the preset character distance within the preset character distance of the character to be exchanged, and calculating and recording the difference value between the character distance between the character corresponding to the character to be exchanged and the character distance of the corresponding character in the text to be hidden after each exchange; and taking the next same kind of character immediately after the character to be exchanged as the character to be exchanged until the same kind of character does not exist behind the character to be exchanged.

The steps are repeatedly executed, and different text character sets can be obtained for each text character string. According to the technical scheme, the character exchange can be more sufficient, so that a more appropriate text character set can be more easily found, namely, a more accurate target character set can be determined.

Referring to fig. 5, a possible implementation manner is further provided in the embodiment of the present application, in which calculating a difference value between a character distance between characters and a character distance of a corresponding character in a text to be hidden includes:

s501: respectively acquiring the number of characters between two adjacent characters in the characters of the text string and the text to be hidden.

For a character, when one character includes a plurality of characters, the number of characters between every two identical characters can be calculated. If the text to be hidden is "I, A, I, A, U, I, A, P, P, I", for the character I, the number of characters between the first and second I is 1, the number of characters between the second and third I is 2, and the number of characters between the third and fourth I is 4.

S502: and respectively determining the character distance between the text character string and the adjacent character in the text to be hidden according to a preset corresponding rule and the number of the characters between two adjacent characters in the character.

The correspondence rule is used to determine the number of characters between two adjacent characters of the same kind of character and the character distance between the two adjacent characters. The rule of correspondence may be: if there is no other character between the two characters, the character distance between the two characters is the first numerical value, and if one character is added between the two characters, the character distance between the two characters is increased by the second numerical value. The first and second values are not limited, and the first and second values may be the same. Such as a first value and a second value both being 1.

When the first numerical value and the second numerical value are both 1, the text to be hidden is "I, A, I, A, U, I, A, P, P, I", and the distances between every two adjacent characters of the character I are 2, 3, and 4, respectively.

S503: the average value and the discrete value of the character distance of the text character string and the character of the text to be hidden are respectively calculated.

The average value is the average value of the distance between every two adjacent characters in the character; the discrete value indicates the degree of dispersion, i.e., the degree of difference, of the distance between every two adjacent characters in such a character. Specifically, the discrete value is a variance or standard deviation of the distance between every two adjacent characters in the character.

For example, the average value of the character distances of the character I is (2+3+ 4)/3-3.

S504: and calculating the difference value of the character distance between the text character string and the character of the text to be hidden according to the average value and the discrete value of the character distance of the character of the text character string and the average value and the discrete value of the character distance of the character of the text to be hidden.

Calculating the difference value of the character distance between the text character string and the character of the text to be hidden according to the following formula:

P＝q1×|μ－μ₀|+q2×|σ－σ₀|，

wherein q1+ q2 is 1, P is the difference value of the character distance of the character, q1 is the weight corresponding to the average value of the character, μ is the average value of the character distance of the character in the text character string, μ₀Is the average value of the character distance of the character in the text to be hidden, q2 is the weight corresponding to the difference value of the character, sigma is the discrete value of the character distance of the character in the text string₀Is a discrete value of the character distance of such a character in the text to be hidden. In particular, μ is the average of the character distances of every two adjacent characters of such a character in the text string, μ₀The average value of the character distances of every two adjacent characters of the character in the text to be hidden is obtained; σ is a discrete value of the character distance of every two adjacent characters of the kind of character in the text string, e.g. may be a standard deviation or variance of the character distances of every two adjacent characters of the kind of character in the text string, σ₀The discrete value of the character distance of every two adjacent characters of the kind of character in the text to be hidden is, for example, the variance or standard deviation of the character distance of every two adjacent characters of the kind of character in the text to be hidden.

The smaller the difference value of the character distance of the character is, the smaller the difference between the character distance of the character of the text string and the character of the text to be hidden is, and the more the text string meets the requirement.

Wherein, the average value and the discrete value are respectively endowed with preset weight values. The weight q1 and the weight q2 are not limited, and q1+ q2 may be 1. Meanwhile, the difference value is determined by using the average value and the discrete value, the determined difference value is more accurate, and a more appropriate target character set can be obtained.

Referring to fig. 6, a possible implementation manner is further provided in the embodiments of the present application, before generating the mimic character set according to the text to be hidden, that is, before acquiring the character type and the number corresponding to each character of the text to be hidden, the method further includes:

s601: and splitting the vocabulary of the original text to obtain a plurality of vocabularies, wherein the original text has semantic information.

The original text has semantic information such as a sentence in chinese, "very cool today's weather". The original text has semantics, and if the original text is directly hidden, the original text is easy to find. The original text is vocabulary-split, for example, by using a word-splitting algorithm, so that a plurality of vocabularies can be obtained, wherein each vocabulary comprises a word or a word. For example, the split of "very cool today's weather" can obtain "very cool today's weather".

S602: the words are randomly arranged to obtain a text to be hidden, and each word is taken as a character.

And randomly arranging the vocabularies to obtain the text to be hidden. For example, after the random arrangement of "today, weather, very, cool" is carried out, the text to be hidden "cool, very, weather, today" can be obtained. It is understood that other text to be hidden is also available, such as "cool, very, weather, today", and the embodiments of the present application are merely illustrative. Wherein each vocabulary is used as a character, and when the character exchange and the character distance calculation are carried out, the calculation is carried out on the basis of each vocabulary.

According to the scheme, the text with the semantics can be split into the text which is to be hidden and is randomly arranged without semantics, namely the text to be hidden, so that the text to be hidden is continuously hidden, the original text with the semantics can be processed and hidden, and the scheme can be suitable for various types of texts.

The embodiment of the present application further provides a possible implementation manner, before one or more of the text character sets corresponding to the comprehensive difference values meeting the preset requirements are used as the target character set, the text information hiding method further includes:

and deleting the text character set corresponding to the continuous characters which repeatedly appear at least twice and exceed the preset length.

When the positions of the characters in the text character string are exchanged, the obtained text character string is named as a text character set. A consecutive character, i.e. an uninterrupted consecutive character, may be "IAAA" if one string is "IAAAOHDIAAA", wherein the consecutive character "IAAA" appears twice. The preset length is not limited, and the preset length may be a preset proportion of the text to be hidden, for example, the number of the continuous characters including the characters is 70% -90% of the number of the characters of the text to be hidden.

The text character set corresponding to the continuous characters which repeatedly appear at least twice and exceed the preset length is deleted, so that the texts with excessively long and repeated characters can be deleted, the rules among the characters are prevented from being found, and the probability of finding the texts to be hidden is further prevented.

When the text to be hidden is hidden, the target character set and the position of the text to be hidden when the text to be hidden is hidden can be obtained, and the text to be hidden can be obtained according to the target character set and the position of the text to be hidden when the text to be hidden is hidden. And when the text to be hidden is the original text with semantics, obtaining the original text according to the record which is randomly disturbed and the text to be hidden.

Referring to fig. 7, a possible implementation manner is further provided in the embodiment of the present application, where the method of the present application is applied to a first electronic device, a first trust list may be preset in the first electronic device, and after one or more text character sets corresponding to the comprehensive difference values meeting preset requirements are taken as target character sets, the text information hiding method may further include:

s701: sending a communication request to second electronic equipment, wherein the communication request comprises identity information, so that the second electronic equipment verifies whether the identity information is located in a second trust list preset by the second electronic equipment; if so, establishing communication connection with the first electronic equipment; if not, not establishing communication connection with the first electronic equipment;

the terminal or the server applied in the embodiment of the application may be referred to as a first electronic device. Identity information of one or more second electronic devices is preset in the first trust list. The specific type of the identity information is not limited, and may be, for example, a MAC Address (Media Access Control Address) or a CA (Certificate Authority) identifier of the second electronic device. When the communication request is sent to the electronic device, the communication request may be sent to a second electronic device corresponding to one or more identity information in a preset first trust list.

The second electronic device may be a terminal or a server. Identity information of one or more electronic devices is also included in the second trust list. The first electronic device and the second electronic device communicate with each other, and the communication mode is not limited, and the communication can be established through a wired network or a wireless network.

S702: and after the second electronic equipment establishes communication connection with the first electronic equipment, sending the target character set to the second electronic equipment.

According to the technical scheme of the embodiment, whether the connection is established or not is determined in a mode of identity information in the communication request and a second trust list in advance, so that objects which can be connected by the electronic equipment are limited, the safety communication between the electronic equipment is increased, and the possibility that the electronic equipment reveals private data is reduced.

In the application, when the first electronic device sends information to the second electronic device through the channel, the information is sent in a target character set form, even if part or all of the target character set is illegally intercepted, an illegal interceptor cannot know which information in the target character set really needs to be transmitted, and the information safety is further ensured.

And after the second electronic equipment receives the target character set, the text to be hidden in the target character set can be restored. The amount of information required for restoring the text to be hidden is small, for example, only the position, the length, the arrangement sequence and the like of the text to be hidden in the target character set are provided, and a safer mode can be adopted, for example, a user of the first electronic device calls to inform the user of the second electronic device of relevant information, so that the high safety of the text to be hidden is ensured.

Referring to fig. 8, an embodiment of the present application provides a text information hiding apparatus 80, where the text information hiding apparatus 80 may include:

a hiding module 801, configured to sequentially insert a text to be hidden into any one of M +1 positions determined by M second characters in a preset random character set to obtain M +1 text character strings, where the text to be hidden includes a plurality of unordered first characters, the first characters include N characters, M and N are positive integers, and the random character set includes M second characters corresponding to each of the N characters by a preset multiple;

a transposition calculation module 802, configured to, for each text string, exchange positions of each character in the text string with other characters according to a preset transposition rule, and calculate, for each character, a difference value between a character distance between the character before and after the character exchange position and a character distance of a corresponding character in the text to be hidden;

a difference calculating module 803, configured to calculate, for each character of each text string, a comprehensive difference value of different text character sets obtained before and after the character exchange position according to a difference value between a character distance between the character before and after the character exchange position and a character distance of a corresponding character in the text to be hidden;

and a character set determining module 804, configured to use one or more of the text character set sets corresponding to the comprehensive difference values meeting the preset requirements as a target character set.

The embodiment of the application provides a text information hiding device, according to preset transposition rules, each character in a text character string is exchanged with other characters, and aiming at each character, the difference value between the character distance between the characters before and after the character exchange position and the character distance of the corresponding character in the text to be hidden is calculated, so that the difference degree of each character and the corresponding character of the text to be hidden can be obtained, the comprehensive difference value of the text character set obtained through exchange is further determined, the integral difference degree of the text character set and the text to be hidden can be obtained according to comprehensive judgment of the comprehensive difference value, so that the difference degree of the finally obtained target character set and the text to be hidden is smaller, which text to be hidden is difficult to analyze is the text to be hidden, and the probability that the text to be hidden in the target character set can be discovered is extremely low.

Optionally, the text information hiding device 80 may further include:

the character set generating module is used for generating an imitation character set according to the text to be hidden, the imitation character set comprises M second characters which are corresponding to each character of the N characters of the text to be hidden by preset times, and the character type of the imitation character set is the same as or similar to that of the text to be hidden;

and the random module is used for randomly arranging the second characters in the imitation character set to generate random characters.

Optionally, the transposition calculation module 802 may include:

the traversal unit is used for traversing character types included in the text character strings aiming at each type of text character strings;

the difference calculation unit is used for calculating the difference value between the character distance between the characters and the character distance of the corresponding character in the text to be hidden aiming at each character of each text character string;

the transposition calculation unit is used for taking the second character of each character as a character to be exchanged aiming at each character of each text character string, exchanging the position of the character to be exchanged and the position of the character in the preset character distance one by one within the preset character distance of the character to be exchanged, and calculating and recording the difference value between the character distance between the character corresponding to the character to be exchanged and the character distance of the corresponding character in the text to be hidden after each exchange; taking the next same character next to the character to be exchanged as the character to be exchanged; when the positions of the characters to be exchanged and the characters within the preset character distance are exchanged one by one, the text to be hidden is regarded as the text character string does not exist;

the repeating unit is used for repeatedly executing each character of each text character string, taking the second character of the character as a character to be exchanged, exchanging the position of the character to be exchanged and the character in the preset character distance one by one in the preset character distance of the character to be exchanged, and calculating and recording the difference value between the character distance between the character corresponding to the character to be exchanged and the character distance of the corresponding character in the text to be hidden after each exchange; and taking the next same kind of character immediately after the character to be exchanged as the character to be exchanged until the same kind of character does not exist behind the character to be exchanged.

Alternatively, the difference calculation unit may include:

the quantity acquiring unit is used for respectively acquiring the quantity of characters between two adjacent characters in the characters of the text string and the text to be hidden;

the distance determining unit is used for respectively determining the character distance between adjacent characters in the text character string and the character to be hidden in the text according to a preset corresponding rule and the number of characters between two adjacent characters in the character;

the calculation unit is used for respectively calculating the average value and the discrete value of the character distance of the character of the text string and the text to be hidden;

and the difference value calculating unit is used for calculating the difference value of the character distance of the characters of the text character string and the text to be hidden according to the average value and the discrete value of the character distance of the characters of the text character string and the average value and the discrete value of the character distance of the characters of the text to be hidden.

Optionally, the character set generating module may include:

the device comprises a character number acquisition unit, a character hiding unit and a character hiding unit, wherein the character number acquisition unit is used for acquiring the character type of a text to be hidden and the number corresponding to each character;

the character acquisition unit is used for acquiring the same or similar characters of preset multiples of the number corresponding to each character;

and the character set generating unit is used for generating a simulation character set according to the same or similar characters which are the preset multiple of the number corresponding to each character.

Optionally, the text information hiding device 80 may further include:

the splitting module is used for splitting the vocabulary of the original text to obtain a plurality of vocabularies, and the original text has semantic information;

and the arrangement module is used for randomly arranging the vocabularies to obtain the text to be hidden and taking each vocabulary as a character.

Optionally, the text information hiding device 80 may further include:

Optionally, the text information hiding device 80 further includes:

the request sending module is used for sending a communication request to the second electronic equipment, wherein the communication request comprises identity information, so that the second electronic equipment can verify whether the identity information is located in a second trust list preset by the second electronic equipment; if so, establishing communication connection with the first electronic equipment; if not, not establishing communication connection with the first electronic equipment;

and the character set sending module is used for sending the target character set to the second electronic equipment after the second electronic equipment establishes communication connection with the first electronic equipment.

Referring to fig. 9, in an alternative embodiment, an electronic device is provided, an electronic device 9000 comprising: a processor 9001 and a memory 9003. Among other things, the processor 9001 and memory 9003 are coupled, such as via a bus 9002. Optionally, the electronic device 9000 can also include a transceiver 9004. Note that the transceiver 9004 is not limited to one in practical use, and the structure of the electronic device 9000 is not limited to the embodiment of the present application.

The Processor 9001 may be a CPU (Central Processing Unit), a general purpose Processor, a DSP (Digital Signal Processor), an ASIC (Application Specific Integrated Circuit), an FPGA (Field Programmable Gate Array), or other Programmable logic device, transistor logic, hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor 9001 may also be a combination of computing functions, e.g., comprising one or more microprocessors, a combination of DSPs and microprocessors, or the like.

The bus 9002 may include a pathway to transfer information between the aforementioned components. The bus 9002 may be a PCI (Peripheral Component Interconnect) bus, an EISA (Extended Industry Standard Architecture) bus, or the like. The bus 9002 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.

The Memory 9003 may be a ROM (Read Only Memory) or other types of static storage devices that may store static information and instructions, a RAM (Random Access Memory) or other types of dynamic storage devices that may store information and instructions, an EEPROM (Electrically Erasable Programmable Read Only Memory), a CD-ROM (Compact Disc Read Only Memory) or other optical Disc storage, optical Disc storage (including Compact Disc, laser Disc, optical Disc, digital versatile Disc, blu-ray Disc, etc.), a magnetic disk storage medium or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to these.

The memory 9003 is used to store program code for performing aspects of the present application and is controlled by the processor 9001 for execution. The processor 9001 is operative to execute program code stored in the memory 9003 to implement what is shown in the foregoing method embodiments.

Among them, electronic devices include but are not limited to: a terminal and a server.

An embodiment of the present application provides an electronic device, including: a memory and a processor; at least one program stored in the memory for execution by the processor to implement the corresponding aspects of the foregoing method embodiments, compared with the prior art, can implement: according to a preset transposition rule, exchanging positions of each character in a text character string with other characters, calculating a difference value between a character distance between the characters before and after the character exchange position and a character distance of a corresponding character in a text to be hidden aiming at each character, so that the difference degree between each character and the corresponding character of the text to be hidden can be obtained and further the comprehensive difference value of the text character set obtained by exchanging is determined, and the integral difference degree between the text character set and the text to be hidden can be obtained by comprehensively judging according to the comprehensive difference value, so that the difference degree between a target character set and the text to be hidden finally obtained is small, which is the text to be hidden is difficult to analyze, and the probability of finding the text to be hidden in the target character set is extremely low.

The present application provides a storage medium, which is a computer-readable storage medium, and a computer program is stored on the computer-readable storage medium, and when the computer program runs on a computer, the computer is enabled to execute the corresponding content in the foregoing method embodiments. Compared with the prior art, according to a preset transposition rule, each character in a text character string is exchanged with other characters, the difference value between the character distance between the characters before and after the character exchange position and the character distance of the corresponding character in the text to be hidden is calculated for each character, so that the difference degree between each character and the corresponding character of the text to be hidden can be determined, the comprehensive difference value of the text character set obtained through exchange is further determined, the overall difference degree between the text character set and the text to be hidden can be obtained through comprehensive judgment according to the comprehensive difference value, the difference degree between the finally obtained target character set and the text to be hidden is small, which text to be hidden is difficult to analyze, and the probability that the text to be hidden in the target character set can be found is extremely low.

It should be understood that, although the steps in the flowcharts of the figures are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and may be performed in other orders unless explicitly stated herein. Moreover, at least a portion of the steps in the flow chart of the figure may include multiple sub-steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, which are not necessarily performed in sequence, but may be performed alternately or alternately with other steps or at least a portion of the sub-steps or stages of other steps.

The foregoing is only a partial embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and decorations can be made without departing from the principle of the present invention, and these modifications and decorations should also be regarded as the protection scope of the present invention.

Claims

1. A method for hiding text information, the method comprising:

generating a random character set according to a text to be hidden, wherein the character type of the random character set is the same as or similar to the character type of the text to be hidden;

inserting the text to be hidden into any one of M +1 positions determined by M second characters in the random character set to obtain M +1 text character strings, wherein the text to be hidden comprises a plurality of unordered first characters, the first characters comprise N characters, M and N are positive integers, and the random character set comprises M second characters which are corresponding to each character in the N characters and are in preset multiples;

for each text character string, exchanging each character in the text character string with other characters according to a preset transposition rule, and calculating a difference value between a character distance between the character before and after the character exchange position and a character distance between corresponding characters in the text to be hidden for each character;

for each character of each text character string, calculating to obtain a comprehensive difference value of different text character sets obtained before and after the character exchange position according to a difference value between a character distance between the character before and after the character exchange position and a character distance between corresponding characters in the text to be hidden;

and taking one or more text character sets corresponding to the comprehensive difference values meeting the preset requirements as target character sets.

2. The method according to claim 1, wherein the generating a random character set according to the text to be hidden comprises:

acquiring the character type and the number corresponding to each character of the text to be hidden;

acquiring the same or similar characters of preset multiples of the number corresponding to each character;

generating a simulation character set according to the same or similar characters of preset multiples of the number corresponding to each character;

randomly arranging second characters in the mimic character set to generate the random character set.

3. The method according to claim 1, wherein for each text string, exchanging positions of each character in the text string with other characters according to a preset transposition rule, and for each character, calculating a difference value between a character distance between the character before and after the character exchange position and a character distance between corresponding characters in the text to be hidden, comprises:

for each text character string, traversing character types included in the text character string;

calculating a difference value between a character distance between the characters and a character distance between corresponding characters in the text to be hidden aiming at each character of each text character string;

for each text character string, taking the second character of the character as a character to be exchanged, gradually exchanging the position of the character to be exchanged with the character in the preset character distance of the character to be exchanged within the preset character distance, and calculating and recording the difference value between the character distance corresponding to the character to be exchanged and the character distance between the corresponding characters in the text to be hidden after each exchange; taking the next same kind of character next to the character to be exchanged as the character to be exchanged; when the positions of the characters to be exchanged and the characters within the preset character distance are exchanged one by one, the text to be hidden is regarded as the text character string does not exist;

repeatedly executing each text character string, taking the second character of the character as a character to be exchanged, gradually exchanging the position of the character to be exchanged and the character in the preset character distance within the preset character distance of the character to be exchanged, and calculating and recording the difference value between the character distance corresponding to the character to be exchanged and the character distance between the corresponding characters in the text to be hidden after each exchange; and taking the next same kind of character next to the character to be exchanged as the character to be exchanged until the same kind of character does not exist behind the character to be exchanged.

4. The method according to claim 3, wherein said calculating a difference between a character distance between such characters and a character distance between corresponding characters in the text to be hidden comprises:

respectively acquiring the number of characters between two adjacent characters in the text character string and the characters of the text to be hidden;

respectively determining the character distance between the text character string and the adjacent character in the text to be hidden according to a preset corresponding rule and the number of characters between two adjacent characters in the character;

respectively calculating the average value and the discrete value of the character distance of the character of the text string and the text to be hidden;

and calculating the difference value of the character distance between the text character string and the character of the text to be hidden according to the average value and the discrete value of the character distance of the character of the text character string and the average value and the discrete value of the character distance of the character of the text to be hidden.

5. The method according to claim 4, wherein the difference between the character distance of the character of the text string and the character of the text to be hidden is calculated according to the following formula:

P＝q1×|μ－μ₀|+q2×|σ－σ₀|，

wherein q1+ q2 is 1, P is the difference value of the character distance of the character, q1 is the weight corresponding to the average value of the character, μ is the average value of the character distance of the character in the text character string, and μ is₀The character distance of the character in the text to be hidden is an average value, q2 is a weight corresponding to a difference value of the character, σ is a discrete value of the character distance of the character in the text character string, and σ is a weight corresponding to the difference value of the character in the text character string₀The discrete value of the character distance of the character in the text to be hidden.

6. The method according to claim 1, wherein for each character of each text string, a comprehensive difference value of different text character sets obtained before and after the character exchange position is calculated according to a difference value between a character distance between the character before and after the character exchange position and a character distance between corresponding characters in the text to be hidden according to the following formula:

wherein S is the comprehensive difference value of the text character set, and P is_iAnd the character distance difference value is the difference value of the ith character of the text character set and the text to be hidden.

7. The method according to claim 2, wherein before the obtaining of the character type and the number corresponding to each character of the text to be hidden, the method further comprises:

carrying out vocabulary splitting on an original text to obtain a plurality of vocabularies, wherein the original text has semantic information;

and randomly arranging the vocabularies to obtain a text to be hidden, and taking each vocabulary as a character.

8. A text information hiding apparatus, comprising:

the device comprises a character set generating module and a random module, wherein the character set generating module is used for generating a random character set according to a text to be hidden, and the character type of the random character set is the same as or similar to that of the text to be hidden;

a hiding module, configured to insert the text to be hidden into any one of M +1 positions determined by M second characters in the random character set, so as to obtain M +1 text character strings, where the text to be hidden includes a plurality of unordered first characters, the first characters include N characters, M and N are positive integers, and the random character set includes M second characters corresponding to each of the N characters by a preset multiple;

the transposition calculation module is used for exchanging each character in the text character string with other characters according to a preset transposition rule aiming at each text character string, and calculating a difference value between a character distance between the characters before and after the character exchange position and a character distance between corresponding characters in the text to be hidden aiming at each character;

the difference calculation module is used for calculating to obtain a comprehensive difference value of different text character sets obtained before and after the character exchange position according to the difference value between the character distance between the characters before and after the character exchange position and the character distance between the corresponding characters in the text to be hidden aiming at each character of each text character string;

and the character set determining module is used for taking one or more of the text character sets corresponding to the comprehensive difference values meeting the preset requirements as target character sets.

9. An electronic device, comprising:

one or more processors;

a memory;

one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs configured to: executing the method of hiding textual information according to any of claims 1 to 7.

10. A storage medium, which is a computer-readable storage medium, on which a computer program is stored, wherein the program, when executed by a processor, implements the text information hiding method according to any one of claims 1 to 7.