CN111753317A - Method for realizing equal-length digital encryption - Google Patents
Method for realizing equal-length digital encryption Download PDFInfo
- Publication number
- CN111753317A CN111753317A CN202010486988.2A CN202010486988A CN111753317A CN 111753317 A CN111753317 A CN 111753317A CN 202010486988 A CN202010486988 A CN 202010486988A CN 111753317 A CN111753317 A CN 111753317A
- Authority
- CN
- China
- Prior art keywords
- value
- array
- plaintext
- digit
- key
- 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 42
- 238000006073 displacement reaction Methods 0.000 claims description 8
- 238000013499 data model Methods 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000009466 transformation Effects 0.000 description 2
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6209—Protecting access to data via a platform, e.g. using keys or access control rules to a single file or object, e.g. in a secure envelope, encrypted and accessed using a key, or with access control rules appended to the object itself
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/2107—File encryption
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Storage Device Security (AREA)
Abstract
The invention provides a method for realizing equal-length digital encryption, which comprises the following steps: the array value is shifted to the right by the binary representation digit number of the value, and then is added with 1 to obtain a module value after being added with the maximum module; the second step is that: the array value is exclusive-ored with the modulus value. The invention intercepts N (N takes values of 3, 6, 9 and 18) digit plaintext character strings in sequence by adopting a sectional encryption method, converts the N digit plaintext character strings into integers, and respectively stores the integers into an integer array, and the last digit of the integer array retains the remaining integers converted from the digit character strings which are less than N to obtain a plaintext integer array.
Description
Technical Field
The invention relates to the field of information security, in particular to a method for realizing equal-length digital encryption.
Background
The problem of information security is increasingly serious, but many online applications do not plan encryption transmission and storage of data at the initial design stage, symmetric encryption methods such as AES and DES and asymmetric encryption algorithms can cause ciphertext to be lengthened or contain non-digital characters, in many existing application scenes, a fixed-length digital expression mode is actually adopted, and a field type is defined in a data model to be a non-character type, so that after a result generated by a traditional encryption mode contains characters, a data exchange interface and a data model need to be comprehensively upgraded in system upgrading.
The present invention is intended to solve such problems: in the application of plaintext storage upgrading ciphertext storage, the data type and the data length do not need to be changed, and the data exchange interface and the data model do not need to be modified, so that the upgrading and the transformation of an online application system are facilitated.
Therefore, there is a need to provide an implementation method of equal-length digital encryption to solve the above technical problems.
Disclosure of Invention
The invention provides a method for realizing equal-length digital encryption, which solves the problems that in the existing plaintext storage process, a ciphertext is easily lengthened after upgrading, a data exchange interface needs to be modified, and the use by a user is inconvenient.
In order to solve the above technical problem, the present invention provides a method for implementing digital encryption with equal length, wherein the encryption method comprises the following steps:
s1, intercepting N (N takes values of 3, 6, 9 and 18) digit plaintext character strings in sequence, converting the N digit plaintext character strings into integers and storing the integers in an integer array respectively;
s2, from the first coordinate value of the plaintext array, adopting a segmented encryption method;
s3, calculating the maximum decimal value which cannot be represented by the character string length of the plaintext data, the binary representation digit number of the value, right-shifted binary representation digit number and then subtracted by 1 to be used as the maximum modulus;
s4, taking a non-5 integer less than half of binary representation bit number as displacement value, if the binary representation bit number is even number, the displacement value must be odd number;
s5, if the key is the first digit array, the remainder of the division of the key and the maximum decimal value is taken as the new key;
s6, adding the plaintext array and the key to obtain a new value, adding 1 to the maximum decimal value, storing the new value and the maximum decimal value in the array, and entering a plurality of cycles.
Preferably, the application SIZE of the array of integers in S1 is SIZE, where SIZE is plaintext string length Texcl/N + L, where I is 0 and L is Texcl.
Preferably, when L is larger than N, the first N bits of the plaintext string are intercepted, converted into numbers and stored until the coordinates are I
When I is equal to I + L, L is equal to L-N, and L is less than N, the plaintext string is converted into a number and stored in an integer group DATA with coordinates I, I is equal to 0, and L is equal to Texcl.
Preferably, when L > 0, the plaintext length Len ═ L < N of the array Data is acquired, then the encryption module is called, L ═ L-Len, Key ═ Key + Data [ I ], I ═ I + L, until L < 0, when L < 0 and SIZE > 1, Key ═ Data { SIZE-I }, then the encryption module is called, L ═ Texcl, I ═ 0 is obtained, and when L < 0 and SIZE < 1, L ═ Texcl, I ═ 0 is obtained directly.
Preferably, when L > 0, Len ═ L < N, Data [ I ] is preceded by 0, converted into a numeric character string, and the numeric character string is pieced to the end of the result string, L ═ L-Len, I ═ I + L, until L < 0, and when L < 0, the result string is stored.
Preferably, the maximum decimal Max (10, Len) -l that the plaintext length can represent, the maximum binary digit Bit number Bit (Log 2(Max) + l that the plaintext length can represent, and the maximum Max (1 < iLen) -l that does not overflow (decimal) after the exclusive or operation.
Preferably, the last bit of the integer array in S1 retains the remaining integers converted from the numeric character string with less than N bits, resulting in a plaintext integer array.
Preferably, in S4, an integer other than 5 less than half the value of the binary representation bit number is used as the shift value, and if the binary representation bit number is odd, the shift value must be even.
Preferably, if the last structure of S4 is not the first digit group in S5, the remainder of the key added to the last coordinate digit group value and divided by the maximum decimal value is used as the new key.
Preferably, the plurality of cycles in S6 includes four steps, wherein:
the first step is as follows: the array value is shifted to the right by the binary representation digit number of the value, and then is added with 1 to obtain a module value after being added with the maximum module;
the second step is that: the array value is exclusive-or' ed with the modulus value;
the third step: circularly right shifting the binary representation digit of the array value by a shift value until a new number not greater than the maximum decimal value is obtained;
the fourth step: and after the circulation is finished, the value of the last field is used as a key, and the same method is adopted for encrypting the characteristic number group.
Compared with the related technology, the method for realizing the equal-length digital encryption provided by the invention has the following beneficial effects:
the invention provides a method for realizing equal-length digital encryption,
1. according to the invention, by adopting a segmented encryption method, N (N takes values of 3, 6, 9 and 18) digit plaintext character strings are intercepted in sequence, converted into integers and stored in an integer array respectively, and the last digit of the integer array retains the remaining integers converted from the digit character strings which are less than N, so that a plaintext integer array is obtained, thus the purposes that the data type and length do not need to be changed, a data exchange interface and a data model do not need to be modified in the application of plaintext storage upgrading ciphertext storage by the existing long-digit encryption method are achieved, the upgrading and transformation of an online application system are facilitated, and the use of a user is more convenient;
2. the invention adopts the alternate use of binary system and decimal system, not only can save equipment, but also has more accurate calculation result and higher confidentiality, and simultaneously adopts a multi-cycle algorithm to finally obtain the secret key, thereby greatly improving the safety of the secret key.
Drawings
Fig. 1 is a main flow chart of a method for implementing digital encryption with equal length according to the present invention;
fig. 2 is a schematic diagram of a parameter algorithm flow of an encryption module of the method for implementing digital encryption with equal length according to the present invention.
Detailed Description
The invention is further described with reference to the following figures and embodiments.
Please refer to fig. 1 and fig. 2 in combination, wherein fig. 1 is a main flow chart of the method for implementing equal-length digital encryption according to the present invention; fig. 2 is a schematic diagram of a parameter algorithm flow of an encryption module of the method for implementing digital encryption with equal length according to the present invention. An implementation method of digital encryption with equal length comprises the following steps:
s1, intercepting N (N takes values of 3, 6, 9 and 18) digit plaintext character strings in sequence, converting the N digit plaintext character strings into integers and storing the integers in an integer array respectively;
s2, from the first coordinate value of the plaintext array, adopting a segmented encryption method;
s3, calculating the maximum decimal value that the character string length of the plaintext data can represent, the binary representation digit number of the value, right-shifting the binary representation digit number, and subtracting 1 as the maximum modulus;
s4, taking a non-5 integer less than half of binary representation bit number as displacement value, if the binary representation bit number is even number, the displacement value must be odd number;
s5, if the key is the first digit array, the remainder of the division of the key and the maximum decimal value is taken as the new key;
s6, adding the plaintext array and the key to obtain a new value, adding 1 to the maximum decimal value, storing the new value and the maximum decimal value in the array, and entering a plurality of cycles.
The application SIZE of the array of integers in S1 is SIZE, where SIZE is plaintext string length Texcl/N + L, where I is 0, and L is Texcl.
And when L is larger than N, intercepting N bits in the plaintext string, converting the N bits into numbers and storing the numbers into an integer array with the coordinate I, wherein when I is I + L, L is L-N, and when L is smaller than N, converting the plaintext string into numbers and storing the numbers into an integer array DATA with the coordinate I, I is 0, and L is Texcl.
When the L is greater than 0, the plaintext length Len of the array Data is acquired, L is less than N, then the encryption module is called, L is L-Len, Key is Key + Data [ I ], I is I + L, until L is less than 0, when L is less than 0 and SIZE is greater than 1, Key is Data { SIZE-I }, then the encryption module is called, L is Texcl, I is 0, when L is less than 0 and SIZE is less than 1, L is Texcl, and I is 0.
When L is greater than 0, Len is L < N, Data [ I ] is supplemented with 0 in front, converted into a numeric character string and spliced to the tail of the result string, L is L-Len, I is I + L until L is less than 0, and when L is less than 0, the result string is stored.
The maximum decimal Max (10, Len) -l can be represented by the plaintext length, the maximum binary digit Bit number (Log 2(Max) + l) can be represented by the plaintext length, and the maximum Max (1 < iLen) -l which does not overflow after the exclusive-or operation.
The last digit of the integer array in S1 retains the remaining integers converted from the numeric string less than N digits, resulting in a plaintext integer array.
In S4, an integer other than 5 less than half the binary representation bit number is used as the shift value, and if the binary representation bit number is odd, the shift value must be even.
And if the last structure of the S4 is not the first digit array in the S5, the remainder of the division between the key and the maximum decimal value after the key is added to the last coordinate digit array value is used as a new key.
The multiple cycles in S6 include four steps, wherein:
the first step is as follows: the array value is shifted to the right by the binary representation digit number of the value, and then is added with 1 to obtain a module value after being added with the maximum module;
the second step is that: the array value is exclusive-or' ed with the modulus value;
the third step: circularly right shifting the binary representation digit of the array value by a shift value until a new number not greater than the maximum decimal value is obtained;
the fourth step: and after the circulation is finished, the value of the last field is used as a key, and the same method is adopted for encrypting the characteristic number group.
The working principle of the method for realizing the equal-length digital encryption provided by the invention is as follows:
when in use, a user firstly intercepts N (N takes values of 3, 6, 9 and 18) digit plaintext character strings in sequence, converts the digit plaintext character strings into integers and stores the integers into an integer array respectively, the last digit of the integer array retains the remaining integers converted from the digit character strings less than N to obtain a plaintext integer array, then, from the first coordinate value of the plaintext array, a segmented encryption method is adopted to calculate the maximum decimal value which can be represented by the character string length of the section of plaintext data, the binary representation digit of the value, and 1 is subtracted after the binary representation digit is right shifted to be used as the maximum modulus, a non-5 integer which is less than half of the binary representation digit is used as a displacement value, if the binary representation digit is an even number, the displacement value must be an odd number, and vice versa, if the first digit array is used, the remainder of the division of the key and the maximum decimal value is used as a new key, otherwise, the remainder of the addition of the key and the last coordinate array value and the division of the key and the maximum decimal value is used as a new key, the new value obtained by the addition of the plaintext array and the key and the remainder obtained by adding 1 to the maximum decimal value are stored in the array, and the cycle is repeated:
the first step is as follows: the array value is shifted to the right by the binary representation digit number of the value, and then is added with 1 to obtain a module value after being added with the maximum module;
the second step is that: the array value is exclusive-or' ed with the modulus value;
the third step: circularly right shifting the binary representation digit of the array value by a shift value until a new number not greater than the maximum decimal value is obtained;
and after the circulation is finished, the value of the last field is used as a key, and the same method is adopted for encrypting the characteristic number group.
Compared with the related technology, the method for realizing the digital encryption with equal length provided by the invention has the following beneficial effects:
the invention intercepts N (N takes values of 3, 6, 9 and 18) digit plaintext character strings in sequence by adopting a sectional encryption method, converts the N digit plaintext character strings into integers, and respectively stores the integers into an integer array, and the last digit of the integer array retains the remaining integers converted from the digit character strings which are less than N to obtain a plaintext integer array.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (10)
1. An implementation method of digital encryption with equal length comprises the following steps:
s1, intercepting N (N takes values of 3, 6, 9 and 18) digit plaintext character strings in sequence, converting the N digit plaintext character strings into integers and storing the integers in an integer array respectively;
s2, from the first coordinate value of the plaintext array, adopting a segmented encryption method;
s3, calculating the maximum decimal value that the character string length of the plaintext data can represent, the binary representation digit number of the value, right-shifting the binary representation digit number, and subtracting 1 as the maximum modulus;
s4, taking a non-5 integer less than half of binary representation bit number as displacement value, if the binary representation bit number is even number, the displacement value must be odd number;
s5, if the key is the first digit array, the remainder of the division of the key and the maximum decimal value is taken as the new key;
s6, adding the plaintext array and the key to obtain a new value, adding 1 to the maximum decimal value, storing the new value and the maximum decimal value in the array, and entering a plurality of cycles.
2. The method for implementing equal-length digital encryption according to claim 1, wherein the application SIZE of the array of integers in S1 is SIZE, where SIZE is plaintext string length Texcl/N +1, where I is 0 and L is Texcl.
3. The method for implementing equal-length digital encryption according to claim 2, wherein when L > N, N bits before the plaintext string are intercepted and converted into a number to be stored in an integer array with coordinates I, where I ═ I +1, L ═ L-N, and when L < N, the plaintext string is converted into a number to be stored in an integer array DATA with coordinates I, I ═ 0, and L ═ Texcl.
4. The method for implementing isometric digital encryption according to claim 3, wherein when L > 0, the plaintext length Len ═ L < N of the array Data is obtained, then the encryption module is called, L ═ L-Len, Key ═ Key + Data [ I ], I ═ I + L, until L < 0, when L < 0 and SIZE > 1, Key ═ Data { SIZE-I }, then the encryption module is called, L ═ Texcl, I ═ 0 is obtained, and when L < 0 and SIZE < 1, L ═ Texcl, I ═ 0 is obtained directly.
5. The method of claim 4, wherein when L > 0, Len-L < N, and 0 is supplemented in front of Data [ I ] to convert the numeric character string to the end of the result string, L-Len, I-I + L, until L < 0, and when L < 0, the result string is saved.
6. The method for implementing equal-length digital encryption according to claim 1, wherein the maximum decimal Max (pow (10, Len) -1 can be represented by the plaintext length, the maximum binary Bit number Bit (Log) 2(Max) +1 can be represented by the plaintext length, and the maximum Max (Max) < ieln) -1 that does not overflow (decimal) after the exclusive or operation.
7. The method of claim 1, wherein the last bit of the integer array in S1 retains the remaining integers converted from the numeric string with less than N bits, resulting in a plaintext integer array.
8. The method for implementing equal-length digital encryption according to claim 1, wherein an integer other than 5 less than half the value of the binary representation bit number is taken as the shift value in S4, and if the binary representation bit number is odd, the shift value must be even.
9. The method for implementing equal-length digital encryption according to claim 1, wherein if the last structure of S4 is not the first digit array in S5, the remainder of the key added to the last coordinate digit array value and then divided by the maximum decimal value is used as the new key.
10. The method for implementing equal-length digital encryption according to claim 1, wherein said plurality of rounds in S6 includes four steps, wherein:
the first step is as follows: the array value is shifted to the right by the binary representation digit number of the value, and then is added with 1 to obtain a module value after being added with the maximum module;
the second step is that: the array value is exclusive-or' ed with the modulus value;
the third step: circularly right shifting the binary representation digit of the array value by a shift value until a new number not greater than the maximum decimal value is obtained;
the fourth step: and after the circulation is finished, the value of the last field is used as a key, and the same method is adopted for encrypting the characteristic number group.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010486988.2A CN111753317A (en) | 2020-05-27 | 2020-05-27 | Method for realizing equal-length digital encryption |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010486988.2A CN111753317A (en) | 2020-05-27 | 2020-05-27 | Method for realizing equal-length digital encryption |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111753317A true CN111753317A (en) | 2020-10-09 |
Family
ID=72674116
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010486988.2A Pending CN111753317A (en) | 2020-05-27 | 2020-05-27 | Method for realizing equal-length digital encryption |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111753317A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113572786A (en) * | 2021-08-05 | 2021-10-29 | 梁德群 | Method for encrypting and decrypting plaintext formed by binary intercepted words with different lengths |
| CN114459633A (en) * | 2022-04-11 | 2022-05-10 | 深圳中宝新材科技有限公司 | Data encryption and decryption method for anti-oxidation gold bonding wire equipment based on Internet of things |
| CN115333868A (en) * | 2022-10-14 | 2022-11-11 | 安徽华云安科技有限公司 | Symmetric encryption method, symmetric decryption method, symmetric encryption device, symmetric decryption device and symmetric encryption equipment based on odd-even round robin |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101378314A (en) * | 2008-09-26 | 2009-03-04 | 北京数字太和科技有限责任公司 | Method for generating key sequence and apparatus for generating cipher key |
| CN102707921A (en) * | 2011-02-17 | 2012-10-03 | Arm有限公司 | Leading zero prediction in floating point addition |
| CN103825723A (en) * | 2014-01-24 | 2014-05-28 | 深圳市太和物联信息技术有限公司 | Encryption method and device |
| CN105959098A (en) * | 2016-04-28 | 2016-09-21 | 东港股份有限公司 | Format-reserved encryption algorithm based on multi-segmented Feistel network |
| US20170034167A1 (en) * | 2015-07-30 | 2017-02-02 | Helder Silvestre Paiva Figueira | Method for a Dynamic Perpetual Encryption Cryptosystem |
| CN108768617A (en) * | 2018-06-06 | 2018-11-06 | 贵州大学 | A kind of holding format encryption method based on legacy packets password |
| US20210049935A1 (en) * | 2019-08-16 | 2021-02-18 | Informatica Llc | Method, apparatus, and computer-readable medium for format preserving encryption of a numerical value |
-
2020
- 2020-05-27 CN CN202010486988.2A patent/CN111753317A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101378314A (en) * | 2008-09-26 | 2009-03-04 | 北京数字太和科技有限责任公司 | Method for generating key sequence and apparatus for generating cipher key |
| CN102707921A (en) * | 2011-02-17 | 2012-10-03 | Arm有限公司 | Leading zero prediction in floating point addition |
| CN103825723A (en) * | 2014-01-24 | 2014-05-28 | 深圳市太和物联信息技术有限公司 | Encryption method and device |
| US20170034167A1 (en) * | 2015-07-30 | 2017-02-02 | Helder Silvestre Paiva Figueira | Method for a Dynamic Perpetual Encryption Cryptosystem |
| CN105959098A (en) * | 2016-04-28 | 2016-09-21 | 东港股份有限公司 | Format-reserved encryption algorithm based on multi-segmented Feistel network |
| CN108768617A (en) * | 2018-06-06 | 2018-11-06 | 贵州大学 | A kind of holding format encryption method based on legacy packets password |
| US20210049935A1 (en) * | 2019-08-16 | 2021-02-18 | Informatica Llc | Method, apparatus, and computer-readable medium for format preserving encryption of a numerical value |
Non-Patent Citations (3)
| Title |
|---|
| "SM4-FPE:基于SM4的数字型数据保留格式加密算法" * |
| 刘哲理等: "保留格式加密模型研究" * |
| 张玉磊等: "基于格式保留的敏感信息加密方案" * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113572786A (en) * | 2021-08-05 | 2021-10-29 | 梁德群 | Method for encrypting and decrypting plaintext formed by binary intercepted words with different lengths |
| CN114459633A (en) * | 2022-04-11 | 2022-05-10 | 深圳中宝新材科技有限公司 | Data encryption and decryption method for anti-oxidation gold bonding wire equipment based on Internet of things |
| CN115333868A (en) * | 2022-10-14 | 2022-11-11 | 安徽华云安科技有限公司 | Symmetric encryption method, symmetric decryption method, symmetric encryption device, symmetric decryption device and symmetric encryption equipment based on odd-even round robin |
| CN115333868B (en) * | 2022-10-14 | 2022-12-23 | 安徽华云安科技有限公司 | Symmetric encryption method, symmetric decryption method, symmetric encryption device, symmetric decryption device and symmetric encryption device based on odd-even round robin |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111753317A (en) | Method for realizing equal-length digital encryption | |
| Daemen | Cipher and hash function design strategies based on linear and differential cryptanalysis | |
| US8787563B2 (en) | Data converter, data conversion method and program | |
| CN107154851B (en) | Data encryption and decryption method and device | |
| CN110768785B (en) | Encoding and decoding methods, related devices and computer equipment | |
| MX2011001228A (en) | Method for generating a cipher-based message authentication code. | |
| CN108052805B (en) | Data encryption and decryption method and device | |
| CN115659409B (en) | Financial asset transaction data safe storage method | |
| WO2020168627A1 (en) | Encryption and decryption method and device employing zipper-type dynamic hashing and nlfsr techniques | |
| CN115276989A (en) | Serialized data encryption method based on direction scrambling | |
| CN110543778A (en) | linear random encryption and decryption algorithm for character data | |
| Pisarchik et al. | Chaotic map cryptography and security | |
| CN114124359A (en) | Method and device for preserving format encrypted data, electronic equipment and storage medium | |
| CN111614457B (en) | P replacement improvement-based lightweight packet encryption and decryption method, device and storage medium | |
| CN115714644B (en) | Random number generation method and device | |
| CN114826560B (en) | Lightweight block cipher CREF implementation method and system | |
| CN116010984A (en) | Multiple encryption storage method, device and equipment for relational database data | |
| CN115811398A (en) | Dynamic S-box-based block cipher algorithm, device, system and storage medium | |
| KR20010034058A (en) | Method for the cryptographic conversion of binary data blocks | |
| CN114285610A (en) | Method for encrypting and transmitting information | |
| CN113890722A (en) | Compressible six-dimensional nondegenerate hyperchaotic image security system and method | |
| Pieprzyk et al. | Rotation-symmetric functions and fast hashing | |
| CN110071927B (en) | Information encryption method, system and related components | |
| CN113541942A (en) | Digital content encryption and decryption method based on ARX white-box block cipher | |
| KR100350207B1 (en) | Method for cryptographic conversion of l-bit input blocks of digital data into l-bit output blocks |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20201009 |
|
| WD01 | Invention patent application deemed withdrawn after publication |