CN103873230A - Single-direction encryption-decryption technology - Google Patents
Single-direction encryption-decryption technology Download PDFInfo
- Publication number
- CN103873230A CN103873230A CN201410137859.7A CN201410137859A CN103873230A CN 103873230 A CN103873230 A CN 103873230A CN 201410137859 A CN201410137859 A CN 201410137859A CN 103873230 A CN103873230 A CN 103873230A
- Authority
- CN
- China
- Prior art keywords
- data
- encryption
- branch road
- algorithm
- result
- 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
Landscapes
- Storage Device Security (AREA)
Abstract
A single-direction encryption-decryption technology is an IT data encryption technology through which content data are subjected to encryption and decryption. Data before encryption and data after encryption do not correspond in a one-to-one mode, orientation data or an orientation algorithm need to be used for guaranteeing the fact that the data before encryption correspond to the data after encryption, a corresponding algorithm which can guarantee that the data after encryption correspond to the data before encryption does not exist, according to the technology, the fact that data which cannot be encrypted through a password form can be subjected to the processes of encryption and decryption can be guaranteed, the technology can be used for encryption of plaintext data, and in addition, password automatic updating or manual updating without changing password owner memory data can be achieved.
Description
Technical field
The invention belongs to IT industry data ciphering and deciphering technology.
Background technology
Applicant is by retrieval, 201210076498.0 patent applications " method of data decoding and device " of finding the application of Shenzhen Huawei have related to reverse decoding technique, but this part patent application is mainly set forth decode procedure, namely serial decoding is improved to parallel decoding and accelerates decoding and decoding speed, and principle and example to encrypt and decrypt do not resolved, our now widely used password is actual is by code, English is password, password is similar is door lock, it is by certain encryption method, make the people of illegal operation cannot open the page needing, and not encryption measures of the content of protection itself, in addition, application people is that the patent application " a kind of data security protection method of digital equipment " that the application number of Shanghai Wentai Electronic Science Co., Ltd is 200910197317.8 is also carried out based on password principle, just mainly utilize an encryption chip.
At least there are the following problems for existing technology:
1: some medium cannot be encrypted by password mode, but may there are equally the needs of encrypting decoding in these media;
2: utilize password encryption itself to have defect, hacker may be by computer-implemented large area password cracking.
Summary of the invention
beneficial effect:the invention reside in the information content itself is encrypted, and the result of deciphering can be by artificial judgment, itself can not stop access, but the correct meaning cannot be understood or explain to content of pages, deciphering correctly just obtains correct result, and decryption error obtains wrong result, and whether result is mated and generally needed artificial judgment, if be that computer judges that often retrieval amount is very huge, at least hacker cannot implement large area information and cracks.
technical essential:one-Way Encryption deciphering is IT industry data encryption decoding technique, it is characterized in that:
1: data are at least by the data before encrypting, and data two parts after encryption composition, preferably also should have intermediate data, intermediate data may be both to participate in the data of encrypting, and may be also the necessary data of only controlling ciphering process etc.;
2: encrypt and all unidirectional carrying out of decoding, mainly adopted branch road principle;
3: the data after encryption can be visual or can read, but can be also similar password forms;
4: the data of encryption can be electronic data, can be also papery data;
5: encryption can divide N step partial node to carry out, namely serial algorithm, the partial node of encrypting has sequencing, but in the time of same node encrytion, be-encrypted data is in order to accelerate enciphering rate and to strengthen Cipher Strength, the general parallel algorithm that adopts, can be divided into N module, execution parallel algorithm is encrypted, and these module datas also may be specific between mutually or not specifically be utilized program to participate in the encrypting and decrypting process of certain module, the integer of N Wei≤2 here, when deciphering, providing of programming data decryption should be as far as possible forward;
6: the data after the data before this technology secrecy and encryption do not need the mutual uniqueness of data, may there is the situation of one-to-many in them, if clear data, the result after deciphering generally relies on and manually judges according to other conditions, and encrypt data and password principle are approximate;
7: this technology decrypted program can need to be arranged on client according to checking, also can be arranged on server end;
8: it can be manually to provide that corresponding data provide medium, it can be client, also can be server end, can also be the storage medium with store function, comprises read-only storage medium and read-write storage medium, read-only storage medium can be papery, scraps of paper shape plastic cement medium etc., reading manner can be manually to read, and can be also that machine reads, for example Quick Response Code, bar code etc.
embodiment:in order to allow those skilled in the art understand the difference of this technology with password design principle, first inventor lifts a very simple algebraic expression and explains, algebraic expression A+B=C, A is the data before encrypting, C is the data after encrypting, B is intermediate data, + be add operation, if the result C that we see is now 64, we convert a B value, just obtain a corresponding A value, B value can be infinite many, corresponding A value also can be infinite many, only a C value is without any meaning, if but the bad change of A value, for example password often changes, also be test to memory capability, if B and C can be read-write data, also can reach by changing B the object that changes C, if and B data as read-write data-storing in read-write storage medium, its data do not need password owner memory, if program pin design automatically updating function or Change In Design B data complete password and revise, this has certain benefit to cryptosecurity, it is different from MD5 corresponding relation like that, this is also the reason that this technology is different from password, but rely on the so simple algebraic expression of A+B=C obviously cannot complete complicated encrypting and decrypting, this specification relates to branch road principle, branch road is as the term suggests be exactly similar point of branch road, we from somewhere set off in search someone, so, divide branch road more, find difficulty larger, so branch road principle is all generally multinode branch road, the number of times of the similar fork of branch road nodes of indication, and branch road progression is similar to transitable road, point fork in the road way, branch road principle has following four features:
1: branch road principle is all to carry out serial algorithm, namely substep algorithm, its multi-node encryption deciphering has sequencing, and on same node branch road, progression is more, and it is reverse that to crack difficulty larger;
2; Data after data and encryption before branch road principle is encrypted do not have uniqueness corresponding relation, the two can be a pair of N theoretically, it is infinite many that N can reach theoretically, but when actual program, be limited to branch road nodes and branch road progression, can not infinite many, if all branch road progression is all M, nodes is Y, and N has more than the Y-1 power of M so;
3: branch road principle has " computer identification is without coupling " to guarantee its one-way, data after data decryption and encryption that " computer identification is without coupling " is just to provide do not have computer coupling verification procedures to guarantee the relevance of the relation between the two, for example identity card just can utilize this principle, provide name and other necessary datas by certificate supplier, inspector can obtain the data after an encryption after inputting related data, whether the name data after the encryption whether data that inspector utilizes Computer display are recorded above with identity card mates is confirmed whether certificate supplier is the certificate owner, this principle is mainly used in anti-the usurping of certificate and identifies and some fishing websites identifications, the high-speed computation ability of computer has not had market,
4: the directed generative nature of result, no matter be encrypting and decrypting, all need to provide data, in these data, just there are directional data or orientation algorithm to guarantee the uniqueness in the time that branch road data generate, and in the algorithm of multinode branch road, each node algorithm all utilizes directional data or orientation algorithm to complete uniqueness and encrypts, guarantee like this consistency of the result of encrypting and decrypting, and in algorithmic procedure, both can be direct initial data, also may be that some waits value-based algorithm, for example, former data are forward carried out addition, when deciphering, oppositely carry out subtraction etc., but inverse algorithms can not carried out too many step, overall algorithm and deciphering still present characteristic of unidirectional, namely substep is encrypted, here introduce following examples:
Embodiment 1: for example now the name on identity card " Li Ying " is encrypted, first " Li Ying " converted to digital code, be 6203 if table look-up, 5560, and there is an intermediate data " 123456 " on name Li Ying mono-hurdle, set now a coding encrypting rule, 1: former data are carried out to md5 encryption, character in MD5 data after encrypting and the individual digit of intermediate data are added successively, intermediate data recycles, until the addition of MD5 data is complete, data addition result is greater than after 10, convert corresponding letter to, be greater than after 35, need to subtract 35 changes again, afterwards the result after being added is carried out again to md5 encryption, carry out 5 times like this, the number that English in MD5 and numeral represent in additive process sees the following form:
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | a | b | c | d | e | f | g | h |
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 |
| i | j | k | l | m | n | o | p | q | r | s | t | u | v | w | x | y | z |
| 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 |
62035560 MD5 value is 69e0880031902958, after being added, result is 7bh4de1265e63b8c, after execution MD5 algorithm, be 0621ab9c4aac5fba, after in like manner carrying out, four steps are respectively 1d903d93b534519d, 6ab1fe1f5f1ceef1, 6515c37dde4e72aa, 54724b292bdb456f, the result of 54724b292bdb456f is actually the result that 7749h98fgi9k84de obtains after by md5 encryption, this result greatly differs from each other with " Li Ying ", if Li Ying loss identity card need to be made up new card now, so, only intermediate data " 123456 " need to be changed, just can obtain new result, the main partial node of describing of embodiment 1 is encrypted.
Embodiment 2: in embodiment 1, not branch road progression principle, still improve as an example of embodiment 1 example, if being designed to N, table 1 opens tables of data, 0 of for example table 2 is not 0 but a when doing digital operation and replacing, table 3 is 9 etc., " Li Ying " is divided into " Lee ", " grain husk ", their digital code is carried out respectively after md5 encryption, by the digital extraction of its result out, again divided by N number, remainder is several, just carry out character conversion from tables of data corresponding to this remainder, if other rule is all constant, the result of calculating is like this not identical with embodiment 1 yet, in this embodiment, N number is several, just represent that progression is several, if N number is 8, the nodes of embodiment 1 is 5, so possible result is that 84 powers are 4096 kinds, these data are not huge, but transcoding process is very complicated, the byte number of its number of combinations is very huge.
Embodiment 3: the be-encrypted data of embodiment 2 will be utilized to tables of data conversion now, and tables of data of the same type has N, the name of these tables of data has a rule, can distinguish these tables of data from 0 to N-1 exactly, so, just can be by directional data, generally that Arabic number is divided by N, its remainder is just also 0 combination to N-1 number, so just can be linked to corresponding tables of data, as long as guarantee that encryption and decryption directional data is consistent, just can guarantee the consistency of encrypting and decrypting result.
Embodiment 4: if with " Lee's " remainder result control " grain husk " of acquisition, vice versa, so just used branch road principle, and original Li Ying is divided into two modules has utilized parallel algorithm to encrypt, parallel algorithm at least needs to be divided into two modules and is encrypted.
Embodiment 5: in parallel algorithm, for the encryption of modules, connection data table can stipulate 1 module controls 2 modules, 2 module controls 3 modules, namely ad hoc fashion connects, and also can connect with non-specific manner, for example 6 Chinese are split into 6 modules, be that remainder adds 1 for several by module is divided by 6 separately, just specifying is that this module controls is connected to tables of data.
The above; only for implementing the specific embodiment of the present invention; but protection of the present invention is not limited to this; anyly be familiar with those skilled in the art within the scope of exposure of the present invention; the conversion that can expect easily or replacement; within all should being encompassed in protection scope of the present invention, therefore, protection of the present invention should be that the protection range of letter of authorization is as the criterion.
Test specification: the MD5 algorithm that this specification uses utilizes ASP simulation, database ACCESS2007, test program " the free version of old bewitching article system 2.5versionASP ".
Claims (9)
1. One-Way Encryption and deciphering are a kind of IT data ciphering and deciphering technology, it is characterized in that: the data after the data before its encryption and encryption do not have one-to-one relationship, need to adopt directional data or orientation algorithm to guarantee that the former corresponds to the latter, but do not have corresponding algorithm can guarantee that the latter corresponds to the former, in addition, it can be realized the automatic renewal of password or manually upgrade and do not need to change the data of password owner memory, can be for the encryption of clear data and encrypt data, it has following feature:
A: data are at least by the data before encrypting, and data two parts after encryption composition, preferably also should have intermediate data, intermediate data may be both to participate in the data of encrypting, and may be also the necessary data of only controlling ciphering process etc.;
B: encrypt and all unidirectional carrying out of decoding, mainly adopted branch road principle;
C: the data after encryption can be visual or can read, but can be also similar password forms;
D: data can be electronic data can be also papery data;
E: encryption can point multistep be carried out, namely serial algorithm, the partial node in branch road is encrypted sequencing, but in the time that same node data is encrypted, can carry out parallel algorithm, and when deciphering, providing of programming data decryption should be as far as possible forward;
F: the data after the data before this technology secrecy and encryption do not need the mutual uniqueness of data, may there is the situation of one-to-many in them, if clear data, the result after deciphering generally relies on and manually judges according to other conditions, and encrypt data and password Programming Principle are approximate;
G: this technology secrecy decrypted program can need to be arranged on client according to checking, also can be arranged on server end;
H: it can be manually to provide that corresponding data provide medium, it can be client, also can be server end, can also be the storage medium with store function, comprises read-only storage medium and read-write storage medium, read-only storage medium can be papery, scraps of paper shape plastic cement medium etc., reading manner can be manually to read, and can be also that machine reads, for example Quick Response Code, bar code etc.
2. automatically upgrade or manually upgrade according to password claimed in claim 1, it is characterized in that:
A: this function need to have the data after read-write intermediate data and read-write encryption;
B: it is to revise the data on read-write storage medium by program automatic or manual, and then the data of changing after encrypting complete.
3. according to branch road claimed in claim 1 principle, it is characterized in that, the number of times of the similar road fork of branch road nodes, and branch road progression is similar to transitable road, point fork in the road way:
A: branch road principle is all to carry out serial algorithm, namely substep algorithm, its multi-node encryption deciphering has sequencing, and on same node branch road, progression is more, and it is reverse that to crack difficulty larger;
B: the data after data and encryption before branch road principle is encrypted do not have uniqueness corresponding relation, the two can be a pair of N theoretically, it is infinite many that N can reach theoretically, but be limited to branch road nodes and branch road progression when actual program, can not be infinite many;
C: branch road principle has " computer identification nothing coupling " to guarantee that its one-way, the data after data decryption and encryption that " computer identification is without coupling " is just to provide do not have computer coupling verification procedures to guarantee the relevance of the relation between the two;
D: the directed generative nature of result, no matter be encrypting and decrypting, all need to provide data, in these data, just there are directional data or orientation algorithm to guarantee the uniqueness in the time that branch road data generate, and in the algorithm of multinode branch road, each node algorithm all utilizes directional data or orientation algorithm to complete uniqueness and encrypts, and guarantees like this consistency of the result of encrypting and decrypting.
4. parallel algorithm according to claim 3, is characterized in that:
Be-encrypted data is in order to accelerate enciphering rate and to strengthen Cipher Strength, the general parallel algorithm that adopts, can be divided into N module, execution parallel algorithm is encrypted, and these module datas also may be specific between mutually or not specifically be utilized program to participate in the encrypting and decrypting process of certain module, the integer of N Wei≤2 here.
5. the embodiment that multistep partial node according to claim 3 is encrypted, is characterized in that:
For example the name on identity card " Li Ying " is encrypted, first " Li Ying " converted to digital code, be 6203 if table look-up, 5560, and there is an intermediate data " 123456 " on name Li Ying mono-hurdle, set now a coding encrypting rule, 1: former data are carried out to md5 encryption, character in MD5 data after encrypting and the individual digit of intermediate data are added successively, intermediate data recycles, until the addition of MD5 data is complete, after data are added Jie Guo≤10, convert corresponding letter to, be greater than after 35, need to subtract 35 changes again, afterwards the result after being added is carried out to md5 encryption according to original method again, carry out 5 times like this, English in MD5 and the number that represents in additive process of numeral are as table 1:
Table 1:
62035560 MD5 value is 69e0880031902958, be 7bh4de1265e63b8c by itself and the rear result of the corresponding addition of 1234561234561234 figure places, note, here MD5 data are 16, and 123456 only have 6, so be that circulation two-wheeled adds four, after execution MD5 algorithm, be 0621ab9c4aac5fba, after in like manner carrying out, four steps are respectively 1d903d93b534519d, 6ab1fe1f5f1ceef1, 6515c37dde4e72aa, 54724b292bdb456f, the result of 54724b292bdb456f is actually the result that 7749h98fgi9k84de obtains after by md5 encryption, this result greatly differs from each other with " Li Ying ", if Li Ying loss identity card need to be made up new card now, so, only intermediate data " 123456 " need to be changed, just can obtain new result.
6. the embodiment of branch road according to claim 3 progression principle, it is characterized in that, in the embodiment of claim 5, not branch road progression principle, still improve with this example, if being designed to N, table 1 opens tables of data, 0 of for example table 2 is not 0 but a when doing digital operation and replacing, table 3 is 9 etc., " Li Ying " is divided into " Lee ", " grain husk ", their digital code is carried out respectively after md5 encryption, by the digital extraction of its result out, again divided by N number, remainder is several, just carry out character conversion from tables of data corresponding to this remainder, if other rule is all constant, the result of calculating is like this not identical with embodiment 1 yet, in this embodiment, N number is several, just represent that progression is several, if N number is 8, the nodes of embodiment 1 is 5, so possible result is that 84 powers are 4096 kinds, these data are not huge, but transcoding process is very complicated, the byte number of its number of combinations is very huge.
7. computer identification according to claim 3, without the embodiment of matching, is characterized in that:
Provide name and other necessary datas by certificate supplier, inspector inputs after related data can obtain the data after an encryption, and whether the name data after the encryption whether data that inspector utilizes Computer display are recorded above with identity card mates is confirmed whether certificate supplier is the certificate owner.
8. the embodiment of the directed generative nature of result according to claim 3, is characterized in that:
For example be-encrypted data to be utilized to tables of data conversion now, and tables of data of the same type has N, the name of these tables of data has a rule, can distinguish these tables of data from 0 to N-1 exactly, so, just can be by directional data, be generally Arabic number divided by N, its remainder is just also 0 to the combination of N-1 number, so just can be linked to corresponding tables of data, as long as encryption and decryption directional data is consistent, just can guarantee the consistency of encrypting and decrypting result.
9. the embodiment specific or that specifically do not control between module in parallel algorithm according to claim 4, it is characterized in that: in parallel algorithm, for the encryption of modules, connection data table can stipulate 1 module controls 2 modules, 2 module controls 3 modules, namely ad hoc fashion connects, also can connect with non-specific manner, for example 6 Chinese are split into 6 modules, be by will be separately module related data divided by 6, remainder adds 1 for several, and just specifying is that this module controls is connected to tables of data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410137859.7A CN103873230A (en) | 2014-04-06 | 2014-04-06 | Single-direction encryption-decryption technology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410137859.7A CN103873230A (en) | 2014-04-06 | 2014-04-06 | Single-direction encryption-decryption technology |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103873230A true CN103873230A (en) | 2014-06-18 |
Family
ID=50911381
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410137859.7A Pending CN103873230A (en) | 2014-04-06 | 2014-04-06 | Single-direction encryption-decryption technology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103873230A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105447342A (en) * | 2014-08-28 | 2016-03-30 | 阿里巴巴集团控股有限公司 | Script encryption method, script decryption method and engine |
| CN108334786A (en) * | 2017-11-19 | 2018-07-27 | 李朝玺 | A kind of data ciphering method |
| CN109150882A (en) * | 2018-08-23 | 2019-01-04 | 杭州在信科技有限公司 | A kind of data leakage prevention method based on using routing encryption |
| CN110061989A (en) * | 2019-04-19 | 2019-07-26 | 航天云网数据研究院(江苏)有限公司 | A kind of full partition method of data acquisition gateway |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6819764B1 (en) * | 1998-08-24 | 2004-11-16 | Kabushiki Kaisha Toshiba | Data processor, communication system and recording medium |
| CN101030852A (en) * | 2007-01-30 | 2007-09-05 | 天津市阿波罗信息技术有限公司 | Method for enciphering and deciphering human-body safety |
| CN101604362A (en) * | 2008-06-13 | 2009-12-16 | 鸿富锦精密工业（深圳）有限公司 | The computer system and the method that are used for software cryptography |
| CN101710307A (en) * | 2009-10-16 | 2010-05-19 | 上海闻泰电子科技有限公司 | Method for protecting data security of digital equipment |
| CN102710366A (en) * | 2012-03-21 | 2012-10-03 | 华为技术有限公司 | Method and device for data decoding |
-
2014
- 2014-04-06 CN CN201410137859.7A patent/CN103873230A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6819764B1 (en) * | 1998-08-24 | 2004-11-16 | Kabushiki Kaisha Toshiba | Data processor, communication system and recording medium |
| CN101030852A (en) * | 2007-01-30 | 2007-09-05 | 天津市阿波罗信息技术有限公司 | Method for enciphering and deciphering human-body safety |
| CN101604362A (en) * | 2008-06-13 | 2009-12-16 | 鸿富锦精密工业（深圳）有限公司 | The computer system and the method that are used for software cryptography |
| CN101710307A (en) * | 2009-10-16 | 2010-05-19 | 上海闻泰电子科技有限公司 | Method for protecting data security of digital equipment |
| CN102710366A (en) * | 2012-03-21 | 2012-10-03 | 华为技术有限公司 | Method and device for data decoding |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105447342A (en) * | 2014-08-28 | 2016-03-30 | 阿里巴巴集团控股有限公司 | Script encryption method, script decryption method and engine |
| CN105447342B (en) * | 2014-08-28 | 2018-08-31 | 阿里巴巴集团控股有限公司 | script encryption method, decryption method and engine |
| CN108334786A (en) * | 2017-11-19 | 2018-07-27 | 李朝玺 | A kind of data ciphering method |
| CN109150882A (en) * | 2018-08-23 | 2019-01-04 | 杭州在信科技有限公司 | A kind of data leakage prevention method based on using routing encryption |
| CN109150882B (en) * | 2018-08-23 | 2021-02-12 | 深圳市安盾网络技术有限公司 | Data leakage prevention method based on encryption by utilizing route |
| CN110061989A (en) * | 2019-04-19 | 2019-07-26 | 航天云网数据研究院(江苏)有限公司 | A kind of full partition method of data acquisition gateway |
| CN110061989B (en) * | 2019-04-19 | 2021-07-13 | 航天云网数据研究院(江苏)有限公司 | Data acquisition gateway full-isolation method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102916804B (en) | Two-dimension code coding and decoding method and device based on local color verification | |
| CN103778590B (en) | Using digital picture storage and the method and apparatus of transmission information | |
| Kavitha et al. | Steganography using least significant bit algorithm | |
| WO2017045594A1 (en) | Anti-counterfeit method | |
| CN105634732A (en) | Ciphertext domain multi-bit reversible information hiding method | |
| CN104618327A (en) | Realizing method for internet of things based on trusted operation order remote-control self-control device | |
| CN110704854B (en) | Stream type encryption method aiming at text data reserved format | |
| CN101010691A (en) | Systems and methods for digital content security | |
| CN104063672B (en) | Secure storage method of data | |
| CN109800585A (en) | A kind of image interpolation space completely reversibility separates ciphertext domain Information Hiding Algorithms | |
| CN105282090B (en) | A kind of open URL scrambled method of anti-unauthorized access on internet | |
| CN103873230A (en) | Single-direction encryption-decryption technology | |
| CN107086913A (en) | A kind of color 2 D code encipher-decipher method under high-dimension chaotic system | |
| CN105812146A (en) | MD5-based two-way encryption data protection method | |
| CN105637801A (en) | Polymorphic encryption key matrices | |
| CN104281815A (en) | Method and system for encrypting and decrypting file | |
| CN105095695A (en) | Realizing authorization via incorrect functional behavior of a white-box implementation | |
| Yoon et al. | Visual honey encryption: Application to steganography | |
| Firdaus et al. | Monitoring system with two central facilities protocol | |
| CN103093137A (en) | File safe distribution method based on universal series bus (USB) flash disk | |
| CN102571804A (en) | Internet of things center first login method based on product identification code | |
| CN108199836B (en) | Method and device for binding and unbinding key and equipment | |
| CN105281893A (en) | Method for introducing dependence of white-box implementation on a set of strings | |
| CN103457721B (en) | A kind of method and device of Mass production password | |
| CN109829322B (en) | Authorization information based real-time encryption and decryption method and system for digital media files |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20140618 |