CN115664827A - Data encryption method, device and medium based on front-bit key - Google Patents
Data encryption method, device and medium based on front-bit key Download PDFInfo
- Publication number
- CN115664827A CN115664827A CN202211340213.XA CN202211340213A CN115664827A CN 115664827 A CN115664827 A CN 115664827A CN 202211340213 A CN202211340213 A CN 202211340213A CN 115664827 A CN115664827 A CN 115664827A
- Authority
- CN
- China
- Prior art keywords
- character
- key
- plaintext
- bit
- ciphertext
- 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
Images
Landscapes
- Storage Device Security (AREA)
Abstract
The application discloses a data encryption method, a system and a device based on a front-bit key, wherein a front-bit plaintext key Kp and/or a front-bit ciphertext key Kc are adopted, and the total number of mod character set characters = ciphertext characters for each character in a plaintext according to an encryption algorithm of (plaintext character + key character + front-bit plaintext key character real value + front-bit ciphertext key character real value + \8230;) mod character set character total number = ciphertext characters, relative front-bit characters of information are used as dynamic variable factors to participate in an encryption algorithm of relative rear-bit characters, a plurality of same information plaintexts can be encrypted into different ciphertexts due to different relative front-bit characters, and a plurality of same characters in the information plaintexts can be respectively encrypted into any characters with different character set offsets. The data encryption method has the advantages that the occurrence probability of characters in the information ciphertext is disordered, and the difficulty of decoding the encrypted information by a frequency analysis method is greatly improved.
Description
Technical Field
The present application relates to the field of information security technologies, and in particular, to a data encryption method, apparatus, and medium.
Background
Virginia cipher is an encryption algorithm that uses a series of Caesar ciphers to form a cipher alphabet, and belongs to a simple form of multi-table cipher. In the Caesar cipher, all the letters in the plain text are shifted backward (or forward) in the alphabet by a fixed number and then replaced with the cipher text, for example, when the shift is 3, all the letters A will be replaced with D, B will be changed to E, and so on. The Virginia code is composed of multiple Caesar codes with different offsets.
The Virginia cipher deciphering process includes the first obtaining cipher key length through Cassiesky test and Friedman test, the subsequent splitting cipher text into several sets of Caesar ciphers based on the cipher key length and final obtaining cipher key with frequency analysis. The above introduction is extracted from Baidu encyclopedia "Virginia code" and "Caesar code".
According to the above description, after a sufficient amount of ciphertext data is obtained, the ciphertext data can be decoded by a frequency analysis method.
Disclosure of Invention
In order to improve the difficulty of decoding the encrypted information by a frequency analysis method, the method improves on the basis of using Virginia passwords for reference, and discloses a data encryption method, a device and a medium based on a front-bit key.
The technical scheme adopted by the application for solving the technical problem comprises the following procedures and steps:
a1, data encryption process (as shown in figure 1)
a1.1, selecting a specified character set (e.g., ASCII, GB2312, unicode, etc.) or a self-coding character set range, and marking each character position index by incrementing 1 from 0 in the character set coding order, e.g., for ease of description and understanding, the present application uses the self-coding character set range A-Z to mark each character position index by 0-25 for example;
a1.2, a step S01 of generating random characters by a random character generator: generating a random character string R with preset rules, wherein the preset rules can be as follows: generating a random character string R ending with a specified character string (for example, ending with a character string "O"/"W"/"AO"/"REN")/generating a random character string R of a specified number of characters (for example, the number of characters is 5), etc., which functions to identify the split random character string R, the first plaintext P1 portion in the data decryption flow;
a1.3, splicing the random character string R and the first plaintext P1 together according to the sequence S02, and outputting a second plaintext P2 containing the spliced random character string;
a1.4, encryption step S03:
a1.4.1, creating a two-dimensional table, which is divided into a header line and a content line, where the key set Klist includes one or more preset sub-items (for example, a certain sub-item may be a key K/a preceding-bit plaintext key Kp/a second preceding-bit plaintext key Kp/a preceding-bit ciphertext key Kc/a second preceding-bit ciphertext key Kc, etc.), and the key set Klist includes at least sub-items of the preceding-bit plaintext key Kp or the preceding-bit ciphertext key Kc, each cell is filled with one character, and each header line is sequentially filled with each sub-item in the key set Klist; filling a second plaintext P2 into cells in a content row of the two-dimensional table;
a1.4.2, calculating each cell filling character of a second plaintext P2 in the content row according to an encryption algorithm of (plaintext character + key character + real value of front plaintext key character + real value of front ciphertext key character + \8230;) mod character set total character number = ciphertext character), and finally outputting a ciphertext C;
a2, data decryption process (as shown in FIG. 2)
a2.1, selecting a character set which is the same as the data encryption process, and then performing the step a 1.1;
a2.2, decryption step S04:
a2.2.1, making a two-dimensional table, filling a title line with a key set Klist and a1.4.1, and filling a ciphertext C into cells in a content line of the two-dimensional table;
a2.2.2, calculating each cell filling character of the ciphertext C in the content row according to a decryption algorithm of (ciphertext character-key character-front-bit plaintext key character real value-front-bit ciphertext key character real value- \8230;) mod character set total number of characters = plaintext characters), and outputting a second plaintext P2;
a2.3, deleting the random character string spliced in the second plaintext P2, and S05: a random character string R in the second plaintext P2 that matches a predetermined rule for the first time (for example, a string "O"/"W"/"AO"/"REN" is set to end in advance in the example of a 1.2) is deleted, and the first plaintext P1 is finally output.
It can be known that "mod" above is a modulo operator, e.g., 28 mod 26=2,6 mod 26=6, -6 mod 26=20.
It can be known that, in the above encryption algorithm/decryption algorithm, whether the key character/the real value of the preceding plaintext key character/the real value of the preceding ciphertext key character, etc. exist depends on whether the corresponding sub-item in the key set Klist exists.
It can be known that, in the above encryption algorithm/decryption algorithm, the "plaintext character" is a certain bit character in the second plaintext P2, the character in the header line key K corresponding to the same column is a "key character", the character in the header line preceding bit plaintext key Kp is a "preceding bit plaintext key character", and the character in the header line preceding bit ciphertext key Kc is a "preceding bit ciphertext key character". The function of the "front plaintext key character" is to obtain the character of the second digit (counting from 0) of the character string in the reverse order before a certain character in the second plaintext P2, and if the total number of characters of the previous character string is exceeded, the counting is repeated in a cycle, and the obtained character is the "real value of the front plaintext key character"; the function of the front ciphertext key character is to acquire the characters (counted from 0) of the reverse order of the character string before a certain character in the ciphertext C, if the total number of the characters of the character string before the certain character is exceeded, the characters are counted repeatedly in a circulating way, and the acquired characters are the real values of the front ciphertext key character. The counting algorithm of the total number of characters of the character string before the front-bit plaintext key character or the front-bit ciphertext key character mod = the number of the reverse order of the previous character string can be adopted to quickly calculate.
For example, in the example of fig. 3, if the second plaintext P2"NIHAO \8230;" 5 th character is "O" (position index = 14), the preceding 4-bit string thereof is "NIHA" (corresponding to the ciphertext C is "LUIX"), the character in the title line key K corresponding to the 5 th character "O" in the same column is the key character "U" (position index = 20), the character in the title line preceding plaintext key Kp is the preceding plaintext key character "D" (position index = 3), and the character in the title line preceding ciphertext key Kc is the preceding ciphertext key character "S" (position index = 18). Substituting the example front-bit plaintext key character "D" into a solution according to the counting algorithm: "3 mod 4=3", where the 3 rd bit in the reverse order of the second plaintext P2"NIHA" is "N", and the "actual value of the preceding plaintext key character" is "N" (position index = 13); substituting the above example front-bit cipher text key character "S" into the solution: "18 mod 4=2", the reverse 2 nd bit of the ciphertext C "LUIX" is "U", and the "preceding ciphertext key character real value" is "U" (position index = 20). According to the above encryption algorithm, the above example is substituted into the solution: "(14 +20+13+ 20) mod 26=15", and the 5 th bit ciphertext character is determined to be "P" (position index = 15). In the example of fig. 4, according to the decryption algorithm (and not described in detail in the same way as the encryption algorithm), if the ciphertext C "LUIXP \8230; (where the previous 4-bit string" LUIX "corresponds to the second plaintext P2 being" NIHA ") is known, the above example is substituted into the solution: "(15-20-13-20) mod 26=14", the 5 th digit "plaintext character" is determined to be "O" (position index = 14).
Further, the key set Klist includes a front-bit plaintext key Kp and a front-bit ciphertext key Kc sub-item.
Further, in the data encryption/decryption process, the random string R portion in the second plaintext P2 and the first plaintext P1 portion are encrypted by different data encryption methods, for example, the random string R portion is processed by using a Caesar cipher, and the first plaintext P1 portion is calculated according to an encryption algorithm of "(plaintext character + key character + pre-position plaintext key character real value) mod character set character total number = ciphertext character".
Further, in the data encryption process, the total number of characters > = the preset minimum number of the random character string R and the first plaintext P1, and the insufficient number is complemented by the random character string R. For example, the preset minimum number =100, and if the number of characters of the first plaintext P1 =20, the random character generator generates a random character string R of at least 80 characters; if the number of characters of the first plaintext P1 =120, the number of characters of the random character string R generated by the random character generator is not limited.
Further, the data encryption/decryption process does not generate or use the random character string R, i.e. does not include steps a1.2, a1.3, and a2.3, the first plaintext P1 is directly subjected to the encryption step S03, and the decryption step S04 directly outputs the first plaintext P1.
Further, the position indexes of the sub-items in the key set Klist are not continuous or repetitive, for example, the continuous front plaintext key Kp is "BCDEF" or "FEDCB", and the repetitive front plaintext key Kp is "BBBBB".
Further, the data encryption process is repeatedly executed for multiple rounds, that is, the output ciphertext C is used as the first plaintext P1 to perform the data encryption process again, and correspondingly, the data decryption process is also repeatedly executed for the same round.
Further, a data encryption device comprises a memory and a processor; the memory for storing a computer program; the processor is used for realizing the processing method of the data encryption/decryption flow when executing the computer program.
Further, a computer-readable storage medium, on which a computer program is stored, which, when executed by a processor, implements the processing method of the above-described data encryption/decryption procedure.
The method has the advantages that the front-bit plaintext key Kp and/or the front-bit ciphertext key Kc are adopted, relative front-bit characters of the information are used as dynamic variable factors to participate in an encryption algorithm of relative rear-bit characters, a plurality of same information plaintexts can be encrypted into different ciphertexts due to different relative front-bit characters, and the same characters in the information plaintexts can be respectively encrypted into any characters with different character set offsets. For example, a first L in the plaintext of the first message may be encrypted as Z, and a second L may be encrypted as M; the first L in the second message may be encrypted to X and the second L may be encrypted to F; . The data encryption method has the advantages that the occurrence probability of characters in the information ciphertext is disordered, and the difficulty of decoding the encrypted information by a frequency analysis method is greatly improved. The encryption algorithm also has the characteristics of simplicity and understandability.
Drawings
The accompanying drawings illustrate preferred embodiments of the present application for the purpose of further understanding the technical spirit of the present application. Accordingly, the present application is not limited to the drawings.
FIG. 1 is a schematic diagram of a data encryption flow of a data encryption method based on a front-bit key according to the present application;
FIG. 2 is a schematic diagram of a data decryption process of the data decryption method based on the front-bit key according to the present application;
FIG. 3 is a diagram of an example of data encryption with certain information of an embodiment comprising a portion of a random string R of "NIHAO";
FIG. 4 is a diagram illustrating an example of data decryption for a message ciphertext of FIG. 3;
FIG. 5 is a diagram of an example of data encryption in which certain information of an embodiment includes a portion of a "SUICO" random string R;
fig. 6 is a diagram illustrating an example of second round data encryption for a certain message cipher text in fig. 3.
Detailed Description
The preferred embodiment of the data encryption method based on the front-bit key of the present application is given below with reference to the drawings of the specification.
The following description is only intended to illustrate possible embodiments of the present application, and is not intended to limit the scope of the present application, and all equivalent embodiments and modifications that do not depart from the technical spirit of the present application are intended to be included within the scope of the present application.
As exemplified in fig. 3/4/5/6, for ease of description and understanding, the number in parentheses on the right of the character is its position index, and the arithmetic expression containing the content of "mod" in the cell is the encryption/decryption algorithm calculation process.
As shown in fig. 3/4/5/6, 3 sub-items in the key set Klist are preset, where the key K is "you qu", the previous plaintext key Kp is "WORLD", and the previous ciphertext key Kc is "game".
As illustrated in fig. 3/5, the preset rules of the random character string R generated by the random character generator are: ending with a predetermined string "O".
Example 1:
a1, data encryption process (as shown in figure 3 for example)
a1.1, selecting a self-coding character set range A-Z and marking each character position index with 0-25;
a1.2, a step S01 of generating random characters by a random character generator: generating a random string R "NIHAO" ending with string "O";
a1.3, splicing the random character string R and the first plaintext P1 'HELLOELLO' together according to the sequence S02, and outputting a second plaintext P2 'NIHAOHELLOHLO' containing the spliced random character string;
a1.4, encryption step S03:
a1.4.1, making a two-dimensional table, dividing the two-dimensional table into a title line and a content line, and filling each sub-item (a key K is YOUQU, a front-bit plaintext key Kp is WORLD, and a front-bit ciphertext key Kc is GAMES) in a key set Klist in sequence in each title line; filling a second plaintext P2 into cells in a content row of the two-dimensional table;
a1.4.2, calculating each cell filling character of the second plaintext P2 in the content row according to an encryption algorithm of (plaintext character + key character + real value of front plaintext key character + real value of front ciphertext key character + \8230;) mod character set total character count = ciphertext character), and finally outputting a ciphertext C 'LUIXPJBZMBQZVQ';
a2, data decryption process (as shown in the example of FIG. 4)
a2.1, selecting a self-coding character set range A-Z, marking each character position index by 0-25, and the same as the step a 1.1;
a2.2, decryption step S04:
a step of a2.2.1, making a two-dimensional table, filling a title line with a key set Klist and a step of a1.4.1, and filling a ciphertext C 'LUIXPJBZMBQZVQ' into cells in a content line of the two-dimensional table;
a2.2.2, calculating each cell filling character of the ciphertext C in the content line according to a decryption algorithm of (ciphertext character-key character-front-bit plaintext key character real value-front-bit ciphertext key character real value + \ 8230;) mod character set total number of characters = plaintext character), and outputting a second plaintext P2 'NIHAOHELLO';
a2.3, deleting the random character string spliced in the second plaintext P2, and S05: the random character string R "NIHAO" from the start position in the second plaintext P2 to the position where the preset character string "O" appears for the first time is deleted, and finally the first plaintext P1 "helloello" is output.
As can be seen from embodiment 1, by adopting the above encryption algorithm, the first plaintext P1"HELLOHELLO" may encrypt a plurality of identical characters in the first plaintext P1 into arbitrary characters having different offsets in the character set, respectively.
Example 2:
a1, data encryption process (as shown in the example of FIG. 5)
a1.1, selecting a self-coding character set range A-Z and marking each character position index with 0-25;
a1.2, a step S01 of generating random characters by a random character generator: generating a random string R "SUICO" ending with string "O";
a1.3, splicing the random character string R 'SUICO' and the first plaintext P1 'HELLOELLO' together according to the sequence S02, and outputting a second plaintext P2 'SUICOELLOHELLO' containing the spliced random character string;
a1.4, encryption step S03:
a1.4.1, making a two-dimensional table, dividing the two-dimensional table into a title line and a content line, and filling each sub-item (a key K is YOUQU, a front-bit plaintext key Kp is WORLD, and a front-bit ciphertext key Kc is GAMES) in a key set Klist in sequence in each title line; filling the second plaintext P2 into cells in the content rows of the two-dimensional table;
a1.4.2, calculating each cell filling character of the second plaintext P2 in the content row according to an encryption algorithm of (plaintext character + key character + real value of front-bit plaintext key character + real value of front-bit ciphertext key character + \8230;) mod character set character total number = ciphertext character), and finally outputting a ciphertext C 'QQKAQNSXFUQTCAJ'.
As can be seen by comparing embodiment 1 with embodiment 2, 2 identical first plain texts P1"HELLOHELLO" are encrypted into different cipher texts C (jbzmbnqzvq "in embodiment 1, nsxfuqtcaj" in embodiment 2) by using the above encryption algorithm because of the difference of the random character string R with respect to the preceding characters.
Example 3:
a1, data encryption process (as shown in the example of FIG. 6)
a1.1, selecting a range A-Z from a coding character set, and marking each character position index by 0-25;
a1.2, not generating a random character string R;
a1.3, not using the random character string R; a1.3, not using a random character string R;
a1.4, encryption step S03:
a1.4.1, making a two-dimensional table, dividing the two-dimensional table into a title line and a content line, and filling each sub-item (a key K is YOUQU, a front-bit plaintext key Kp is WORLD, and a front-bit ciphertext key Kc is GAMES) in a key set Klist in sequence in each title line; filling a first plaintext P1"LUIXPJBZMBNQZVQ" (i.e., the information ciphertext C of embodiment 1) into cells in a row of contents of a two-dimensional table;
a1.4.2, calculating each cell filling character of the first plaintext P1 in the content line according to an encryption algorithm of (plaintext character + key character + front-bit plaintext key character real value + front-bit ciphertext key character real value + \8230;) mod character set total number of characters = ciphertext character), and finally outputting a ciphertext C JCPAP WPBSQUKNHVR.
It can be known that, since the random character string R is not generated and used in the second round of data encryption process in embodiment 3, the first plaintext P1 is directly output after the decryption step S04 is executed in the corresponding round of data decryption process, and the random character string R with the specified rule deleted is no longer executed.
Claims (10)
1. A method for encrypting data based on a front-bit key is characterized by comprising the following steps:
a1, data encryption process
a1.1, selecting a specified character set or a self-coding character set range, and marking each character position index by increasing 1 from 0 according to the coding sequence of the character set;
a1.2, a step (S01) of generating random characters by a random character generator: generating a random character string (R) with a preset rule;
a1.3, splicing the random character string (R) and the first plaintext (P1) together according to the sequence (S02), and outputting a second plaintext (P2) containing the spliced random character string;
a1.4, encryption step (S03):
a two-dimensional table is prepared and divided into a title line and a content line, the key set (Klist) comprises one or more preset sub-items, the key set (Klist) at least comprises a front-bit plaintext key (Kp) or a front-bit ciphertext key (Kc) sub-item, each cell is filled with one character, and each line of the title line is sequentially filled with each sub-item in the key set (Klist); filling a second plaintext (P2) into cells in a row of contents of the two-dimensional table;
a1.4.2, calculating each cell filling character of a second plaintext (P2) in the content row according to an encryption algorithm of (plaintext character + key character + front-bit plaintext key character real value + front-bit ciphertext key character real value + \8230;) mod character set total character number = ciphertext character), and finally outputting a ciphertext (C);
a2, data decryption process
a2.1, selecting a character set which is the same as the data encryption process, and then performing the same step as the step a 1.1;
a2.2, decryption step (S04):
a2.2.1, making a two-dimensional table, filling a title line filling key set (Klist) with the step of a1.4.1, and filling the ciphertext (C) into cells in the content lines of the two-dimensional table;
a2.2.2, calculating each cell filling character of the ciphertext (C) in the content line in sequence according to a decryption algorithm of (ciphertext character-key character-front-bit plaintext key character real value-front-bit ciphertext key character real value- \8230;) mod character set total number of characters = plaintext characters), and outputting a second plaintext (P2);
a2.3, deleting the random character string spliced in the second plaintext (P2) (S05): and deleting the random character string (R) which is matched with the preset rule for the first time in the second plaintext (P2), and finally outputting the first plaintext (P1).
2. The method for encrypting data based on a preceding bit key according to claim 1, wherein the key set (Klist) comprises a preceding bit plaintext key (Kp) and a preceding bit ciphertext key (Kc) sub-item.
3. The method for encrypting data based on a leading bit key as claimed in claim 1 or 2, wherein the predetermined rule in step a1.2 is: a random character generator generates a random character string (R) ending in a predetermined character string; the preset rule in the step a2.3 is as follows: the random string (R) from the start position in the second plaintext (P2) to the position where the predetermined string appears for the first time is deleted.
4. A method for encrypting data based on a preceding bit key according to claim 1 or 2, characterized in that the random string (R) portion in the second plaintext (P2) is encrypted using a different data encryption method from the first plaintext (P1) portion.
5. The method for encrypting data based on a preceding bit key according to claim 1 or 2, wherein in the data encryption process, the total number of characters > = the preset minimum number of the random character string (R) and the first plaintext (P1), and the deficiency is complemented by the random character string (R).
6. The method for encrypting data based on a prefix key according to claim 1, wherein the first plaintext (P1) is directly subjected to the encrypting step (S03) without generating and using a random string (R), i.e. without including the steps a1.2, a1.3, and a2.3, and the decrypting step (S04) directly outputs the first plaintext (P1).
7. Method for data encryption based on a preceding bit key according to claim 1, 2 or 6, characterized in that the indexing of the positions of the sub-items in the set of keys (Klist) is not continuous or repetitive.
8. The method for encrypting data based on a prefix key according to claim 1, 2 or 6, wherein the data encryption process is repeated for a plurality of rounds, and correspondingly, the data decryption process is repeated for the same round.
9. A data encryption apparatus comprising a memory and a processor; the memory for storing a computer program; the processor, when executing the computer program, is configured to implement the method for encrypting data based on a front-bit key according to claim 1, 2 or 6.
10. A computer-readable storage medium, characterized in that the storage medium has stored thereon a computer program which, when executed by a processor, implements the method for encrypting data based on a leading bit key of claim 1 or 2 or 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211340213.XA CN115664827A (en) | 2022-10-29 | 2022-10-29 | Data encryption method, device and medium based on front-bit key |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211340213.XA CN115664827A (en) | 2022-10-29 | 2022-10-29 | Data encryption method, device and medium based on front-bit key |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115664827A true CN115664827A (en) | 2023-01-31 |
Family
ID=84993055
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211340213.XA Pending CN115664827A (en) | 2022-10-29 | 2022-10-29 | Data encryption method, device and medium based on front-bit key |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115664827A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116722983A (en) * | 2023-08-10 | 2023-09-08 | 天津市城市规划设计研究总院有限公司 | Information security method and system for Internet of things terminal in urban planning field |
| CN116738492A (en) * | 2023-08-15 | 2023-09-12 | 青岛精锐机械制造有限公司 | Valve sales data safety management system |
-
2022
- 2022-10-29 CN CN202211340213.XA patent/CN115664827A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116722983A (en) * | 2023-08-10 | 2023-09-08 | 天津市城市规划设计研究总院有限公司 | Information security method and system for Internet of things terminal in urban planning field |
| CN116722983B (en) * | 2023-08-10 | 2023-10-03 | 天津市城市规划设计研究总院有限公司 | Information security method and system for Internet of things terminal in urban planning field |
| CN116738492A (en) * | 2023-08-15 | 2023-09-12 | 青岛精锐机械制造有限公司 | Valve sales data safety management system |
| CN116738492B (en) * | 2023-08-15 | 2023-10-31 | 青岛精锐机械制造有限公司 | Valve sales data safety management system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115664827A (en) | Data encryption method, device and medium based on front-bit key | |
| Salomon | Data privacy and security | |
| Rahim et al. | Cryptography technique with modular multiplication block cipher and playfair cipher | |
| CN116032474B (en) | Safety protection system based on big data computer network | |
| WO2014136386A1 (en) | Tag generation device, tag generation method, and tag generation program | |
| CN116545771B (en) | Intelligent storage method and system for intelligent driving system test data | |
| CN115659409B (en) | Financial asset transaction data safe storage method | |
| Senthil et al. | A modern avatar of Julius Ceasar and Vigenere cipher | |
| US20060193471A1 (en) | Encryption method and system | |
| Agievich et al. | Mathematical problems of the Second International Students’ Olympiad in Cryptography | |
| CN110995415A (en) | Encryption algorithm based on MD5 algorithm | |
| Dömösi et al. | A novel cryptosystem based on abstract automata and Latin cubes | |
| EP4052193A1 (en) | System and method for encryption and decryption using logic synthesis | |
| CN116894273A (en) | File encryption method, decryption method, equipment and medium based on exclusive or sum remainder | |
| Syahrizal et al. | Modified Playfair Cipher Using Random Key Linear Congruent Method | |
| Al-Sabaawi | Cryptanalysis of Classic Ciphers: Methods Implementation Survey | |
| Budiman et al. | An Implementation of RC4+ Algorithm and Zig-zag Algorithm in a Super Encryption Scheme for Text Security | |
| Rizal et al. | Modified key using multi-cycle key in vigenere cipher | |
| Gorodilova et al. | The seventh international olympiad in cryptography: problems and solutions | |
| Rachmawanto et al. | Text encryption using Bi-amold cat map and modulus operation | |
| Sokouti et al. | An approach in improving transposition cipher system | |
| KR101790325B1 (en) | Encryption and Decryption System | |
| Licayan et al. | Performance Analysis of Playfair Cipher Color Substitution Variants | |
| RU2254685C2 (en) | Method of data conversion | |
| Chauhan | Conversion of stream cipher into block cipher |
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 |