CN116074001A - Data compression encryption method - Google Patents
Data compression encryption method Download PDFInfo
- Publication number
- CN116074001A CN116074001A CN202310136410.8A CN202310136410A CN116074001A CN 116074001 A CN116074001 A CN 116074001A CN 202310136410 A CN202310136410 A CN 202310136410A CN 116074001 A CN116074001 A CN 116074001A
- Authority
- CN
- China
- Prior art keywords
- data
- block
- encrypted
- impurity
- encryption
- 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.)
- Granted
Links
Images
Classifications
-
- 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/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
-
- 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
-
- 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/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/085—Secret sharing or secret splitting, e.g. threshold schemes
-
- 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/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Storage Device Security (AREA)
Abstract
The invention provides a data compression encryption method, which comprises the following steps: doping data to be encrypted into impurity data, and doping compression encryption is carried out on the doping body of the data to be encrypted and the impurity data by using a compression encryption method; the doping compression encryption process comprises the following steps: preparing an encryption key K, a data block C to be encrypted, a parameter block D and a random number impurity block Q; sequentially forming an (m+2) n-bit integral data block S by the encryption key K, the parameter block D and the cut data block C to be encrypted; selecting a large number of a plurality of random number impurity blocks Q, irregularly arranging and combining the random number impurity blocks Q into an integral impurity block T, detecting whether an encryption key K exists in the integral impurity block T, and re-executing the step if the encryption key K exists; inserting the whole data block S into the random position of the whole impurity block T to generate a doped data sequence W to be compressed and encrypted; and performing compression encryption on the doped data sequence W by using a compression encryption tool to generate an encrypted ciphertext E.
Description
Technical Field
The invention belongs to the field of information security encryption, and particularly relates to a data compression encryption method.
Background
The most common method for performing password cracking on the data encrypted by the strict data encryption algorithm is to perform brute force cracking by adopting an exhaustion method. Early general Central Processing Units (CPUs) required a lot of time to break violently, and the cost of breaking violently was high. However, as the information industry introduces Graphics Processing Units (GPUs) to use general-purpose computing functions to crack encrypted data in parallel, the speed of cracking the encrypted data is greatly increased, and the cost of brute force cracking is greatly reduced.
Therefore, for the parallel processing technology to crack the password, it is necessary to propose an encryption algorithm that effectively resists the parallel cracking technology.
Disclosure of Invention
The invention aims at overcoming the defects of the prior art, and provides a data compression encryption method.
In order to achieve the above purpose, the technical scheme adopted by the invention is as follows:
the first aspect of the invention provides a data compression encryption method, which comprises the following steps:
doping data to be encrypted into impurity data, and doping compression encryption is carried out on the doping body of the data to be encrypted and the impurity data by using a compression encryption method;
the impurity data are a large number of impurity data which have certain repeatability and are the same as the structure of the data to be encrypted; wherein, the volume of the doped impurity data is far greater than the volume of the data to be encrypted and the encryption key; some repeatability means that the impurity data of partial doping is the same data; the same structure means that the data type and data size of the single impurity data are the same as those of the data to be encrypted;
the doping compression encryption process comprises the following steps:
step one, data preparation;
(1) Setting an encryption key K of an n-bit binary number;
(2) Cutting the data block C to be encrypted into m data blocks with n bits, wherein the part which is less than the whole block is filled with preset empty characters;
(3) Generating a blank parameter block D, filling the number represented by m, and filling the part which is less than the whole block with a preset blank character;
(4) Generating P n-bit random number impurity blocks Q by using a random information generator, wherein each impurity block is required to be not repeated with an encryption key K and a data block to be encrypted;
sequentially forming an (m+2) n-bit integral data block S by the encryption key K, the parameter block D and the cut data block C to be encrypted;
step three, selecting a large number of a plurality of random number impurity blocks Q, irregularly arranging and combining the random number impurity blocks Q into an integral impurity block T, detecting whether an encryption key K exists in the integral impurity block T, re-executing the step three if the encryption key K exists, and otherwise, entering the next step;
step four, inserting the whole data block S into the random position of the whole impurity block T to generate a doped data sequence W to be compressed and encrypted;
and fifthly, compressing and encrypting the doped data sequence W by using a compression and encryption tool to generate an encrypted ciphertext E.
The second aspect of the present invention provides a data decryption method, comprising the steps of:
the encryption key K is used for decrypting the encrypted ciphertext E obtained by the data compression encryption method to obtain a doped data sequence W;
step two, searching the position of the encryption key K in the doped data sequence W to obtain a data block S;
based on the data block S, determining the content of a parameter block D according to the number n of bits of the encryption key K, and obtaining the value of m;
and thirdly, determining the positions and the contents of the cutting blocks of the m n-bit data blocks C to be encrypted, and obtaining the data blocks C to be encrypted.
The third aspect of the present invention provides a data compression encryption device, comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory complete communication with each other through the communication bus;
a memory for storing a computer program;
and the processor is used for realizing the data compression encryption method when executing the program stored in the memory.
A fourth aspect of the present invention provides a data decryption apparatus, including a processor, a communication interface, a memory, and a communication bus, wherein the processor, the communication interface, and the memory complete communication with each other through the communication bus;
a memory for storing a computer program;
and the processor is used for realizing the data decryption method when executing the program stored in the memory.
A fifth aspect of the invention provides a computer readable storage medium having instructions stored thereon that, when executed by one or more processors, cause the processors to perform the data compression encryption method.
A sixth aspect of the invention provides a computer readable storage medium having instructions stored thereon which, when executed by one or more processors, cause the processors to perform the described data decryption method.
A seventh aspect of the present invention provides an electronic device, including a processor, a communication interface, a memory, and a communication bus, where the processor, the communication interface, and the memory complete communication with each other through the communication bus;
a memory for storing a computer program and data;
and the processor is used for realizing the data compression encryption method and the data decryption method when executing the program stored in the memory.
Compared with the prior art, the invention has outstanding substantive characteristics and remarkable progress, and concretely comprises the following steps:
1. according to the method, a large amount of limited impurity data with the same structure as the data to be encrypted is doped into the data to be encrypted during compression encryption, so that an illegal decryptor occupies a large amount of memory in the forced decryption process, all RAMs of a parallel-processing violent decoding system are used up, the violent decoding system needs to call a hard disk with slower speed as a data storage space, a high-speed GPU processor is limited to decode passwords by using a low-speed hard disk, and parallel decoding of the encrypted data is finally made impossible.
2. In the method, when in compression encryption, a large amount of repeated impurity data is doped, so that the volume of the encrypted ciphertext E after compression encryption is smaller.
Drawings
Fig. 1 is a schematic diagram showing a data organization structure of a data block C to be encrypted before single compression encryption doping in the present invention.
Fig. 2 shows a schematic diagram of the data organization structure of the whole data block S after single compressed encryption doping in the present invention.
Fig. 3 shows the working environment of the encryption compression of the method of the invention.
Detailed Description
The technical scheme of the invention is further described in detail through the following specific embodiments.
Example 1
The embodiment provides a data compression encryption method, which comprises the following steps:
doping data to be encrypted into impurity data, and doping compression encryption is carried out on the doping body of the data to be encrypted and the impurity data by using a compression encryption method;
the impurity data is a large amount of impurity data which has certain repeatability and is identical to the structure of the data to be encrypted. The bulk data refers to the total volume of doped impurity data which is far greater than the sum of the volumes of the data to be encrypted and the encryption key, so that the purpose of thoroughly diluting the useful data (the data to be encrypted and the encryption key) is achieved, namely, under the condition that the total amount (the useful data amount after doping and before encryption is generally recommended to be the size of the memory of the current mainstream desk-top office computer, such as about 8 GB) is determined, the doped impurity occupies most of the space of the total amount. Some repeatability means that the impurity data of partial doping is the same data; the same structure means that the data type (e.g., character data, plain number or text data, etc.) and the data size of the individual impurity data are the same as those of the data to be encrypted.
The doping compression encryption process comprises the following steps:
step one, data preparation;
(1) Setting an encryption key K of an n-bit binary number;
(2) Cutting a data block C to be encrypted (a schematic diagram of a data organization structure is shown in fig. 1) into m data blocks (C1, C2, C3, … and Cm) with n bits, wherein the part which is less than the whole block is filled with preset empty characters; the preset blank character can be customized, is not limited to a single character, and can be a specific character string;
(3) Generating a blank parameter block D, filling the number represented by m, and filling the part which is less than the whole block with a preset blank character;
(4) Generating P n-bit random number impurity blocks Q (comprising Q1, Q2, Q3, … and Qp) by using a random information generator, wherein the impurity blocks Q1, Q2, Q3, … and Qp are not repeated with an encryption key K and data blocks C1, C2, C3, … and Cm to be encrypted;
step two, the encryption key K, the parameter block D and the cut data block C to be encrypted are sequentially formed into an (m+2) n-bit integral data block S (a schematic diagram of a data organization structure is shown in fig. 2);
step three, under the condition of determining the total amount, selecting a large number of a plurality of random number impurity blocks Q, irregularly arranging and combining the random number impurity blocks Q into an integral impurity block T, detecting whether an encryption key K exists in the integral impurity block T, re-executing step six if the encryption key K exists, otherwise, entering the next step;
step four, inserting the whole data block S into the random position of the whole impurity block T to generate a doped data sequence W to be compressed and encrypted;
and fifthly, compressing and encrypting the doped data sequence W by using a compression and encryption tool to generate an encrypted ciphertext E.
In this embodiment, the compression encryption tool is preferably a 7Zip compression encryption tool, and adopts a 7z compression format, an LZMA or LZMA2 compression mode, and a compression level of limit compression.
It should be noted that: the "encryption" and "compression" mentioned in this embodiment are the same data processing procedure, and the compression operation and the encryption operation are included in the same logic procedure. The mathematical meaning of encryption compression and compression encryption is identical, and the working environment is shown in figure 3.
Example 2
The embodiment provides a data decryption method, which comprises the following steps:
step one, decrypting an encrypted ciphertext E obtained by adopting the data compression encryption method described in the embodiment 1 by using an encryption key K to obtain a doped data sequence W;
step two, searching the position of the encryption key K in the doped data sequence W to obtain a data block S;
based on the data block S, determining the content of a parameter block D according to the number n of bits of the encryption key K, and obtaining the value of m;
and thirdly, determining the positions and the contents of the cutting blocks of the m n-bit data blocks C to be encrypted, and obtaining the data blocks C to be encrypted.
It should be noted that: the "decryption" and "decompression" mentioned in this embodiment are the same data processing procedure, and the decompression operation and the decryption operation are also included in the same logic procedure. Decryption decompression and decompression decryption are mathematically identical.
When the method of the embodiment decrypts the encrypted ciphertext E and a legal decryptor decrypts the data, the RAM of the computer can just hold impurity data decompressed in the decryption process; when an illegal decryptor performs parallel brute force decoding, RAM with the same multiple as the parallel number is needed to be provided for storing decompressed data containing a large amount of impurities, which is almost impossible to complete for a GPU processing module containing thousands of parallel threads per unit, so that the advantages of parallel processing in brute force decoding are completely limited.
Example 3
The difference between this embodiment and embodiment 2 is that: in order to increase the burden of an illegal decryptor on a computer in the decompression and decryption process, when compression encryption is carried out, the doping compression encryption process of each group of data to be encrypted carries out nesting operation at least twice, and different encryption keys are used for each nesting operation.
When using single encryption, an illegitimate decryptor may analyze the partially decrypted data stream to determine if the key tested at this time is correct, and if not, may discover shortly after the start while interrupting the key test at this time.
A large number of data blocks, whether useful data or impurity data, are structurally similar. If the illegal decryptor finds that a large number of data blocks with similar structures do not exist in the data stream generated by certain decryption, the illegal decryptor knows that the password is invalid, can stop the illegal test in time, and cannot occupy a large amount of memory. But will become irregular data regardless of how regular the data is encrypted. The secondary nested encryption can avoid illegal decryptors from avoiding decryption failure by the method.
When the secondary nested encryption is used, an illegal decryptor cannot finish the first decryption process, and cannot judge whether the first group of keys are correct or not, and at the moment, a large amount of compressed doped impurity data can be decrypted out to fill the memory of the cracking system, so that a great load is brought to the cracking system.
Unlike the secondary nested encryption of the general encryption means (the calculated amount of primary u-bit encryption nested primary v-bit encryption is not much different from the calculated amount of primary u+v-bit encryption), the encryption method provided by the embodiment mainly increases the memory occupation of illegal decryptors, forces a lower-speed hard disk to participate in temporary data storage exchange in decryption, and thus slows down the speed of a GPU processor. Even if the number of bits of the total key is unchanged, the secondary nested encryption has better effect than the single encryption.
For example: the user uses the encryption key K1 to encrypt and compress the doped data sequence W to generate an encrypted ciphertext E1, and after one-time single-layer compression is completed;
the user replaces the encryption key K2, and the compression encryption related step in embodiment 1 is re-executed, and the second nested encryption is executed on the encrypted ciphertext E1, so as to generate the encrypted ciphertext E2.
Decompressing and decrypting the encrypted ciphertext E2 by using the encryption key K2 to generate an impurity data block containing the encryption key K2, the parameter block D2 and the encrypted ciphertext E1;
traversing the encryption key K2, the parameter block D2 and the impurity data block of the encryption ciphertext E1, determining the parameter block D2 after finding the encryption key K2 in the impurity data block, extracting m2, and extracting the encryption ciphertext E1;
the method comprises the steps of clearing impurity data blocks containing an encryption key K2, a parameter block D2 and an encryption ciphertext E1 in a memory;
and (5) decompressing and decrypting the encrypted ciphertext E1 by using the encryption key K1 by using the same method to obtain the data block C to be encrypted.
In this embodiment, if the illegal decryptor uses the exhaustion key Kx1 to decompress and decrypt E2, an invalid data block Y is generated, and the invalid data block Y occupies a large amount of memory, at this time, the illegal decryptor cannot determine whether Kx1 is a valid key, and can only use the exhaustion key Kx2 again to perform a second decompression decryption attempt on possible data (i.e. the data that the illegal decryptor may successfully perform outer layer decryption or may perform outer layer data that fails to decrypt, but cannot be seen here, but cannot be seen until inner layer decryption is performed continuously) without deleting the invalid data block Y;
even if the illegal decryptor can judge whether Kx1 is correct according to the data rule, the E2 decryption and decompression are completely completed, and the temporary data generated by decompression in the memory cannot be deleted before the time, so that the memory capacity of the computer of the illegal decryptor is used up, and the hard disk has to be called for auxiliary storage. Before the auxiliary storage of the hard disk is completed, the computer processor is in a waiting state, so that the cracking speed is greatly prolonged;
if the illegal decryptor uses the multithread parallel processing, the memory consumption of the computer for cracking will be more serious, so that the cracking cannot be performed normally.
Example 4
The embodiment provides a data compression encryption device, which comprises a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus;
a memory for storing a computer program;
and a processor for implementing the data compression encryption method described in embodiment 1 when executing the program stored in the memory.
Example 5
The embodiment provides a data decryption device, which comprises a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus;
a memory for storing a computer program;
and a processor for implementing the data decryption method described in embodiment 2 when executing the program stored on the memory.
Example 6
The present embodiment provides a computer-readable storage medium having instructions stored thereon that, when executed by one or more processors, cause the processors to perform the data compression encryption method described in embodiment 1.
Example 7
The present embodiment provides a computer-readable storage medium having instructions stored thereon that, when executed by one or more processors, cause the processors to perform the data decryption method as described in embodiment 2.
Example 8
The embodiment provides electronic equipment, which comprises a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus;
a memory for storing a computer program and data;
and a processor for implementing the data compression encryption method described in embodiment 1 and the data decryption method described in embodiment 2 when executing the program stored on the memory.
It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-non-transitory readable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each flowchart and/or block of the flowchart illustrations and/or block diagrams, and combinations of flowcharts and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention and not for limiting the same; while the invention has been described in detail with reference to the preferred embodiments, those skilled in the art will appreciate that: modifications may be made to the specific embodiments of the present invention or equivalents may be substituted for part of the technical features thereof; without departing from the spirit of the invention, it is intended to cover the scope of the invention as claimed.
Claims (10)
1. A method of data compression encryption, the method comprising:
doping data to be encrypted into impurity data, and doping compression encryption is carried out on the doping body of the data to be encrypted and the impurity data by using a compression encryption method;
the impurity data are a large number of impurity data which have certain repeatability and are the same as the structure of the data to be encrypted; wherein, the volume of the doped impurity data is far greater than the volume of the data to be encrypted and the encryption key; some repeatability means that the impurity data of partial doping is the same data; the same structure means that the data type and data size of the single impurity data are the same as those of the data to be encrypted;
the doping compression encryption process comprises the following steps:
step one, data preparation;
(1) Setting an encryption key K of an n-bit binary number;
(2) Cutting the data block C to be encrypted into m data blocks with n bits, wherein the part which is less than the whole block is filled with preset empty characters;
(3) Generating a blank parameter block D, filling the number represented by m, and filling the part which is less than the whole block with a preset blank character;
(4) Generating P n-bit random number impurity blocks Q by using a random information generator, wherein each impurity block is required to be not repeated with an encryption key K and a data block to be encrypted;
sequentially forming an (m+2) n-bit integral data block S by the encryption key K, the parameter block D and the cut data block C to be encrypted;
step three, selecting a large number of a plurality of random number impurity blocks Q, irregularly arranging and combining the random number impurity blocks Q into an integral impurity block T, detecting whether an encryption key K exists in the integral impurity block T, re-executing the step three if the encryption key K exists, and otherwise, entering the next step;
step four, inserting the whole data block S into the random position of the whole impurity block T to generate a doped data sequence W to be compressed and encrypted;
and fifthly, compressing and encrypting the doped data sequence W by using a compression and encryption tool to generate an encrypted ciphertext E.
2. The data compression encryption method according to claim 1, wherein the compression encryption is performed by performing at least two nesting operations per set of data to be encrypted, and each nesting operation uses a different encryption key.
3. The data compression encryption method according to claim 1, wherein: the compression encryption tool is a 7Zip compression encryption tool, and adopts a 7z compression format, an LZMA or LZMA2 compression mode and a compression level of limit compression.
4. The data compression encryption method according to claim 1, wherein: the total amount of the doped impurities is the size of the memory of the current mainstream desk-top office computer.
5. A data decryption method, comprising the steps of:
step one, decrypting an encrypted ciphertext E obtained by adopting the data compression encryption method of any one of claims 1 to 4 by using an encryption key K to obtain a doped data sequence W;
step two, searching the position of the encryption key K in the doped data sequence W to obtain a data block S;
based on the data block S, determining the content of a parameter block D according to the number n of bits of the encryption key K, and obtaining the value of m;
and thirdly, determining the positions and the contents of the cutting blocks of the m n-bit data blocks C to be encrypted, and obtaining the data blocks C to be encrypted.
6. The data compression encryption device comprises a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus;
a memory for storing a computer program;
a processor for implementing the data compression encryption method according to any one of claims 1 to 4 when executing a program stored on a memory.
7. The data decryption device comprises a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus;
a memory for storing a computer program;
a processor for implementing the data decryption method according to claim 5 when executing a program stored on a memory.
8. A computer-readable storage medium having instructions stored thereon, which when executed by one or more processors, cause the processors to perform the data compression encryption method of any one of claims 1-4.
9. A computer-readable storage medium having instructions stored thereon, which when executed by one or more processors, cause the processors to perform the data decryption method of claim 5.
10. An electronic device comprises a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus;
a memory for storing a computer program and data;
a processor for implementing the data compression encryption method according to any one of claims 1 to 4 and the data decryption method according to claim 5 when executing a program stored on a memory.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310136410.8A CN116074001B (en) | 2023-02-20 | 2023-02-20 | Data compression encryption method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310136410.8A CN116074001B (en) | 2023-02-20 | 2023-02-20 | Data compression encryption method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116074001A true CN116074001A (en) | 2023-05-05 |
| CN116074001B CN116074001B (en) | 2023-07-18 |
Family
ID=86173036
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310136410.8A Active CN116074001B (en) | 2023-02-20 | 2023-02-20 | Data compression encryption method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116074001B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090100265A1 (en) * | 2005-05-31 | 2009-04-16 | Asami Tadokoro | Communication System and Authentication Card |
| CN103377654A (en) * | 2012-04-11 | 2013-10-30 | 英属维京群岛商蓝胜科技股份有限公司 | Voice security method, encryption and decryption method and security equipment |
| CN104521177A (en) * | 2011-12-06 | 2015-04-15 | 本质Id有限责任公司 | Soft decision error correction for memory based puf using a single enrollment |
| CN111988301A (en) * | 2020-08-14 | 2020-11-24 | 武汉气吞云梦科技有限公司 | Secure communication method for preventing client from hacker violence attack |
| CN112449695A (en) * | 2020-10-12 | 2021-03-05 | 长江先进存储产业创新中心有限责任公司 | Multiple integration scheme using bonding of ASIC or FPGA chips to 3D crosspoint chips |
| CN113596386A (en) * | 2021-08-07 | 2021-11-02 | 施航 | Video monitoring quantum encryption system |
-
2023
- 2023-02-20 CN CN202310136410.8A patent/CN116074001B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090100265A1 (en) * | 2005-05-31 | 2009-04-16 | Asami Tadokoro | Communication System and Authentication Card |
| CN104521177A (en) * | 2011-12-06 | 2015-04-15 | 本质Id有限责任公司 | Soft decision error correction for memory based puf using a single enrollment |
| CN103377654A (en) * | 2012-04-11 | 2013-10-30 | 英属维京群岛商蓝胜科技股份有限公司 | Voice security method, encryption and decryption method and security equipment |
| CN111988301A (en) * | 2020-08-14 | 2020-11-24 | 武汉气吞云梦科技有限公司 | Secure communication method for preventing client from hacker violence attack |
| CN112449695A (en) * | 2020-10-12 | 2021-03-05 | 长江先进存储产业创新中心有限责任公司 | Multiple integration scheme using bonding of ASIC or FPGA chips to 3D crosspoint chips |
| CN113596386A (en) * | 2021-08-07 | 2021-11-02 | 施航 | Video monitoring quantum encryption system |
Non-Patent Citations (1)
| Title |
|---|
| 代亚楠;张驰;俞能海;: "无共享密钥的非协调性跳频通信技术研究", 通信技术, no. 03, pages 297 - 298 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116074001B (en) | 2023-07-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2692084B1 (en) | Secret sharing apparatus, sharing apparatus and secret sharing method | |
| CN108052805B (en) | Data encryption and decryption method and device | |
| US20020131590A1 (en) | Key matrix methodology | |
| CN114221766B (en) | Data encryption method, data decryption method and data encryption device | |
| CN103345609A (en) | Method and device for text encryption and decryption | |
| CN115834063B (en) | Quantum key-based data compression encryption method | |
| CN111490869A (en) | High-speed secrecy enhancement method for supporting large-scale input block in quantum key distribution system | |
| CN115514469B (en) | Information encryption protection method | |
| US20020150240A1 (en) | Key matrix system | |
| CN116074001B (en) | Data compression encryption method | |
| CN109981284B (en) | Method and device for realizing elliptic curve digital signature | |
| CN112287366A (en) | Data encryption method and device, computer equipment and storage medium | |
| CN106844411A (en) | A kind of big data random access system and method based on reducing subspaces | |
| US7558968B2 (en) | Information processing apparatus and method | |
| CN116089989B (en) | Data iterative encryption processing method for offline data terminal | |
| CN110990846B (en) | Information storage method, device and computer readable storage medium | |
| CN114697671B (en) | Building engineering quality management system | |
| CN115022076A (en) | Data encryption/decryption method, device, system and medium | |
| CN114928363A (en) | Data processing method, data processing device, computer equipment and storage medium | |
| CN109902528B (en) | Encoding and decoding method of two-dimension code | |
| CN114285610A (en) | Method for encrypting and transmitting information | |
| CN113765650A (en) | Data encryption and decryption method and device, electronic equipment and storage medium | |
| CN116880778B (en) | User privacy protection method based on regenerative coding and distributed storage | |
| CN1252663C (en) | Calculation device and calculation method | |
| CN109684859A (en) | A kind of safe encryption method of big data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |