CN110418029A - Text secret information based on Unicode coding hides and extracting method - Google Patents
Text secret information based on Unicode coding hides and extracting method Download PDFInfo
- Publication number
- CN110418029A CN110418029A CN201910591575.8A CN201910591575A CN110418029A CN 110418029 A CN110418029 A CN 110418029A CN 201910591575 A CN201910591575 A CN 201910591575A CN 110418029 A CN110418029 A CN 110418029A
- Authority
- CN
- China
- Prior art keywords
- secret information
- string
- binary
- key
- text
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000003079 width control Methods 0.000 claims abstract description 8
- 238000004364 calculation method Methods 0.000 claims description 9
- 238000004422 calculation algorithm Methods 0.000 claims description 7
- 238000000605 extraction Methods 0.000 claims description 6
- 230000005540 biological transmission Effects 0.000 abstract description 4
- 238000005516 engineering process Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 2
- 238000007620 mathematical function Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
- H04L63/0435—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload wherein the sending and receiving network entities apply symmetric encryption, i.e. same key used for encryption and decryption
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/44—Secrecy systems
- H04N1/4446—Hiding of documents or document information
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Multimedia (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses it is a kind of based on Unicode coding text secret information hide and extracting method.This method are as follows: each character of secret information is replaced with string of binary characters using Godel function coding by sender first, obtain sender's symmetric key, combination is before secret information string of binary characters, hash encryption is carried out to secret information string of binary characters based on sender's symmetric key, the rule for hashing encrypted secret information string of binary characters setting is replaced with into zero width control character of Unicode, invisible character string is formed, and is embedded in front of cover text；Then recipient detects zero width character string in carrier text, according to the rule reduction string of binary characters of setting, obtains recipient's key, carries out Hash decoding based on recipient's key pair string of binary characters；Godel function decoding is finally authenticated and carried out, secret information is exported.The present invention improves the transmission security and secret protection ability of text secret information.
Description
Technical Field
The invention belongs to the technical field of information hiding, and particularly relates to a text secret information hiding and extracting method based on Unicode coding.
Background
Information hiding technology is a technology of embedding secret information, such as sensitive information that needs to be hidden, in original data. The information hiding technology can not only be detected and extracted, but also prevent network and text attacks. Information hiding techniques include embedding and extraction of hidden information. In the embedding stage, it is first necessary to generate a string containing information to be hidden (such as author name, publisher or sensitive information), and then generate an invisible string according to a corresponding algorithm and embed it in a specific position in the text of the cover, as in document 1(m.pal. a cover on digital water marking and editing [ J ]. International Journal of Advanced Computer Science and Applications,2016,7(1): 153-. The text embedded with the secret information is transmitted and shared in the Internet, and when the secret information of the text needs to be acquired, the secret information can be detected and extracted. After the sensitive information is embedded and before it is extracted, the hidden secret information should be able to withstand various attacks.
In order to solve the problems of text hiding and disguising, some text watermark research technologies related to Unicode encoding are proposed by researchers. For example, document 2(l.y.por, k.wong, k.o.chee, "a text-based data hiding method using Unicode computers", The Journal of Systems and Software,2012, vol.85, No.5, pp.1075-1082.Doi:10.1016/j.jss.2011.12.023.) proposes a data hiding method named UniSpaCh in 2012, which uses a special space encoded by Unicode to hide secret information in Word. This method of hiding the secret information using a combination of a specific position and a double space has the advantage of making full use of the combination of spaces and therefore providing a higher embedding capacity. This approach creates some special blanks in the cover text and is vulnerable to tampering and reformatting type attacks.
The current text hiding technology has three defects: firstly, the embedding capacity of the text secret information is not high, secondly, the robustness of the secret information for resisting attacks is low, thirdly, the structure and even the content of the text can be influenced by the secret information, and the problems that the attacker notices can be caused because some technologies do not have good transparency.
Disclosure of Invention
The invention aims to provide a text secret information hiding and extracting method based on Unicode coding, which can guarantee secret information transmission in social media, so that end-to-end safety guarantee is brought to short messages and social media users.
The technical solution for realizing the purpose of the invention is as follows: a text secret information hiding and extracting method based on Unicode encoding comprises the following steps:
step 1, a sender replaces each character of secret information with a binary character string by using Godel function coding;
step 2, obtaining a symmetric key of a sender, and combining the symmetric key of the sender in front of the binary string of the secret information;
step 3, carrying out hash encryption on the secret information binary character string based on the symmetric key of the sender;
step 4, replacing the binary character string of the hashed and encrypted secret information with a Unicode zero-width control character according to a set rule to form an invisible character string and embedding the invisible character string in front of a cover text;
step 5, the receiving party detects the zero-width character string in the carrier text and restores the binary character string according to a set rule;
step 6, acquiring a key of a receiver;
step 7, carrying out hash decoding on the binary string based on the key of the receiving party;
and 8, authenticating, decoding the Godel function, and outputting the secret information.
Further, the sending party in step 1 replaces each character of the secret information with a binary string by using the goldel function encoding, which is as follows:
step 1.1, setting η to any given number, there is a unique solution < α, β >, let η be the ASCII code of the alphabet, then < α, β > is the unique number pair per character of SM:
<α,β>＝2α(2β+1)-1 (1)
and 2 isα(2β+1)≠0
Wherein,is a natural number, existsSo that 2α×k＝η+1；
In the equation (2), the process is carried out,is odd;
the embedding algorithm calculates the < α, β > pair for each character of the secret information using equations (2) and (3);
step 1.2, respectively converting alpha and beta into 6-bit binary character strings, connecting the 6-bit binary character strings together, and generating a 12-bit binary character string for each letter;
and 1.3, splicing the binary character strings of each letter together to form the binary character string of the secret information.
Further, the obtaining of the symmetric key of the sender in step 2 is combined in front of the secret information binary string, specifically as follows:
step 2.1, the hash function takes the sending time, namely the time for generating the hidden information, as a sender secret key, and omits the 4 th bit of the time;
step 2.2, create a number and convert the number into an 8-bit binary string, i.e. the sender key, which is combined before the secret information binary string.
Further, the step 3 of hash-encrypting the binary string of the secret information based on the symmetric key of the sender specifically includes:
step 3.1, the hash function repeats NC times copying the key binary string to form a hash position, and the NC calculation formula is as follows:
wherein LS is the length of the secret information and the unit is character; LSK is the length of the binary string of the key, and the unit is bit;
and 3.2, generating a hashed secret information binary character string by the hash function according to the hash position bit or the secret information binary character string.
Further, the step 4 of replacing the hashed and encrypted secret information binary character string with Unicode zero-width control characters by using a set rule is as follows:
each consecutive 2 bits of the binary string are divided into one small group, and "00", "01", "10", "11" in each small group are replaced with "0 x 200C", "0 x 202C", "0 x 202D", "0 x 200E", respectively, to form an invisible string.
Further, the receiving party in step 5 detects the zero-width character string in the carrier text, and restores the binary character string according to the set rule, which is specifically as follows:
the receiver detects the zero-width character string in the carrier text, and restores the binary character string according to the rule of "0 x 200C", "0 x 202C", "0 x 202D" and "0 x 200E" corresponding to "00", "01", "10" and "11".
Further, the acquiring of the receiver key in step 6 specifically includes the following steps:
step 6.1, the hash function takes the receiving time as a key of a receiving party and omits the 4 th bit of the time;
step 6.2, create a number and convert it into an 8-bit binary string, i.e. the receiver key.
Further, the hash decoding of the binary string based on the key pair of the receiving party in step 7 is specifically as follows:
and (4) calculating NC according to a formula (4), copying the NC-time key binary character string to form a hash bit, and performing exclusive-OR calculation on the hash bit and the secret information binary character string to be decrypted.
Further, the authentication and the goldel function decoding in step 8 output secret information, which is specifically as follows:
comparing whether the decoded key of the sender is the same as the key of the receiver, if so, performing Godel function decoding on the binary string of the secret information, and then outputting the secret information; and if the two are different, prompting that the secret information extraction fails.
Compared with the prior art, the invention has the following remarkable advantages: (1) a large number of secret messages can be hidden in the short cover message, and the embedded information is invisible, so that the confidentiality of the secret information is improved; (2) by intelligent double encoding and encryption of the secret information, the transmission safety and convenience of the text secret information are improved; (3) the mathematical function coding and the symmetric key encryption algorithm are combined, and the character strings generated at different time after the encryption of the secret information are different, so that various network attacks can be resisted.
Drawings
FIG. 1 is a flow chart diagram of a text secret information hiding and extracting method based on Unicode encoding according to the invention.
Fig. 2 is a view of a text information hiding application scenario of the present invention.
Fig. 3 is a schematic flow chart of hiding text secret information in the embodiment of the present invention.
Detailed Description
With reference to fig. 1, the method for hiding and extracting text secret information based on Unicode encoding of the present invention includes the following steps:
step 1, a sender replaces each character of secret information with a binary character string by using Godel function coding;
step 2, obtaining a symmetric key of a sender, and combining the symmetric key of the sender in front of the binary string of the secret information;
step 3, carrying out hash encryption on the secret information binary character string based on the symmetric key of the sender;
step 4, replacing the binary character string of the hashed and encrypted secret information with a Unicode zero-width control character according to a set rule to form an invisible character string and embedding the invisible character string in front of a cover text;
step 5, the receiving party detects the zero-width character string in the carrier text and restores the binary character string according to a set rule;
step 6, acquiring a key of a receiver;
step 7, carrying out hash decoding on the binary string based on the key of the receiving party;
and 8, authenticating, decoding the Godel function, and outputting the secret information.
Further, the sending party in step 1 replaces each character of the secret information with a binary string by using the goldel function encoding, which is as follows:
step 1.1, setting η to any given number, there is a unique solution < α, β >, let η be the ASCII code of the alphabet, then < α, β > is the unique number pair per character of SM:
<α,β>＝2α(2β+1)-1 (1)
and 2 isα(2β+1)≠0
Wherein,is a natural number, existsSo that 2α×k＝η+1。
In the equation (2), the process is carried out,is odd;
the embedding algorithm calculates the < α, β > pair for each character of the secret information using equations (2) and (3);
step 1.2, respectively converting alpha and beta into 6-bit binary character strings, connecting the 6-bit binary character strings together, and generating a 12-bit binary character string for each letter;
and 1.3, splicing the binary character strings of each letter together to form the binary character string of the secret information.
Further, the obtaining of the symmetric key of the sender in step 2 is combined in front of the secret information binary string, specifically as follows:
step 2.1, the hash function takes the sending time, namely the time for generating the hidden information, as a sender secret key, and omits the 4 th bit of the time;
step 2.2, create a number and convert the number into an 8-bit binary string, i.e. the sender key, which is combined before the secret information binary string.
Further, the step 3 of hash-encrypting the binary string of the secret information based on the symmetric key of the sender specifically includes:
step 3.1, the hash function repeats NC times copying the key binary string to form a hash position, and the NC calculation formula is as follows:
wherein LS is the length of the secret information and the unit is character; LSK is the length of the binary string of the key, and the unit is bit;
and 3.2, generating a hashed secret information binary character string by the hash function according to the hash position bit or the secret information binary character string.
Further, the step 4 of replacing the hashed and encrypted secret information binary character string with Unicode zero-width control characters by using a set rule is as follows:
each consecutive 2 bits of the binary string are divided into one small group, and "00", "01", "10", "11" in each small group are replaced with "0 x 200C", "0 x 202C", "0 x 202D", "0 x 200E", respectively, to form an invisible string.
Further, the receiving party in step 5 detects the zero-width character string in the carrier text, and restores the binary character string according to the set rule, which is specifically as follows:
the receiver detects the zero-width character string in the carrier text, and restores the binary character string according to the rule of "0 x 200C", "0 x 202C", "0 x 202D" and "0 x 200E" corresponding to "00", "01", "10" and "11".
Further, the acquiring of the receiver key in step 6 specifically includes the following steps:
step 6.1, the hash function takes the receiving time as a key of a receiving party and omits the 4 th bit of the time;
step 6.2, create a number and convert it into an 8-bit binary string, i.e. the receiver key.
Further, the hash decoding of the binary string based on the key pair of the receiving party in step 7 is specifically as follows:
and (4) calculating NC according to a formula (4), copying the NC-time key binary character string to form a hash bit, and performing exclusive-OR calculation on the hash bit and the secret information binary character string to be decrypted.
Further, the authentication and the goldel function decoding in step 8 output secret information, which is specifically as follows:
comparing whether the decoded key of the sender is the same as the key of the receiver, if so, performing Godel function decoding on the binary string of the secret information, and then outputting the secret information; and if the two are different, prompting that the secret information extraction fails.
The present invention will be described in detail with reference to examples.
Examples
The specific scene diagram for embedding, detecting and extracting the hidden information of the text is shown in fig. 2, wherein SM represents secret information, CM represents cover text, key is a key, and CM represents secret informationHMFor the text with the secret information, firstly, a sender inputs a cover text and the secret information, after the secret information is processed, the hidden secret information is embedded in the cover text, and then the carrier text with the hidden information is transmitted to a receiver through a social media or a short message; the receiving party transmitsEntering a carrier text to be detected, performing first-layer decryption by using a secret key, then performing comparison secret key authentication, outputting secret information if the authentication is successful, otherwise prompting that secret extraction fails, and combining the flow chart of fig. 1, specifically comprising the following steps:
step 1, a sender replaces each character of secret information with a binary character string by using Godel function coding, which specifically comprises the following steps:
step 1.1, setting η to any given number, there is a unique solution < α, β >, let η be the ASCII code of the alphabet, then < α, β > is the unique number pair per character of SM:
<α,β>＝2α(2β+1)-1 (1)
and is
In the equation (2), the process is carried out,is odd;
the embedding algorithm calculates the < α, β > pair for each character of the secret information using equations (2) and (3);
for example, the ASCII code for "z" is 122, i.e., η 122, and first, the calculation is performedTo obtain a:
step 1.2, respectively converting alpha and beta into 6-bit binary character strings, connecting the 6-bit binary character strings together, and generating a 12-bit binary character string for each letter;
and 1.3, splicing the binary character strings of each letter together to form the binary character string of the secret information.
Step 2, obtaining a symmetric key of a sender, and combining the symmetric key in front of the secret information binary character string, wherein the method specifically comprises the following steps:
step 2.1, the hash function takes the sending time, namely the time for generating the hidden information, as a sender secret key, such as 10:12, and omits the 4 th bit of the time;
step 2.2, a number, e.g. "101", is created and converted into an 8-bit binary string, i.e. the sender key, which is combined before the secret information binary string.
Step 3, carrying out hash encryption on the secret information binary character string based on the symmetric key of the sender, which comprises the following specific steps:
step 3.1, the hash function repeats NC times copying the key binary string to form a hash position, and the NC calculation formula is as follows:
wherein LS is the length of the secret information and the unit is character; LSK is the length of the binary string of the key, and the unit is bit;
and 3.2, generating a hashed secret information binary character string by the hash function according to the hash position bit or the secret information binary character string.
And 4, replacing the binary character string of the hashed and encrypted secret information with a Unicode zero-width control character according to a set rule to form an invisible character string and embedding the invisible character string in front of a cover text, wherein the method specifically comprises the following steps:
in connection with the text secret information hiding example of fig. 3, each consecutive 2 bits of the binary string are divided into a small group, and "00", "01", "10", "11" in each small group are respectively replaced with "0 x 200C", "0 x 202C", "0 x 202D", "0 x 200E", and the alternatives are shown in table 1:
TABLE 1 Unicode zero width character table and alternatives
Step 5, the receiver detects the zero-width character string in the carrier text, and restores the binary character string according to the set rule, which is as follows: detecting zero-width character strings in the carrier text, and restoring binary character strings according to the rules of '0 x 200C', '0 x 202C', '0 x 202D' and '0 x 200E' corresponding to '00', '01', '10' and '11'.
Step 6, acquiring a receiver key, specifically as follows:
step 6.1, the hash function takes the receiving time as a receiving party key, such as 10:12, and omits the 4 th bit of the time;
step 6.2, create a number, e.g. "101", which is converted into an 8-bit binary string, i.e. the receiver key.
Step 7, performing hash decoding on the binary string based on the receiver key, which is specifically as follows:
and (4) calculating NC according to the formula (4), copying the NC time key binary character string to form a scattered bit, and carrying out exclusive OR calculation on the scattered bit and the secret information binary character string to be decrypted.
And 8, authenticating, decoding the Godel function, and outputting secret information, wherein the secret information comprises the following specific steps:
comparing whether the decoded key of the sender is the same as the key of the receiver, if so, performing Godel function decoding on the binary string of the secret information, and then outputting the secret information; and if the two are different, prompting that the secret information extraction fails.
The invention can hide a large amount of confidential information in the short cover message, and the embedded information is invisible, thus improving the confidentiality of the confidential information; by intelligent double encoding and encryption of the secret information, the transmission safety and convenience of the text secret information are improved; the mathematical function coding and the symmetric key encryption algorithm are combined, and the character strings generated at different time after the encryption of the secret information are different, so that various network attacks can be resisted.
Claims (9)
1. A text secret information hiding and extracting method based on Unicode coding is characterized by comprising the following steps:
step 1, a sender replaces each character of secret information with a binary character string by using Godel function coding;
step 2, obtaining a symmetric key of a sender, and combining the symmetric key of the sender in front of the binary string of the secret information;
step 3, carrying out hash encryption on the secret information binary character string based on the symmetric key of the sender;
step 4, replacing the binary character string of the hashed and encrypted secret information with a Unicode zero-width control character according to a set rule to form an invisible character string and embedding the invisible character string in front of a cover text;
step 5, the receiving party detects the zero-width character string in the carrier text and restores the binary character string according to a set rule;
step 6, acquiring a key of a receiver;
step 7, carrying out hash decoding on the binary string based on the key of the receiving party;
and 8, authenticating, decoding the Godel function, and outputting the secret information.
2. The method for hiding and extracting text secret information based on Unicode encoding as claimed in claim 1, wherein the sender in step 1 replaces each character of the secret information with a binary string by using Godel function encoding, specifically as follows:
step 1.1, setting η to any given number, there is a unique solution < α, β >, let η be the ASCII code of the alphabet, then < α, β > is the unique number pair per character of SM:
<α，β>＝2α(2β+1)-1 (1)
and 2 isα(2β+1)≠0
Where N is a natural number, there is k ∈ N, such that 2α×k＝η+1；
In the equation (2), the process is carried out,is odd;
the embedding algorithm calculates the < α, β > pair for each character of the secret information using equations (2) and (3);
step 1.2, respectively converting alpha and beta into 6-bit binary character strings, connecting the 6-bit binary character strings together, and generating a 12-bit binary character string for each letter;
and 1.3, splicing the binary character strings of each letter together to form the binary character string of the secret information.
3. The method for hiding and extracting text secret information based on Unicode encoding of claim 1, wherein the step 2 of obtaining the symmetric key of the sender is combined in front of the binary string of the secret information, specifically as follows:
step 2.1, the hash function takes the sending time, namely the time for generating the hidden information, as a sender secret key, and omits the 4 th bit of the time;
step 2.2, create a number and convert the number into an 8-bit binary string, i.e. the sender key, which is combined before the secret information binary string.
4. The method for hiding and extracting text secret information based on Unicode encoding of claim 1, wherein the step 3 hash-encrypts the binary string of secret information based on the symmetric key of the sender as follows:
step 3.1, the hash function repeats NC times copying the key binary string to form a hash position, and the NC calculation formula is as follows:
wherein LS is the length of the secret information and the unit is character; LSK is the length of the binary string of the key, and the unit is bit;
and 3.2, generating a hashed secret information binary character string by the hash function according to the hash position bit or the secret information binary character string.
5. The method for hiding and extracting text secret information based on Unicode encoding according to claim 1, wherein the step 4 replaces the binary string of the hashed and encrypted secret information with Unicode zero-width control characters by a set rule, specifically as follows:
each consecutive 2 bits of the binary string are divided into one small group, and "00", "01", "10", "11" in each small group are replaced with "0 x 200C", "0 x 202C", "0 x 202D", "0 x 200E", respectively, to form an invisible string.
6. The method for hiding and extracting text secret information based on Unicode encoding according to claim 1, wherein the receiving party detects a zero-width string in the carrier text and restores the binary string according to a set rule as follows:
the receiver detects the zero-width character string in the carrier text, and restores the binary character string according to the rule of "0 x 200C", "0 x 202C", "0 x 202D" and "0 x 200E" corresponding to "00", "01", "10" and "11".
7. The method for hiding and extracting text secret information based on Unicode encoding according to claim 1, wherein the step 6 of obtaining the receiver key specifically comprises the following steps:
step 6.1, the hash function takes the receiving time as a key of a receiving party and omits the 4 th bit of the time;
step 6.2, create a number and convert it into an 8-bit binary string, i.e. the receiver key.
8. The method for hiding and extracting text secret information based on Unicode encoding according to claim 1, wherein the step 7 hash-decodes the binary string based on the key pair of the receiving party as follows:
and (4) calculating NC according to a formula (4), copying the NC-time key binary character string to form a hash bit, and performing exclusive-OR calculation on the hash bit and the secret information binary character string to be decrypted.
9. The method for hiding and extracting text secret information based on Unicode encoding according to claim 1, wherein the authentication in step 8 is performed and the goldel function decoding is performed to output the secret information, specifically as follows:
comparing whether the decoded key of the sender is the same as the key of the receiver, if so, performing Godel function decoding on the binary string of the secret information, and then outputting the secret information; and if the two are different, prompting that the secret information extraction fails.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910591575.8A CN110418029A (en) | 2019-07-02 | 2019-07-02 | Text secret information based on Unicode coding hides and extracting method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910591575.8A CN110418029A (en) | 2019-07-02 | 2019-07-02 | Text secret information based on Unicode coding hides and extracting method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110418029A true CN110418029A (en) | 2019-11-05 |
Family
ID=68358838
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910591575.8A Pending CN110418029A (en) | 2019-07-02 | 2019-07-02 | Text secret information based on Unicode coding hides and extracting method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110418029A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111294340A (en) * | 2020-01-17 | 2020-06-16 | 河南芯盾网安科技发展有限公司 | Encryption information steganography method based on zero-width characters |
| CN111447188A (en) * | 2020-03-20 | 2020-07-24 | 青岛大学 | Carrier-free text steganography method based on language steganography feature space |
| CN111538923A (en) * | 2020-03-16 | 2020-08-14 | 北京三快在线科技有限公司 | Information source determining method and device and electronic equipment |
| CN112199248A (en) * | 2020-09-14 | 2021-01-08 | 中标慧安信息技术股份有限公司 | Operation and maintenance method based on artificial intelligence edge equipment |
| CN112583823A (en) * | 2020-12-11 | 2021-03-30 | 广东工业大学 | Encoding encryption and decoding decryption processing method |
| CN113992345A (en) * | 2021-09-13 | 2022-01-28 | 百度在线网络技术（北京）有限公司 | Method and device for encrypting and decrypting webpage sensitive data, electronic equipment and storage medium |
| CN114584407A (en) * | 2022-05-09 | 2022-06-03 | 御天守(江苏)信息科技有限公司 | System for embedding and extracting multilingual hidden data in online message |
| WO2022123093A1 (en) | 2020-12-09 | 2022-06-16 | Telefonica Cibersecurity Tech, S.L.U. | Method and system for encoding and decoding information in texts |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104699661A (en) * | 2015-01-29 | 2015-06-10 | 中国科学院信息工程研究所 | Selecting method and system of privacy code words facing Unicode coded documents |
| CN107609356A (en) * | 2017-08-09 | 2018-01-19 | 南京信息工程大学 | Text carrier-free information concealing method based on label model |
| CN108090329A (en) * | 2018-01-17 | 2018-05-29 | 上海海笛数字出版科技有限公司 | A kind of method and device that digital watermarking encipherment protection is carried out to content of text |
-
2019
- 2019-07-02 CN CN201910591575.8A patent/CN110418029A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104699661A (en) * | 2015-01-29 | 2015-06-10 | 中国科学院信息工程研究所 | Selecting method and system of privacy code words facing Unicode coded documents |
| CN107609356A (en) * | 2017-08-09 | 2018-01-19 | 南京信息工程大学 | Text carrier-free information concealing method based on label model |
| CN108090329A (en) * | 2018-01-17 | 2018-05-29 | 上海海笛数字出版科技有限公司 | A kind of method and device that digital watermarking encipherment protection is carried out to content of text |
Non-Patent Citations (2)
| Title |
|---|
| 张震宇;李千目;戚湧: "《基于不可见字符的文本水印设计》", 《南京理工大学学报》 * |
| 陈旖旎,李千目,吕超贤,桑笑楠,董潇: "《不可见字符的文本安全隐藏算法研究》", 《网络空间安全》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111294340A (en) * | 2020-01-17 | 2020-06-16 | 河南芯盾网安科技发展有限公司 | Encryption information steganography method based on zero-width characters |
| CN111538923A (en) * | 2020-03-16 | 2020-08-14 | 北京三快在线科技有限公司 | Information source determining method and device and electronic equipment |
| CN111447188A (en) * | 2020-03-20 | 2020-07-24 | 青岛大学 | Carrier-free text steganography method based on language steganography feature space |
| CN111447188B (en) * | 2020-03-20 | 2022-03-18 | 青岛大学 | Carrier-free text steganography method based on language steganography feature space |
| CN112199248A (en) * | 2020-09-14 | 2021-01-08 | 中标慧安信息技术股份有限公司 | Operation and maintenance method based on artificial intelligence edge equipment |
| WO2022123093A1 (en) | 2020-12-09 | 2022-06-16 | Telefonica Cibersecurity Tech, S.L.U. | Method and system for encoding and decoding information in texts |
| EP4261714A4 (en) * | 2020-12-09 | 2024-07-17 | Telefonica Cibersecurity Tech S L U | Method and system for encoding and decoding information in texts |
| CN112583823A (en) * | 2020-12-11 | 2021-03-30 | 广东工业大学 | Encoding encryption and decoding decryption processing method |
| CN113992345A (en) * | 2021-09-13 | 2022-01-28 | 百度在线网络技术（北京）有限公司 | Method and device for encrypting and decrypting webpage sensitive data, electronic equipment and storage medium |
| CN113992345B (en) * | 2021-09-13 | 2024-05-28 | 百度在线网络技术（北京）有限公司 | Webpage sensitive data encryption and decryption method and device, electronic equipment and storage medium |
| CN114584407A (en) * | 2022-05-09 | 2022-06-03 | 御天守(江苏)信息科技有限公司 | System for embedding and extracting multilingual hidden data in online message |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110418029A (en) | Text secret information based on Unicode coding hides and extracting method | |
| Ahvanooey et al. | AITSteg: An innovative text steganography technique for hidden transmission of text message via social media | |
| CN106506487A (en) | A kind of information Encrypt and Decrypt method and device | |
| Aman et al. | A hybrid text steganography approach utilizing Unicode space characters and zero-width character | |
| JP2003520527A (en) | Invisible encoding of meta information | |
| CN109547663B (en) | Improved LSB image steganography method combined with cryptography | |
| CN108683491B (en) | Information hiding method based on encryption and natural language generation | |
| CN110414194B (en) | Text watermark embedding and extracting method | |
| Anwar et al. | StegoCrypt scheme using LSB-AES base64 | |
| Malalla et al. | Improving hiding security of Arabic text steganography by hybrid AES cryptography and text steganography | |
| Thomas et al. | Advanced cryptographic steganography using multimedia files | |
| Malik et al. | A high capacity text steganography scheme based on huffman compression and color coding | |
| Tripathi et al. | Enhancing Security of PGP with Steganography | |
| Liang et al. | Information hiding using whitespace technique in Microsoft word | |
| CN114584407A (en) | System for embedding and extracting multilingual hidden data in online message | |
| Din et al. | Performance analysis on secured data method in natural language steganography | |
| Saniei et al. | The Security of Arithmetic Compression Based Text Steganography Method | |
| Taka | Text Steganography based on Noorani and Darkness. | |
| Azeem et al. | A secure and size efficient approach to enhance the performance of text steganographic algorithm | |
| Din et al. | A comparative review on data hiding schemes | |
| Azzam et al. | The use of binary digit mapping on ASCII characters to create a high-capacity, undetectable text steganography | |
| Salih et al. | Integrated Digital Signature Based Watermarking Technology for Securing Online Electronic Documents | |
| Yadav et al. | Cryptographic steganography | |
| Alla et al. | Secure transmission of authenticated messages using new encoding scheme and steganography | |
| CN113067892B (en) | Method for realizing safe cloud synchronization and cloud storage by using public cloud |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191105 |