CN115314197A - Method, system and electronic equipment for generating secret key based on life game model - Google Patents
Method, system and electronic equipment for generating secret key based on life game model Download PDFInfo
- Publication number
- CN115314197A CN115314197A CN202210943252.2A CN202210943252A CN115314197A CN 115314197 A CN115314197 A CN 115314197A CN 202210943252 A CN202210943252 A CN 202210943252A CN 115314197 A CN115314197 A CN 115314197A
- Authority
- CN
- China
- Prior art keywords
- dimensional dynamic
- dynamic matrix
- matrix
- dimensional
- game model
- 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 40
- 239000011159 matrix material Substances 0.000 claims abstract description 104
- 230000006854 communication Effects 0.000 claims abstract description 22
- 230000004913 activation Effects 0.000 claims abstract description 19
- 238000004891 communication Methods 0.000 claims abstract description 19
- 230000008859 change Effects 0.000 claims abstract description 13
- 230000008569 process Effects 0.000 claims description 9
- 238000013519 translation Methods 0.000 claims description 4
- 238000010276 construction Methods 0.000 claims description 2
- 230000002035 prolonged effect Effects 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 7
- 238000005457 optimization Methods 0.000 description 6
- 238000003860 storage Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 3
- 238000004590 computer program Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000004088 simulation Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000005094 computer simulation Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000004083 survival effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/004—Artificial life, i.e. computing arrangements simulating life
- G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- Biomedical Technology (AREA)
- Biophysics (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- Life Sciences & Earth Sciences (AREA)
- Molecular Biology (AREA)
- Artificial Intelligence (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Health & Medical Sciences (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Complex Calculations (AREA)
Abstract
The invention relates to the technical field of information security, and discloses a secret key generation method based on a life game model, which comprises the following steps: constructing a two-dimensional dynamic matrix: constructing a two-dimensional dynamic matrix m multiplied by m which changes along with time based on the life game model rule, wherein m is a positive integer; and (3) pulse activation: performing pulse activation on a designated area of the two-dimensional dynamic matrix at intervals of certain iteration times to enable the two-dimensional dynamic matrix to continuously change; and (3) generating a code word: and carrying out XOR on the values of each row of the continuously changed two-dimensional dynamic matrix to obtain an m-bit key, and simultaneously endowing the obtained m-bit key to each communication host. The key generation method provided by the invention can be applied to the generation of session keys in the communication process, the generated keys are more, and meanwhile, the effective time of encryption/decryption keys is greatly prolonged.
Description
Technical Field
The invention relates to the technical field of information security, in particular to a method, a system and electronic equipment for generating a secret key based on a life game model.
Background
In a certain communication process, data transmitted by two communication parties needs to be encrypted for transmission, an encryption algorithm usually adopts symmetric encryption [1], while a block cipher is a main tool for realizing symmetric encryption, as shown in fig. 6, the working principle of the block cipher is as follows: the plaintext message sequence is first divided into data group sequence of length L, and then the groups are encrypted with the same key into ciphertext group sequence of length L, and the ciphertext is inversely transformed with the same key during decryption [2]. Therefore, the data encryption key requires the two communicating parties to negotiate before communication, so as to realize the consistency of the encryption/decryption data session keys of the two communicating parties.
The method comprises the steps that a symmetric encryption technology is adopted, a large number of session keys which are agreed to be consistent by both parties are needed, and in order to meet the requirement that session keys used by both communication parties for encrypting/decrypting information are consistent, the same keys are loaded to a communication host computer respectively before communication starts; during the encryption process, the two communication parties use the key according to the preset rule. The defects are mainly as follows: the number of the keys loaded to each communication host has an upper limit, the effective time is short, and the encryption/decryption of the data transmitted by the two parties in cooperation cannot be guaranteed for a long time.
Disclosure of Invention
In order to prolong the effective acting time of the initialized secret key in a certain communication practical application scene, the invention provides a secret key generation method, a system and electronic equipment based on a life game model.
The invention is realized by the following technical scheme:
a key generation method based on a life game model comprises the following steps:
constructing a two-dimensional dynamic matrix: constructing a two-dimensional dynamic matrix m multiplied by m which changes along with time based on the life game model rule, wherein m is a positive integer;
and (3) pulse activation: performing pulse activation on a designated area of the two-dimensional dynamic matrix at intervals of certain iteration times to enable the two-dimensional dynamic matrix to continuously change;
and (3) generating a code word: and carrying out XOR on the values of each row of the continuously changed two-dimensional dynamic matrix to obtain an m-bit key, and simultaneously endowing the obtained m-bit key to each communication host.
As optimization, the method also comprises the step of adding dynamic components to the constructed two-dimensional dynamic matrix, and the specific steps are as follows:
and adding a sliding structure in the two-dimensional dynamic matrix at regular intervals of iteration times, wherein the sliding structure can be kept unchanged while translating in space in the iteration process of the two-dimensional dynamic matrix.
Preferably, the sliding structure is a two-dimensional matrix of a × b, and a and b are positive integers.
As an optimization, the translation direction of the gliding structure in the two-dimensional dynamic matrix may be derived from the deduction of an automaton.
As an optimization, the designated area may be an even number of rows or a sparser location of the two-dimensional dynamic matrix.
As an optimization, the sparser locations are represented as: the sparser positions are represented as: in the two-dimensional dynamic matrix of m x m, there are n scattered squares with a value of 1, there are (m x m-n) squares with a value of 0, and n is not greater than (m x m)/2, then the squares with a value of 1 are located at sparser positions.
As an optimization, a specific method for performing pulse activation on the designated area is to assign a value of the designated area to 1.
The invention also discloses a key generation system based on the life game model, which comprises:
a two-dimensional dynamic matrix building module: the method is used for constructing a m multiplied by m two-dimensional dynamic matrix which changes along with time based on the life game model rule, wherein m is a positive integer;
a pulse activation module: the pulse activation device is used for performing pulse activation on a specified area of the two-dimensional dynamic matrix at intervals of certain iteration times so as to continuously change the two-dimensional dynamic matrix;
a codeword generation module: and the key generation device is used for carrying out XOR on the values of each row of the two-dimensional dynamic matrix which continuously changes to obtain an m-bit key and endowing the m-bit key to each communication host at the same time.
As optimization, the method further comprises a dynamic component adding module for adding dynamic components to the constructed two-dimensional dynamic matrix: and the sliding structure is used for increasing a sliding structure in the two-dimensional dynamic matrix at regular intervals of iteration times, and the sliding structure can be kept unchanged while being translated in space in the iteration process of the two-dimensional dynamic matrix.
An electronic device comprising at least one processor, and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a method of life game model based key generation as described above.
Compared with the prior art, the invention has the following advantages and beneficial effects:
the method for generating the key is applied to generation of session keys in a communication process, the generated keys are large in quantity, and meanwhile, the effective time of encryption/decryption keys is greatly prolonged.
Drawings
In order to more clearly illustrate the technical solutions of the exemplary embodiments of the present invention, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and that for those skilled in the art, other related drawings can be obtained from these drawings without inventive effort. In the drawings:
FIG. 1 is a schematic diagram showing a point in a matrix of a life game model in embodiment 1 evolving from 0 to 1;
FIG. 2 is a schematic diagram showing a point in a matrix of the life game model in embodiment 1 evolving from 1 to 0;
fig. 3 is a schematic view of a sliding structure in embodiment 2;
FIG. 4 is a schematic diagram of a two-dimensional dynamic matrix of a gliding structure prior to gliding within the two-dimensional dynamic matrix;
FIG. 5 is a schematic diagram of the two-dimensional dynamic matrix of the gliding structure of FIG. 4 after gliding within the two-dimensional dynamic matrix;
fig. 6 is a schematic structural diagram of a block cipher model.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to examples and accompanying drawings, and the exemplary embodiments and descriptions thereof are only used for explaining the present invention and are not meant to limit the present invention.
First, since the initial states of the communication hosts are identical, the session keys are generated to be identical independently from each other according to the synchronization time, and the problem of short validity time of the existing keys can be effectively solved.
Example 1
Next, how the communication hosts generate a uniform session key independently of each other will be specifically described.
A key generation method based on a life game model comprises the following steps:
constructing a two-dimensional dynamic matrix: and constructing a two-dimensional dynamic matrix m multiplied by m which changes along with time based on the life game model rule, wherein m is a positive integer.
Firstly, a dynamic matrix which dynamically changes along with time according to a certain rule is constructed, and then a secret key is generated according to the value of the matrix. The dynamically changing rule adopts a model rule of 'life game', the life game is a typical cellular automaton model [3], and the model evolution is based on a two-dimensional grid, each grid has 0 or 1 state, and the state of each grid depends on the number of 0 and 1 in 8 adjacent grids. The present invention constructs a grid using a matrix, for a point in the matrix, the point evolves to 0 when the number of surrounding 1 is greater than 4, and the point evolves to 1 when the number of surrounding 1 is less than or equal to 4, as shown in fig. 1-2. The invention generates a session key required by certain communication based on a two-dimensional dynamic matrix constructed by a life game model, and the survival rule parameters of the life game can be changed to form different life game models.
Along with continuous iterative processing, the whole matrix presents abundant changes and evolves various sequence structures. In this embodiment, m is 128, that is, a 128 × 128 two-dimensional matrix is used to construct a dynamic matrix, and a 128 × 128 two-dimensional initial state matrix whose initial value only includes 0 and 1 is input to obtain a dynamic matrix that varies with the number of iterations, that is, with time.
And (3) pulse activation: and performing pulse activation on the designated area of the two-dimensional dynamic matrix at regular intervals of iteration times to continuously change the two-dimensional dynamic matrix.
Because the dynamic two-dimensional matrix has a certain life cycle, the 128 x 128 two-dimensional dynamic matrix does not change after about 30 iterations according to the simulation result. In order to make the dynamic matrix continuously change, the patent provides a processing method for pulse activation, namely, assigning a designated area in the matrix to be 1 at regular intervals of iteration times. In this embodiment, the designated area may be an even row or a sparse position of the two-dimensional dynamic matrix, and specifically, the sparse position is represented as: the sparser positions are represented as: in the two-dimensional dynamic matrix of m x m, n grids with the value of 1 are discretely distributed, and (m x m-n) grids with the value of 0 are distributed, wherein n is not more than (m x m)/2, and the grids with the value of 1 are located at sparser positions. For example, a matrix of 10 × 10, where 90 squares in the matrix have all values of 0, and only 10 scattered squares have values of 1, the matrix of 10 × 10 is a sparse matrix, where the square with the value of 1 is located can be considered as a sparse position, and how many squares in the matrix have values of 0 is considered as a sparse matrix, and is defined by the staff member.
Through simulation analysis, the period of the pulse activation can be 10 times of iteration, so that the change of the two-dimensional dynamic matrix can be continuously carried out.
And (3) generating a code word: and carrying out XOR on the values of each row of the continuously changed two-dimensional dynamic matrix to obtain an m-bit key, and simultaneously endowing the obtained m-bit key to each communication host.
Specifically, in this embodiment, according to the 128 × 128 two-dimensional dynamic matrix constructed above, the 128-bit key is obtained by xoring the values of each row, and the 128-bit key is obtained by xoring the values of each row of the two-dimensional dynamic matrix. Since such a key has the characteristic of difficult reverse analysis and the complexity of life game change, the deciphering difficulty of the key generation rule is large.
Example 2
In order to increase the complexity of the change of the dynamic matrix, in this embodiment, a dynamic component is further added to the two-dimensional dynamic matrix after the construction is completed, and the specific steps are as follows:
and adding a sliding structure in the two-dimensional dynamic matrix at regular intervals of iteration times, wherein the sliding structure can be kept unchanged while translating in space in the iteration process of the two-dimensional dynamic matrix. By generating this structure in a timed manner, the change of the dynamic matrix will be more complex.
The key of the invention adds a sliding structure in order to increase the complexity of key generation, and of course, other similar dynamic structures can also be added to increase the complexity of key generation.
As shown in fig. 3, a sliding structure is added for this embodiment. The gliding structures are a 3 x 4 two-dimensional matrix. In this embodiment, the translation direction of the sliding structure in the two-dimensional dynamic matrix may be obtained according to deduction of an automaton. If the two-dimensional matrix of one sliding structure is known, the sliding structure can be deduced once by an automaton, the direction of the two-dimensional matrix of the next sliding structure is observed to translate, and the translation direction of the sliding structure can be deduced after several deductions.
As shown in fig. 4, the upper left corner and the upper right corner in the figure are sliding structures which are continuously launched towards the center, and when the sliding structures meet the existing grid squares in the two-dimensional dynamic matrix with a value of 1, the sliding structures are spread out to generate more complex matrix changes, that is, the sliding structures meet the point with the original value of 1 in the moving process, more 1 can be generated near the position under the driving of the evolution rule, and the white part (with the value of 1) is seen to be spread out in fig. 4-5. As shown in fig. 5, the lower vector is the key generated from the two-dimensional dynamic matrix.
Through calculation, under the condition that the complexity of a sliding component is not considered and a key generation model is known transparently, for a 128-bit key generated by using a 128 x 128 two-dimensional dynamic matrix, if the generation rule of the dynamic key is to be broken and the key at the next moment is further acquired, two continuous keys (2 x 2) need to be broken first 128 Seed possibility), then the dynamic matrix is interpreted, total 2 32512 Possibilities (for a dynamic matrix of keys, 2 per row) (128-1) Seed possibility, 128 lines total 2 ((128-1)×128) The possibility then needs to traverse all the possibilities of the two dynamic matrices, finding a set of dynamic matrices that satisfy the rules of the life game model, and a total of 2, without considering the confusion of the sets ((128-1)×128)×2 Seed possibility), if the american supercomputer Summit calculation is used, it takes approximately 0.7356 × 2 to traverse all possibilities, based on its calculation power of 148600TFlop/s 32366 In everyday, the difficulty of decoding is very high. Therefore, the key generation technology has higher strategic significance, can greatly improve the continuous working time of certain communication equipment and has great decoding difficulty.
Example 3
The invention also discloses a key generation system based on the life game model, which comprises:
a two-dimensional dynamic matrix building module: the method is used for constructing a two-dimensional dynamic matrix of m multiplied by m which changes along with time based on the rules of the life game model, wherein m is a positive integer;
a pulse activation module: the pulse activation device is used for performing pulse activation on a specified area of the two-dimensional dynamic matrix at intervals of certain iteration times so as to continuously change the two-dimensional dynamic matrix;
a codeword generation module: and the key generation device is used for carrying out XOR on the values of each row of the two-dimensional dynamic matrix which continuously changes to obtain an m-bit key and endowing the m-bit key to each communication host at the same time.
In this embodiment, the method further includes a dynamic component adding module that adds a dynamic component to the constructed two-dimensional dynamic matrix: and the sliding structure is used for increasing the sliding structure in the two-dimensional dynamic matrix at regular intervals of iteration times, and the sliding structure can be kept unchanged while being translated in space in the iteration process of the two-dimensional dynamic matrix.
An electronic device comprising at least one processor, and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a method of life game model based key generation as described above.
One skilled in the art will appreciate that embodiments of the present application may be provided as a method, system, or electronic device. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be understood by those skilled in the art that all or part of the steps of the above facts and methods can be implemented by hardware related to instructions of a program, and the related program or the program can be stored in a computer readable storage medium, and when executed, the program includes the following steps: corresponding method steps are introduced here, and the storage medium may be a ROM/RAM, a magnetic disk, an optical disk, etc.
In view of the above, it is intended that the preferred embodiment of the present invention not be limited thereto, but that various modifications and changes will occur to those skilled in the art; it should be understood that any modifications, equivalents, improvements and the like which come within the spirit and principle of the invention are intended to be included within the scope of the invention.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are merely exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
References (e.g. patents/papers/standards)
[1] Jiang Huan, foundation of modern cryptography [ J ]. China scientific and technical exposition, 2009 (09X): 1.
[2] WenboMao, mao, wang Jilin, et al.
[3] Guo Juan, wu Di, zhao Xianming simulation of Life Game complexity [ J ] computer simulation, 2007,24 (10): 5.
Claims (10)
1. A method for generating a key based on a life game model is characterized by comprising the following steps:
constructing a two-dimensional dynamic matrix: constructing a two-dimensional dynamic matrix m multiplied by m which changes along with time based on the life game model rule, wherein m is a positive integer;
and (3) pulse activation: performing pulse activation on a designated area of the two-dimensional dynamic matrix at intervals of certain iteration times to enable the two-dimensional dynamic matrix to continuously change;
and (3) generating a code word: and carrying out XOR on the values of each row of the continuously changed two-dimensional dynamic matrix to obtain an m-bit key, and endowing the obtained m-bit key to each communication host simultaneously.
2. The method for generating a secret key based on a life game model according to claim 1, further comprising adding a dynamic component to the constructed two-dimensional dynamic matrix, and the method comprises the following specific steps:
and adding a sliding structure in the two-dimensional dynamic matrix at regular intervals of iteration times, wherein the sliding structure can be kept unchanged while translating in space in the iteration process of the two-dimensional dynamic matrix.
3. The method of claim 2, wherein the sliding structure is a two-dimensional matrix of a x b, and a and b are positive integers.
4. A method as claimed in claim 3, wherein the direction of translation of the gliding structure in the two-dimensional dynamic matrix is derived from the deduction of an automaton.
5. The method of claim 1, wherein the designated area is an even row or a sparser position of the two-dimensional dynamic matrix.
6. The method of claim 5, wherein the sparse locations are represented as: in the two-dimensional dynamic matrix of m x m, there are n scattered squares with a value of 1, there are (m x m-n) squares with a value of 0, and n is not greater than (m x m)/2, then the squares with a value of 1 are located at sparser positions.
7. The method of claim 1, wherein the specified area is activated in a pulsating manner by assigning a value of 1 to the specified area.
8. A life game model-based key generation system, comprising:
a two-dimensional dynamic matrix construction module: the method is used for constructing a m multiplied by m two-dimensional dynamic matrix which changes along with time based on the life game model rule, wherein m is a positive integer;
a pulse activation module: the system is used for performing pulse activation on a specified area of the two-dimensional dynamic matrix at regular intervals of iteration times so as to continuously change the two-dimensional dynamic matrix;
a codeword generation module: and the key generation device is used for carrying out XOR on the values of each row of the two-dimensional dynamic matrix which continuously changes to obtain an m-bit key and endowing the m-bit key to each communication host at the same time.
9. The system of claim 8, further comprising a dynamic component adding module for adding dynamic components to the constructed two-dimensional dynamic matrix: and the sliding structure is used for increasing the sliding structure in the two-dimensional dynamic matrix at regular intervals of iteration times, and the sliding structure can be kept unchanged while being translated in space in the iteration process of the two-dimensional dynamic matrix.
10. An electronic device comprising at least one processor, and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a life game model based key generation method as claimed in any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210943252.2A CN115314197A (en) | 2022-08-08 | 2022-08-08 | Method, system and electronic equipment for generating secret key based on life game model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210943252.2A CN115314197A (en) | 2022-08-08 | 2022-08-08 | Method, system and electronic equipment for generating secret key based on life game model |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115314197A true CN115314197A (en) | 2022-11-08 |
Family
ID=83859919
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210943252.2A Pending CN115314197A (en) | 2022-08-08 | 2022-08-08 | Method, system and electronic equipment for generating secret key based on life game model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115314197A (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050015571A1 (en) * | 2003-05-29 | 2005-01-20 | International Business Machines Corporation | System and method for automatically segmenting and populating a distributed computing problem |
| CA2639649A1 (en) * | 2008-07-21 | 2010-01-21 | Randy Kuang | Cryptography method and system |
| US20100226585A1 (en) * | 2009-03-09 | 2010-09-09 | Laurence Hamid | Method for displaying encoded image data |
| CN102164369A (en) * | 2011-05-13 | 2011-08-24 | 南京邮电大学 | Method for broadcast authentication of wireless sensor network based on automaton and game of life |
| CN107590843A (en) * | 2017-09-07 | 2018-01-16 | 电子科技大学 | The image encryption method of two-dimentional reversible cellular automata based on construction |
| CN108021814A (en) * | 2017-11-27 | 2018-05-11 | 河海大学 | A kind of image encryption method of the bionical cellular automata based on balance rule |
| CN110139000A (en) * | 2019-04-11 | 2019-08-16 | 河南大学 | Compression of images encryption method based on compressed sensing and Life of Game's scramble |
| CN114531221A (en) * | 2022-02-22 | 2022-05-24 | 江苏大学 | Image encryption method and system based on chaotic system and reversible cellular automaton |
-
2022
- 2022-08-08 CN CN202210943252.2A patent/CN115314197A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050015571A1 (en) * | 2003-05-29 | 2005-01-20 | International Business Machines Corporation | System and method for automatically segmenting and populating a distributed computing problem |
| CA2639649A1 (en) * | 2008-07-21 | 2010-01-21 | Randy Kuang | Cryptography method and system |
| US20100226585A1 (en) * | 2009-03-09 | 2010-09-09 | Laurence Hamid | Method for displaying encoded image data |
| CN102164369A (en) * | 2011-05-13 | 2011-08-24 | 南京邮电大学 | Method for broadcast authentication of wireless sensor network based on automaton and game of life |
| CN107590843A (en) * | 2017-09-07 | 2018-01-16 | 电子科技大学 | The image encryption method of two-dimentional reversible cellular automata based on construction |
| CN108021814A (en) * | 2017-11-27 | 2018-05-11 | 河海大学 | A kind of image encryption method of the bionical cellular automata based on balance rule |
| CN110139000A (en) * | 2019-04-11 | 2019-08-16 | 河南大学 | Compression of images encryption method based on compressed sensing and Life of Game's scramble |
| CN114531221A (en) * | 2022-02-22 | 2022-05-24 | 江苏大学 | Image encryption method and system based on chaotic system and reversible cellular automaton |
Non-Patent Citations (2)
| Title |
|---|
| 平萍;黄李麟;毛莺池;许国艳;: "一种基于仿生元胞自动机的图像加密算法", 计算机与现代化, no. 10, 15 October 2017 (2017-10-15) * |
| 王培春 等: "利用细胞自动机构造密钥流发生器", 《西安电子科技大学学报》, 25 October 2002 (2002-10-25), pages 1 - 3 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wang et al. | A color image encryption with heterogeneous bit-permutation and correlated chaos | |
| Feng et al. | Cryptanalysis and improvement of the hyper-chaotic image encryption scheme based on DNA encoding and scrambling | |
| CN108964872B (en) | Encryption method and device based on AES | |
| Liu et al. | Color image encryption using three-dimensional sine ICMIC modulation map and DNA sequence operations | |
| CN107147487B (en) | Symmetric key random block cipher | |
| Wang et al. | Accelerating leveled fully homomorphic encryption using GPU | |
| CN107220923B (en) | Digital picture feedback encryption method based on image network | |
| Liu et al. | An image encryption scheme based on hyper chaotic system and DNA with fixed secret keys | |
| CN104917608B (en) | A kind of method of the anti-power consumption attack of key | |
| CN109951268B (en) | Encryption and decryption method and device based on bit permutation and bit permutation | |
| RU2504911C1 (en) | Method for iterative cryptographic transformation of data | |
| Zhao et al. | Block cipher design: generalized single-use-algorithm based on chaos | |
| RU2591015C1 (en) | Method for nonlinear three-dimensional multi-round rdozen data conversion | |
| JP2022095852A (en) | Digital signature method, signature information verification method, related device, and electronic device | |
| JP5689826B2 (en) | Secret calculation system, encryption apparatus, secret calculation apparatus and method, program | |
| JP4586163B2 (en) | Encryption system | |
| CN109936437B (en) | power consumption attack resisting method based on d +1 order mask | |
| CN107835070B (en) | Simple embedded encryption method | |
| CN115314197A (en) | Method, system and electronic equipment for generating secret key based on life game model | |
| CN106921486A (en) | The method and apparatus of data encryption | |
| RU2503994C1 (en) | Method for nonlinear three-dimensional many-round conversion of data dozen | |
| Kong et al. | A new image encryption algorithm based on chaos | |
| Wang | A classical cipher-playfair cipher and its improved versions | |
| RU2683689C1 (en) | Nonlinear three-dimensional multi-round data transformation method | |
| Alqahtani et al. | Elevating Network Security: A Novel S-Box Algorithm for Robust Data Encryption |
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 |