CN112887079A - Transformation encryption algorithm based on generation of random bit sequence - Google Patents
Transformation encryption algorithm based on generation of random bit sequence Download PDFInfo
- Publication number
- CN112887079A CN112887079A CN202110265844.9A CN202110265844A CN112887079A CN 112887079 A CN112887079 A CN 112887079A CN 202110265844 A CN202110265844 A CN 202110265844A CN 112887079 A CN112887079 A CN 112887079A
- Authority
- CN
- China
- Prior art keywords
- ciphertext
- random
- generating
- characters
- symbol
- 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/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0618—Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
- H04L9/0625—Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation with splitting of the data block into left and right halves, e.g. Feistel based algorithms, DES, FEAL, IDEA or KASUMI
-
- 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
- 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)
- Storage Device Security (AREA)
Abstract
The invention discloses a transformation encryption algorithm generated based on a random bit sequence, which relates to the technical field of bit sequence generation, and comprises the following specific steps: the method comprises the following steps: generating a random ciphertext; step two: the key number part encrypts a random 10-bit stream Y; step three: generating a header ciphertext; step four: generating a tail ciphertext; step five: generating a check code and a check ciphertext; step six: generating a true ciphertext; step seven: generating a false ciphertext; step eight: generating a judgment ciphertext; step nine: generating a final ciphertext, wherein the random ciphertext consists of two characters in the step one; the transformation encryption algorithm generated based on a random bit sequence can be used for multiple encryption, the confidentiality of a ciphertext can be improved, the risk of cracking can be reduced, the method can be used for increasing the safety on the basis of the traditional method without too much overhead, the use cost can be saved, and the method is convenient to popularize.
Description
Technical Field
The invention relates to the technical field of bit sequence generation, in particular to a transformation encryption algorithm based on a random bit sequence generation.
Background
Through retrieval, the Chinese patent number CN108270545A discloses an improved DES data encryption algorithm based on the mobile internet, and most of ciphertext generated by the encryption method is fixed and invariable, which provides possibility for some lawbreakers to decipher the ciphertext;
in order to improve the safety in the information transmission process, the encryption safety is increased. A changeable encryption method is designed, different ciphertexts are generated by a source secret key and a section of random bit sequence, and a plaintext is generated by decryption of the secret key during encryption during decryption, so that encryption in the information transmission process is realized.
Disclosure of Invention
The invention aims to solve the defects in the prior art, and provides a transformation encryption algorithm based on a random bit sequence generation.
In order to achieve the purpose, the invention adopts the following technical scheme:
the method comprises the following steps of generating a transformation encryption algorithm based on a random bit sequence:
the method comprises the following steps: generating a random ciphertext;
step two: the key number part encrypts a random 10-bit stream Y;
step three: generating a header ciphertext;
step four: generating a tail ciphertext;
step five: generating a check code and a check ciphertext;
step six: generating a true ciphertext;
step seven: generating a false ciphertext;
step eight: generating a judgment ciphertext;
step nine: and generating a final ciphertext.
As a further scheme of the present invention, in the step one, the random ciphertext is composed of two characters, the first character is called as random ciphertext 1, and the second character is called as random ciphertext 2.
As a further scheme of the present invention, the format of the key in step two is aaa.aaa.0000; wherein, the first point is preceded by capital English letters, the space between the first point and the second point is lowercase English letters, and the last point is a number, and the length of the number is more than or equal to 4 digits, and the bit stream Y encryption needs to obtain five data from Y' during encryption: carry symbol Move, shift symbol Move _0, true and false symbol Or, carry direction symbol MoveDir and transform symbol Change;
wherein, carry symbol: converting the first five 2-bit number of Y' into a 10-bit number to obtain a number as a carry symbol;
shifting symbol: converting the 2-bit 2-system number of the sixth bit and the seventh bit of Y' into a 10-system obtained number;
true and false symbols: is the eighth digit of Y';
carry direction symbol: is the ninth digit of Y';
and (3) transforming the symbol: the tenth digit of Y'.
As a further scheme of the present invention, the header ciphertext in step three is obtained by encrypting a first part of uppercase english characters of a key, and 3 random numbers are generated when each character is encrypted according to a principle of only advancing and not moving: r, R1 and R2; and in the fourth step, the tail ciphertext is obtained by encrypting the lower case English characters of the second part of the key and follows the principle of only moving without entering.
As a further scheme of the present invention, the generating step of the check code in step five is as follows:
s1: comparing the generated head ciphertext with the characters of the first part of the key one by one;
s2: comparing the generated tail ciphertext with the second part of the key one by one;
s3: combining the two check codes;
s4: the check codes are divided into five groups, and if the last group is less than five, 0 is added to complement five;
and the check ciphertext is obtained by combining check characters generated by each group of check codes.
As a further scheme of the present invention, the true ciphertext is formed by combining all true ciphertext characters in step six, the true ciphertext character is formed by encrypting each character of the original text one by one, and the encryption process of each character follows the principle of moving first and then advancing; and seventhly, the false ciphertext is used for disturbing the occurrence probability of the characters, and the number of the characters of the false ciphertext is the same as that of the characters of the true ciphertext.
As a further scheme of the present invention, the judgment ciphertext in step eight is 2 characters, and the judgment ciphertext is located after the tail ciphertext, and the format of the final ciphertext in step nine is: the head ciphertext + the true ciphertext + the random ciphertext 1+ the check ciphertext + the random ciphertext 2+ the tail ciphertext + the judge ciphertext.
Compared with the prior art, the invention has the beneficial effects that:
the transformation encryption algorithm generated based on a random bit sequence can be used for multiple encryption, the confidentiality of a ciphertext can be improved, the risk of cracking can be reduced, the method can be used for increasing the safety on the basis of the traditional method without too much overhead, the use cost can be saved, and the method is convenient to popularize.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention and not to limit the invention.
FIG. 1 is a block flow diagram of the present invention;
FIG. 2 is a schematic diagram of the present invention;
FIGS. 3 and 4 are both diagrams showing the encryption process of the present invention;
fig. 5 and 6 are both display diagrams of the decryption process of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments.
In the description of the present invention, it is to be understood that the terms "upper", "lower", "front", "rear", "left", "right", "top", "bottom", "inner", "outer", and the like, indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings, are merely for convenience in describing the present invention and simplifying the description, and do not indicate or imply that the device or element being referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus, should not be construed as limiting the present invention.
Referring to fig. 1 to 6, a transform cipher algorithm generated based on a random bit sequence includes the following specific steps:
the method comprises the following steps: generating a random ciphertext;
step two: the key number part encrypts a random 10-bit stream Y;
step three: generating a header ciphertext;
step four: generating a tail ciphertext;
step five: generating a check code and a check ciphertext;
step six: generating a true ciphertext;
step seven: generating a false ciphertext;
step eight: generating a judgment ciphertext;
step nine: and generating a final ciphertext.
In the first step, the random ciphertext consists of two characters, the first character is called as random ciphertext 1, the second character is called as random ciphertext 2, a section of bit data stream Y with 10 bits is randomly generated at the beginning, the first five-bit 2-system number of Y is converted into a 10-system number which is 18 if Y is 1001011010, then a number (0 or 1) is randomly generated, the random ciphertext 1 is 0 and is a lowercase symbol corresponding to 18, and the random ciphertext 1 is 1 and is an uppercase symbol corresponding to 18; the 10-bit conversion of the last five bits is carried out to obtain a value 26, and then a number (0 or 1) is randomly generated, wherein the value is 0, the random ciphertext 2 is a lowercase symbol corresponding to 26, and the value is 1, the random ciphertext 2 is an uppercase symbol corresponding to 28. Assuming that the random numbers generated twice are respectively 0 and 1, the generated random ciphertext is pZ.
The format of the secret key in the second step is AAA.aaa.0000; wherein, the first point is preceded by capital English letters, the space between the first point and the second point is lowercase English letters, and the last point is a number, the length of the number is more than or equal to 4 digits, and when no encryption key is input, the default key is S.yf.1997216;
taking the digital portion 1997216 of the default key as an example, converting each digit except 8 and 9 to a three-digit 2-ary number, with 8 and 9 being temporarily replaced by X, 1997216 may be converted to
001 X X 111 010 001 110
Comparing the number of 0 with the number of 1, if the number of 0 is more than the number of 1, converting 8 into 101, and converting 9 into 010; when the number of 1 s is larger than that of 0 s, 8 is converted to 010 and 9 is converted to 101.
If the number of 1 s is greater than 0 s, 9 s is converted to 101 s, and 1997216 s is completely converted to
001 101 101 111 010 001 110
Then obtained by bitwise exclusive or of the Y-1001011010 sequence and its shift
Y’＝10111 00111
Five data are needed from Y' in encryption: carry symbol Move, shift symbol Move _0, true and false symbol Or, carry direction symbol MoveDir and transform symbol Change;
wherein, carry symbol: converting the first five 2-digit number of Y' into a 10-digit number to obtain a number as a carry symbol, and setting Move to 23 (if the Move is calculated to be 0 according to the above rule, the Move needs to be set to 15);
shifting symbol: converting 2-digit numbers of the sixth bit and the seventh bit of Y' into 10-digit numbers to obtain a number of Move _0 ═ 0 (if Move _0 is calculated to be 0 according to the rule, Move _0 is required to be 1), so Move _0 ═ 1;
true and false symbols: is the eighth digit of Y', Or 1
Carry direction symbol: is the ninth digit of Y', MoveDir ═ 1
And (3) transforming the symbol: the tenth digit of Y' is 1.
The first part of capitalization english characters of the key are encrypted to obtain the middle-header ciphertext in the third step, and 3 random numbers (0 or 1) are generated when each character is encrypted according to the principle of only advancing and not moving: r, R1, R2 (assuming that the three random numbers generated are 010, respectively)
The encryption rules are compared to the following table:
in comparison with the table above, the number of the lowercase characters that need to be subtracted by Move 23 (if the number of the lowercase characters is smaller than 0, 32 needs to be added, and 3 is a fixed number) is the encrypted ciphertext.
Encrypting a capital English character S (the number is 21) of a first part of a default password:
21-23+32＝30
the lower case character of number 30 is "-".
Therefore, the header cryptograph is'
Character code comparison table:
| encoding | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| Capital writing | ( | { | [ | A | B | C | D | E | F | G | H | I | J | K | L | M |
| Lower case | ) | } | ] | a | b | c | d | e | f | g | h | i | j | k | l | m |
| Encoding | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 |
| Capital writing | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | . | + | * |
| Lower case | n | o | p | q | r | s | t | u | v | w | x | y | z | _ | - | / |
The middle-tail ciphertext of the step four is obtained by encrypting the lower case English character of the second part of the key according to the move-only and no-move principle, wherein the lower case English character of the second part of the key is yf:
taking y as an example:
y corresponds to number 27 (conversion to binary number 11011)
A randomly generated one-bit bitstream Q is preceded by: q11011 (assuming that the generated Q is 0 at this time) is 011011
Move each bit of 011011 to the right, Move _0 to 1 bit, the lowest bit to the highest bit: 101101
The last five digits are numbered as 01101, and converted into decimal 13
If Change is 1, the highest position is 1, and corresponds to an uppercase character, otherwise, the highest position corresponds to a lowercase character;
if Change is 0, the highest bit is 1, and the lower case character is corresponded, otherwise, the upper case character is corresponded.
In the above example, the most significant bit is 1, and Change is 1, so the converted tail ciphertext is the uppercase character 'K' corresponding to number 13.
Let f be '_' after the above rule change. The resulting tail ciphertext is K _.
The generation steps of the check code in the step five are as follows:
s1: comparing the generated head ciphertext with the characters of the first part of the key one by one, and if the number of the head ciphertext characters is greater than that of the characters of the first part of the key, marking 1, otherwise, marking 0;
s2: comparing the generated tail ciphertext with the second part of the key one by one, and if the number of the tail ciphertext is greater than that of the second part of the key, marking 1, otherwise, marking 0;
s3: combining the two check codes;
s4: the check codes are divided into five groups, and if the last group is less than five, 0 is added to complement five;
each group of check codes is regarded as binary number, converted into decimal number, combined with a randomly generated number (0 or 1), and if the random number is 0, the corresponding check character is the lower case character of the corresponding number; if the number is 1, the corresponding check character is the capital character of the corresponding number;
10100 is converted into a 10-system number of 20, if the generated random number is 1, the check character is 'R';
the check ciphertext is obtained by combining check characters generated by each group of check codes;
the above example has only one set of check codes, so the check ciphertext is 'R'.
In the sixth step, the true ciphertext is formed by combining all true ciphertext characters, the true ciphertext characters are formed by encrypting each character of the original text one by one, and the encryption process of each character follows the principle of moving first and then advancing;
the shifting process is consistent with the tail ciphertext forming process;
the further process is slightly different from the header ciphertext formation process:
whether Move is added or subtracted is determined by the MoveDir and whether the shift is capital or lowercase; the encrypted case is the same as the shifted case:
the character formed in the process of execution is the encrypted ciphertext;
and seventhly, the false ciphertext is used for disturbing the occurrence probability of the characters, the number of the false ciphertext characters is the same as that of the true ciphertext characters, Or determines whether the false ciphertext characters are on the left side Or the right side of the true ciphertext characters (Or 1, the false ciphertext characters are on the right side of the true ciphertext characters, and the false ciphertext characters are on the left side of the true ciphertext characters), the occurrence frequency of the true ciphertext characters is counted, and the characters with the minimum occurrence frequency are preferentially considered as the false ciphertext characters.
The specific format is shown in the following table:
and step eight, judging that the ciphertext is 2 characters, judging that the ciphertext is positioned behind the tail ciphertext, and performing multiple encryption by using the encryption algorithm, namely encrypting the encrypted ciphertext again.
In order to prevent the ciphertext from being excessively long due to repeated generation of the false ciphertext, two characters with different numbers are randomly added behind the tail ciphertext which is encrypted once, and when encryption is carried out, if the numbers of the last two characters of the input content to be encrypted are judged to be inconsistent, the false ciphertext is not generated;
the format of the final ciphertext in the ninth step is as follows: the head ciphertext + the true ciphertext (if a false ciphertext is generated, the false ciphertext is included) + the random ciphertext 1+ the check ciphertext + the random ciphertext 2+ the tail ciphertext + the judge ciphertext.
Through the technical scheme: the transformation encryption algorithm generated based on a random bit sequence can be used for multiple encryption, the confidentiality of a ciphertext can be improved, the risk of cracking can be reduced, the method can be used for increasing the safety on the basis of the traditional method without too much overhead, the use cost can be saved, and the method is convenient to popularize.
The working principle and the using process of the invention are as follows: firstly, generating a random ciphertext, wherein the random ciphertext is composed of two characters, the first character is called a random ciphertext 1, the second character is called a random ciphertext 2, then encrypting a part of secret key numbers by a random 10-bit stream Y, then generating a head ciphertext, the head ciphertext is obtained by encrypting a first part of uppercase English characters of a secret key and then generating a tail ciphertext according to a move-only and non-move principle, the tail ciphertext is obtained by encrypting a second part of lowercase English characters of the secret key and compares the generated head ciphertext with the characters of the first part of the secret key one by one according to the move-only and non-move principle, the generated tail ciphertext and the characters of the second part of the secret key are compared one by one, then combining the check codes of the two parts, separating five check codes into a group, thereby generating check codes, and the check ciphertext is the check characters generated by each group of the check codes are combined together, and then generating a true ciphertext and a false ciphertext, judging that the ciphertext is 2 characters, judging that the ciphertext is positioned behind a tail ciphertext, and finally forming a final ciphertext to transmit, thereby realizing the encryption in the information transmission process.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art should be considered to be within the technical scope of the present invention, and the technical solutions and the inventive concepts thereof according to the present invention should be equivalent or changed within the scope of the present invention.
Claims (7)
1. The transformation encryption algorithm generated based on a random bit sequence is characterized by comprising the following specific steps of:
the method comprises the following steps: generating a random ciphertext;
step two: the key number part encrypts a random 10-bit stream Y;
step three: generating a header ciphertext;
step four: generating a tail ciphertext;
step five: generating a check code and a check ciphertext;
step six: generating a true ciphertext;
step seven: generating a false ciphertext;
step eight: generating a judgment ciphertext;
step nine: and generating a final ciphertext.
2. The transform cipher algorithm according to claim 1, wherein the random cipher text in step one is composed of two characters, the first character is called random cipher text 1, and the second character is called random cipher text 2.
3. The transform encryption algorithm based on a random bit sequence generation of claim 1, wherein the format of the key in step two is aaa.aaa.0000; wherein, the first point is preceded by capital English letters, the space between the first point and the second point is lowercase English letters, and the last point is a number, and the length of the number is more than or equal to 4 digits, and the bit stream Y encryption needs to obtain five data from Y' during encryption: carry symbol Move, shift symbol Move _0, true and false symbol Or, carry direction symbol MoveDir and transform symbol Change;
wherein, carry symbol: converting the first five 2-bit number of Y' into a 10-bit number to obtain a number as a carry symbol;
shifting symbol: converting the 2-bit 2-system number of the sixth bit and the seventh bit of Y' into a 10-system obtained number;
true and false symbols: is the eighth digit of Y';
carry direction symbol: is the ninth digit of Y';
and (3) transforming the symbol: the tenth digit of Y'.
4. The transform encryption algorithm based on a random bit sequence generation of claim 1, wherein the header ciphertext is obtained by encrypting a first part of capital English characters of a key in step three, and 3 random numbers are generated when each character is encrypted according to a forward-only and backward-not-shift principle: r, R1 and R2; and in the fourth step, the tail ciphertext is obtained by encrypting the lower case English characters of the second part of the key and follows the principle of only moving without entering.
5. The transform cipher algorithm according to claim 1, wherein the check code is generated in step five as follows:
s1: comparing the generated head ciphertext with the characters of the first part of the key one by one;
s2: comparing the generated tail ciphertext with the second part of the key one by one;
s3: combining the two check codes;
s4: the check codes are divided into five groups, and if the last group is less than five, 0 is added to complement five;
and the check ciphertext is obtained by combining check characters generated by each group of check codes.
6. The transform encryption algorithm based on a random bit sequence generation of claim 1, wherein the true ciphertext is formed by combining all true ciphertext characters, the true ciphertext characters are formed by encrypting each character of the original text one by one, and the encryption process of each character follows a principle of moving first and then advancing; and seventhly, the false ciphertext is used for disturbing the occurrence probability of the characters, and the number of the characters of the false ciphertext is the same as that of the characters of the true ciphertext.
7. The transform cipher algorithm of claim 1, wherein the judgment ciphertext is 2 characters in step eight and the judgment ciphertext is located after the tail ciphertext, and the final ciphertext in step nine is in the format of: the head ciphertext + the true ciphertext + the random ciphertext 1+ the check ciphertext + the random ciphertext 2+ the tail ciphertext + the judge ciphertext.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110265844.9A CN112887079B (en) | 2021-03-11 | 2021-03-11 | Transformation encryption algorithm based on generation of random bit sequence |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110265844.9A CN112887079B (en) | 2021-03-11 | 2021-03-11 | Transformation encryption algorithm based on generation of random bit sequence |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112887079A true CN112887079A (en) | 2021-06-01 |
| CN112887079B CN112887079B (en) | 2022-10-04 |
Family
ID=76041390
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110265844.9A Active CN112887079B (en) | 2021-03-11 | 2021-03-11 | Transformation encryption algorithm based on generation of random bit sequence |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112887079B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1994021066A1 (en) * | 1993-03-05 | 1994-09-15 | Telstra Corporation Limited | A method and apparatus for generating a digital message authentication code |
| EP0658022A2 (en) * | 1993-12-06 | 1995-06-14 | International Business Machines Corporation | Cryptographic key generation using sequential concatenation |
| JPH1093548A (en) * | 1996-09-17 | 1998-04-10 | Aionikusu Okinawa Kk | Pseudo random bit stream generator and ciphering communication method using the same |
| CN101262334A (en) * | 2008-04-17 | 2008-09-10 | 中国人民解放军海军工程大学 | Encryption method for Bluetooth data transmission |
| JP2012177893A (en) * | 2011-02-01 | 2012-09-13 | Waseda Univ | Encryption processing system, encryption device, decryption device, program, and encryption processing method |
| US8300824B1 (en) * | 2004-04-08 | 2012-10-30 | Cisco Technology, Inc. | System and method for encrypting data using a cipher text in a communications environment |
| WO2014007347A1 (en) * | 2012-07-05 | 2014-01-09 | 株式会社クリプト・ベーシック | Shared secret key generation device, encryption device, decryption device, shared secret key generation method, encryption method, decryption method, and program |
| WO2014174044A1 (en) * | 2013-04-24 | 2014-10-30 | Nec Europe Ltd. | Method and system for encrypting data |
| EP2835932A1 (en) * | 2012-04-02 | 2015-02-11 | Crypto Basic Corporation | Encryption device, decryption device, encryption method, decryption method, and program |
| CN108833733A (en) * | 2018-06-04 | 2018-11-16 | 河南师范大学 | A kind of decryption method of the resume image based on chaos S box |
| CN109218013A (en) * | 2018-10-10 | 2019-01-15 | 青岛科技大学 | Cover the binary data communication encryption method on plaintext symbol boundary |
| CN111970693A (en) * | 2020-08-06 | 2020-11-20 | 哈尔滨工业大学 | Low-complexity LoRa Internet of things safety encryption method based on physical layer waveforms |
-
2021
- 2021-03-11 CN CN202110265844.9A patent/CN112887079B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1994021066A1 (en) * | 1993-03-05 | 1994-09-15 | Telstra Corporation Limited | A method and apparatus for generating a digital message authentication code |
| EP0658022A2 (en) * | 1993-12-06 | 1995-06-14 | International Business Machines Corporation | Cryptographic key generation using sequential concatenation |
| JPH1093548A (en) * | 1996-09-17 | 1998-04-10 | Aionikusu Okinawa Kk | Pseudo random bit stream generator and ciphering communication method using the same |
| US8300824B1 (en) * | 2004-04-08 | 2012-10-30 | Cisco Technology, Inc. | System and method for encrypting data using a cipher text in a communications environment |
| CN101262334A (en) * | 2008-04-17 | 2008-09-10 | 中国人民解放军海军工程大学 | Encryption method for Bluetooth data transmission |
| JP2012177893A (en) * | 2011-02-01 | 2012-09-13 | Waseda Univ | Encryption processing system, encryption device, decryption device, program, and encryption processing method |
| US20150110269A1 (en) * | 2012-04-02 | 2015-04-23 | Crypto Basic Corporation | Encryption device, decryption device, encryption method, decryption method, and program |
| EP2835932A1 (en) * | 2012-04-02 | 2015-02-11 | Crypto Basic Corporation | Encryption device, decryption device, encryption method, decryption method, and program |
| WO2014007347A1 (en) * | 2012-07-05 | 2014-01-09 | 株式会社クリプト・ベーシック | Shared secret key generation device, encryption device, decryption device, shared secret key generation method, encryption method, decryption method, and program |
| WO2014174044A1 (en) * | 2013-04-24 | 2014-10-30 | Nec Europe Ltd. | Method and system for encrypting data |
| CN108833733A (en) * | 2018-06-04 | 2018-11-16 | 河南师范大学 | A kind of decryption method of the resume image based on chaos S box |
| CN109218013A (en) * | 2018-10-10 | 2019-01-15 | 青岛科技大学 | Cover the binary data communication encryption method on plaintext symbol boundary |
| CN111970693A (en) * | 2020-08-06 | 2020-11-20 | 哈尔滨工业大学 | Low-complexity LoRa Internet of things safety encryption method based on physical layer waveforms |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112887079B (en) | 2022-10-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101461173B (en) | Method of homonymous substation symmetric encryption | |
| CN110299989B (en) | Encryption and decryption method for Chinese and English character strings | |
| JPH04365240A (en) | Ciphering system and ciphering method | |
| CN116032474B (en) | Safety protection system based on big data computer network | |
| CN109861810B (en) | Data encryption method and decryption method based on chaotic block encryption algorithm | |
| CN110768785B (en) | Encoding and decoding methods, related devices and computer equipment | |
| US20070189518A1 (en) | 3-D quaternion quantum fractal encryption | |
| CN113572786B (en) | Method for encrypting and decrypting plaintext formed by binary intercepted words with different lengths | |
| US10225074B2 (en) | Encryption system and method based on biometric technology | |
| CN105790930A (en) | Information encryption method and information encryption device used for mobile terminal and mobile terminal | |
| CN116094836B (en) | Router data secure storage method and system based on symmetric encryption | |
| Aung et al. | A complex transformation of monoalphabetic cipher to polyalphabetic cipher:(Vigenère-Affine cipher) | |
| CN112118097B (en) | Symmetric key encryption method | |
| EP0421754B1 (en) | Block substitution based encryption by a modulo 2 addition method and apparatus | |
| CN116418481A (en) | Text privacy data double encryption protection method, device and equipment | |
| CN116155620A (en) | Transaction data secure transmission method for card reader | |
| Sermeno et al. | Modified Vigenere cryptosystem: An integrated data encryption module for learning management system | |
| CN106504180A (en) | Image encryption error correction method based on DNA encoding | |
| CN103310157B (en) | Based on the image encryption method of RT-DNA cellular automaton | |
| CN112769545B (en) | Image encryption method based on adjacent pixel Joseph transformation and Mealy state machine | |
| CN112887079B (en) | Transformation encryption algorithm based on generation of random bit sequence | |
| CN116192507A (en) | Information hiding method based on deep learning | |
| CN107493164B (en) | DES encryption method and system based on chaotic system | |
| CN110061832B (en) | Method for realizing symmetric cipher algorithm using Chinese character as cipher | |
| CN110247754B (en) | Method and device for realizing block cipher FBC |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230815 Address after: No. 11 Qingyang North Road, Qinglong Street, Tianning District, Changzhou City, Jiangsu Province, 213000 Patentee after: Changzhou Weiren Digital Technology Co.,Ltd. Address before: No. 66 Changjiang West Road, Huangdao District, Qingdao City, Shandong Province, 266580 Patentee before: CHINA University OF PETROLEUM (EAST CHINA) |
|
| TR01 | Transfer of patent right |