CN101872339B - Hash algorithm based on complex dynamic network - Google Patents
Hash algorithm based on complex dynamic network Download PDFInfo
- Publication number
- CN101872339B CN101872339B CN 201010197983 CN201010197983A CN101872339B CN 101872339 B CN101872339 B CN 101872339B CN 201010197983 CN201010197983 CN 201010197983 CN 201010197983 A CN201010197983 A CN 201010197983A CN 101872339 B CN101872339 B CN 101872339B
- Authority
- CN
- China
- Prior art keywords
- network
- message
- complex dynamic
- node
- message blocks
- 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.)
- Active
Links
- 238000013507 mapping Methods 0.000 claims abstract description 30
- 230000008878 coupling Effects 0.000 claims description 14
- 238000010168 coupling process Methods 0.000 claims description 14
- 238000005859 coupling reaction Methods 0.000 claims description 14
- 239000000470 constituent Substances 0.000 claims description 12
- 238000000034 method Methods 0.000 claims description 12
- 239000011159 matrix material Substances 0.000 claims description 10
- 238000011002 quantification Methods 0.000 claims description 10
- 230000008859 change Effects 0.000 claims description 9
- 230000000739 chaotic effect Effects 0.000 claims description 9
- 238000010276 construction Methods 0.000 claims description 7
- 238000009792 diffusion process Methods 0.000 abstract description 7
- 230000035945 sensitivity Effects 0.000 abstract description 4
- 238000012545 processing Methods 0.000 abstract description 3
- 238000013139 quantization Methods 0.000 abstract description 3
- 230000009466 transformation Effects 0.000 abstract description 3
- 238000006243 chemical reaction Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 101100234002 Drosophila melanogaster Shal gene Proteins 0.000 description 2
- 235000015076 Shorea robusta Nutrition 0.000 description 2
- 244000166071 Shorea robusta Species 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 208000019901 Anxiety disease Diseases 0.000 description 1
- 101100457838 Caenorhabditis elegans mod-1 gene Proteins 0.000 description 1
- 101150110972 ME1 gene Proteins 0.000 description 1
- HUTDUHSNJYTCAR-UHFFFAOYSA-N ancymidol Chemical compound C1=CC(OC)=CC=C1C(O)(C=1C=NC=NC=1)C1CC1 HUTDUHSNJYTCAR-UHFFFAOYSA-N 0.000 description 1
- 230000008485 antagonism Effects 0.000 description 1
- 230000036506 anxiety Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000006835 compression Effects 0.000 description 1
- 238000007906 compression Methods 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 239000000945 filler Substances 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
Abstract
The invention discloses a Hash algorithm based on a complex dynamic network. The algorithm comprises constructing a message block network MBN with message blocks of original messages treating Hash according to certain rules, mapping point sets and edge sets of the MBN into initial values of node states and adjacency matrixes of a complex dynamic network CDN according to certain transformation rules, thereby forming the weighted complex dynamic network WCDN with an original message structure. The Hash value can be obtained finally through iteration, quantization and difference processing of the WCDN of each message block. The invention adopts the extreme sensitivity of the WCDN to the initial values and parameters, and can obtain safety performance with excellent confusion and diffusion after multiple WCDN iterations. Simultaneously, the invention can effectively reduce the computational complexity.
Description
Technical field
The invention belongs to computing machine and field of information security technology, specifically a kind of hash algorithm based on complex dynamic network for information network.
Background technology
The Hash function is mainly used in cryptographic algorithm in the information security field, briefly is exactly a kind of function that the message compression of random length is arrived the eap-message digest of a certain regular length.
The message M that Hash function H will grow arbitrarily becomes the hash value h of fixed length, that is, h=H (M), its purpose is exactly " fingerprint " that produces file, message or other data blocks.The Hash function can directly apply to data integrity check, authentication protocol, zero-knowledge proof and randomizer etc., and very important application is arranged in digital signature and Message Authentication Code.The Hash function must have following character:
1.Hash function can be applicable to the data block of size arbitrarily;
2.Hash function produces the output of fixed length;
3. for any given x, calculate H (x) than being easier to, all can realize with hardware and software;
4. to any given hash value h, finding the x that satisfies H (x)=h is infeasible calculating, and this is also referred to as the one-way of Hash function;
5. to any given grouping x, find satisfy y＜＞y of x and H (x)=H (y) is infeasible calculating, this is referred to as anti-weak collision
6. (x is infeasible calculating y), and this is referred to as anti-strong collision to find the couple that satisfies H (x)=H (y)
Classical hash algorithm is based on the complexity hypothesis mostly as MD5, SHA etc., need carry out the logical operation such as XOR of large amount of complex or carry out repeatedly iteration with grouping encryption method, and operand is very big.And, use the mould differential technique successfully to crack popular Hash functions such as MD5, SHAl, HAVAL-128 at present, will think in the past and find the SHAl collision to need 2
80Inferior operation is down to 2
69Inferior, can in 15 minutes to 1 hour computing time, successfully find the MD5 collision.
Because chaos has good cipher characteristics such as starting condition sensitivity, pseudorandom and noise likes, be widely used in encryption and the random number generating algorithm.Chaos is applied in the research of hash algorithm, construct the concern that unidirectional hash algorithm is subjected to more and more domestic and international researchers based on the chaotic maps model, some unidirectional Hash function algorithms based on the chaos structure have been proposed, but there are some defectives in many methods aspect security, be mainly reflected in: the effective word length precision of (1) computing machine effect makes chaotic maps deteriorate to periodic sequence; (2) message parameter improper easily causing of mapping bumps; (3) clear packets and grouping iterative value are dealt with improperly and are all easily produced collision problem; (4) some systems are based on that a certain low-dimensional chaos system constructs, and discover and utilize self-adaptation to predict that synchronously various chaotic prediction technology such as phase space reconfiguration can the successful analysis prediction, and security performance causes anxiety.
So the influence of selecting the complexity of appropriate Message Processing and mapping mode, increase chaotic signal and reducing finite precision effect is the key that improves chaos Hash one-way, scramble and collision property.
On the angle of antagonism attack, obscuring with diffusion is two cardinal rules that the design encryption system at first should be followed.Obscure making key and ciphertext relation complicated as far as possible, being used in the Hash function then is to make the statistical relationship between hash value and the message complicated as far as possible.Diffusion means that key and subtle change expressly all are diffused into ciphertext as much as possible, be used in equally in the design of Hash function, expression expressly and arbitrary subtle change of key all will cause the hash value generation great change that generates.
In existing hash construction of function algorithm based on chaos, shine upon the hash algorithm of grid based on coupling owing to introducing the space-time chaos effect, can obtain to obscure preferably and diffusion property usually.From the angle of network, chaos coupling mapping grid can be equivalent to the arest neighbors coupling network, and the faint variation of any one lattice point is diffused into whole network with variation constantly by the coupling of adjacent node.But the algorithm iteration number of times of this class chaotic maps is too many usually, and algorithm complex is higher, and causing hash value to generate too slowly and not can practical application.
Summary of the invention
Too many for the algorithm iteration number of times that overcomes the chaotic maps that exists in the prior art, algorithm complex problem of higher technical matters the purpose of this invention is to provide a kind of Hash construction of function algorithm based on complex dynamic network.This algorithm constructs the with dividend right network topology of message at first based on the message blocks for the treatment of Hash; Then, the node in this news network and limit are weighed the parameter space that is mapped to chaos coupling mapping network respectively, set up message being closely connected to chaos coupling mapping network; At last, utilize the good sensitivity to parameter of chaos coupling mapping network, make the subtle change of any message to spread also disturbance rapidly to other node by node and the internodal limit power that comprises this variation.Thereby, obtain good obscuring and diffusion property, simultaneously, can effectively reduce iterations, improve efficiency of algorithm.
The objective of the invention is to be achieved through the following technical solutions:
A kind of Hash construction of function algorithm based on complex dynamic network, it is characterized in that this method adopts the complex dynamic network of setting up based on message, this network parameter is mapped to chaos coupling mapping network carries out iteration, quantification treatment, obtain hash value, specifically may further comprise the steps:
1) from the angle of network, set up the network topology of message blocks, (Message-blocknetwork MBN), sets up the message blocks network to make up the message blocks network; At first, the origination message M of Hash is treated in pre-service, M is divided into K message blocks M of regular length
k(k=1 ..., K), each message blocks can be divided into N constituent element c again
i(i=1 ..., N), if with each constituent element as the node in the network, with between constituent element (as, c
iAnd c
j) the two carry out XOR relation, as the contact between the node in the network, its operation values a
IjAs limit power, construct a with dividend right message blocks network from any message blocks;
2) set up the message blocks network to complex dynamic network (Complex Dynamiccal network, mapping CDN); Set of node V=(c with the message blocks network
i)
NWith limit collection A=(a
Ij)
N * NInformation is mapped to complex dynamic network
In the node state initial value
With network adjacency matrix E=(e
Ij)
N * NIn, (Weighted complex dynamical network WCDN), makes any subtle change in the message be diffused into all nodes of the whole network rapidly by node initial value and network topology matrix to obtain containing the complex dynamic network of message weight;
3) carry out R wheel interative computation and quantification treatment by the complex dynamic network that contains the message weight to message blocks Mk, obtain exporting Y
k, again with the middle hash value H of k-1 message blocks
K-1Carry out XOR, obtain this to message blocks M
kThe middle hash value H that handles
k, the hash value H that last piece MK disposes and obtains
KBe final hash value.
At first set up among the present invention the message blocks network (Message-block network, MBN).The origination message M of Hash is treated in pre-service, M is divided into K message blocks M of regular length
k(k=1 ..., K), each message blocks can be divided into N constituent element c again
i(i=1 ..., N), if with each constituent element as the node in the network, with between constituent element (as, c
iAnd c
j) certain operation relation (as, the two carries out XOR) as the contact between the node in the network, its operation values a
IjAs limit power, like this we can from any message blocks construct a with dividend right message blocks network (Message-blocknetwork, MBN), as shown in Figure 1;
Set up MBN then to complex dynamic network (Complex Dynamiccal network, mapping CDN).CDN in the algorithm be one the coupling mapped system (coupled map system, CMS):
I=1,2 ..., N, wherein,
For node i among the CDN at t dynamics state variable constantly,
Be the local kinetics equation of node i, in this algorithm, be taken as the logistic mapping, that is, and f (x)=mx (1-x), m ∈ (3.57,4).e
IjBeing the limit power information of node i and node j, also is the factor among the reflection CDN node topology adjacency matrix E.Select certain linearity or nonlinear transformation, set up the mapping one by one on MBN network node and limit in the CDN network,
c
Ij→ e
IjBy mapping, obtain complex dynamic network (Weighted complex dynamicalnetwork, a WCDN) system that contains the message weight;
Carry out R wheel interative computation and quantification treatment by the WCDN to message blocks Mk at last, obtain exporting Y
k, again with the middle hash value H of k-1 message blocks
K-1Carry out XOR, obtain this to message blocks M
kThe middle hash value H that handles
k, the hash value H that last piece MK disposes and obtains
KBe final hash value.Hash function generative process as shown in Figure 2, to the quantification treatment process after the WCDN iteration as shown in Figure 3.
The present invention utilizes the good sensitivity to parameter of chaos coupling mapping network, thought based on complex dynamic network, the message blocks of Hash is treated in processing, make up the network topology of message, set up this news network topology to the mapping of chaos coupling mapping network, realize the safe Hash function of low computation complexity, any subtle change of message iteration several times by minority is diffused into the whole network rapidly.
For improving operation efficiency and the security of hash algorithm, the present invention adopts the complex dynamic network of setting up based on message, and this network parameter is mapped to chaos coupling mapping network carries out iteration, quantification treatment, obtain hash value, this method can obtain well to obscure and diffusion property, and algorithm complex can effectively reduce, and is a kind of safe Hash function algorithm of low computation complexity.
This is as follows with bright beneficial effect:
The present invention provides the safe Hash function scheme of the low complex degree of a practical for Secure Application fields such as the digital signature in the information network, message authentication, data integrity authentications.
The present invention promote the Hash function obscure with diffusion in, reduced the chaos iteration number of times, reduced computation complexity.Not only consider the value of message, also the relation between the each several part byte of consideration composition message is set up information and is set up weighting network.And nodal information and the topology information of this network be mapped completely in the complex dynamic network system, obtain the weight complex dynamic network about message, obtain required hash value by iteration, quantification treatment to this complexity weighting network.The present invention utilizes complex dynamic network to the extremely susceptibility of limit weights in initial value and the network adjacency matrix, make any subtle change of message be diffused into all nodes of the whole network rapidly by node initial value and network topology matrix, when improving algorithm security, effectively reduce the computation complexity of algorithm.
Description of drawings
Fig. 1 is the synoptic diagram that generates network topology from message;
Fig. 2 is that the Hash function generates synoptic diagram.
Fig. 3 is the quantizing process synoptic diagram
Embodiment
A kind of Hash construction of function algorithm based on complex dynamic network of the present invention, this method adopts the complex dynamic network of setting up based on message, this network parameter is mapped to chaos coupling mapping network carries out iteration, quantification treatment, obtain hash value, specifically may further comprise the steps:
1, pre-service origination message
Origination message M is at first carried out as down conversion:
M’＝M+string(|M|)+padding (1)
Its objective is the message M ' that makes after the conversion sub-piece M of message that to be divided into K length be Lbits
k(k=1 ..., K), k message blocks sequence number, the concatenation operation of '+' expression character string in (1) formula, string (| M|) be the character string forms of the length of origination message M; Padding refers to that filler when the not enough Lbits of last piece is to guarantee that last height piece also is the L position;
2, initialization correlation parameter
To the relevant initial parameter in the complex dynamic network, Hash initial value etc. is set:
● the message blocks length L, for example: L=256bits
● network size N among the CDN, for example: N=8
● the phase parameter μ of logistic mapping
1, μ
1..., μ
NFor example: μ
1=μ
2=...=μ
N=3.95
● the length h of hash value, for example: h=160bits
● the initial value vector H of hash value
0, H for example
0=0
● quantization level is 2
DAnd iteration wheel number R, attention be: h=N * D * R, for example: D=4, R=5
3, set up with dividend right news network (MBN)
With M
kBe divided into N constituent element c again
1, c
2..., c
N, each constituent element c
i(i=1 ..., N) m byte, i.e. c are arranged
i=(c
i[1], c
i[2] ..., c
i[m]), obvious message digit length and constituent element position cover with foot and concern L=N * 8m, for example, get in this programme: L=256, N=8, m=4.
Order
I, j=1,2 ..., N,
The expression xor operation.Obvious a
IjLength also be m byte, i.e. a
Ij=(a
Ij[1], a
Ij[2] ..., a
Ij[m])
With c
i(i=1 ..., N) as the network node in the news network, with a
IjAs node c
iAnd c
jLimit power, we have just set up a with dividend right news network MBN that network size is N so.
Point set V=(the c of note MBN
i)
N, limit collection A=(a
Ij)
N * N, then MBN can be designated as: and MBN=(V, A).
4, set up weight complex dynamic network (WCDN)
Complex dynamic network among the present invention (CDN) can be described with following formula
In this dynamic network, get node dynamics and be the logistic mapping, this equation takes absolute value and is to guarantee the node state value to the purpose of 1 delivery
● node mapping: consider message blocks sequence number k, with i node c in the news network
iBe mapped to the initial parameter of node in the network (2) by linear transformation
In:
Dec (c wherein
i) represent c
iConvert the decimal integer value to
● limit power mapping: with the limit c of i node and j node in k the message blocks
IjBy the network adjacency matrix E=(e of following transformed mappings in the CDN
Ij)
N * NIn the factor e of the capable j of i row
IjIn.
p
ij＝((j-1)×N+i+k)mod?256 (5)
Annotate: the piece sequence number of message blocks and node ID all are the parameters in the conversion.
By above-mentioned conversion, CDN one has comprised the weight complex dynamic network (WCDN) of MBN information.
5, to weight complex dynamic network iterative quantization
The weight complex dynamic network formula (2) of every k message blocks mapping is carried out R wheel iteration,, the result of the t wheel iteration of i node is undertaken 2 by following formula
DLevel quantizes:
Int (.) expression rounds, then
Its binary sequence can be expressed as:
The WCDN that then comprises N node at the quantification vector of t wheel iteration is
We get
As the output of t wheel, after then R wheel iteration is finished, connect that each takes turns the output output vector that obtains k message blocks be: Y
k=(Y
1, Y
2..., Y
R), whole quantizing process is as shown in Figure 3.
Carry out XOR as the Hash output of k message blocks with the output of k message blocks and the hash output of K-1 piece
H
k＝H
k-1？Y
k k 1，2，....K (8)
6, output hash value
Repeat above-mentioned steps 3,4 and 5 up to handling all K piece message.With last message blocks M
KHash output H
KAs final Hash result.
The present invention utilizes complex dynamic network to the extremely susceptibility of limit weights in initial value and the network adjacency matrix, make any subtle change of message be diffused into all nodes of the whole network rapidly by node initial value and network topology matrix, when improving algorithm security, effectively reduce the computation complexity of algorithm.
Claims (2)
1. Hash function construction method based on complex dynamic network, it is characterized in that this method is used for information security field, the complex dynamic network that employing is set up based on message, this network parameter is mapped to chaos coupling mapping network carries out iteration, quantification treatment, obtain hash value, specifically may further comprise the steps:
1) from the angle of network, set up the network topology of message blocks, make up the message blocks network, set up the message blocks network; At first, the origination message M of Hash is treated in pre-service, M is divided into K message blocks M of regular length
k, wherein, k=1 ..., K, each message blocks can be divided into N constituent element c again
i, wherein, i=1 ..., N, if with each constituent element as the node in the network, with the two c between constituent element
iAnd c
jCarry out the XOR relation, as the contact between the node in the network, its operation values a
IjAs limit power, construct a with dividend right message blocks network from any message blocks; Wherein, i=1 ..., N, j=1 ... N, i ≠ j;
2) set up the message blocks network to the mapping of complex dynamic network; Set of node V=(c with the message blocks network
i)
NWith limit collection A=(a
Ij)
N * NInformation is mapped to complex dynamic network
I=1,2 ..., the node state initial value among the N
(i=1 ..., N) with network adjacency matrix E=(e
Ij)
N * NIn, wherein,
For node i in the complex dynamic network at t dynamics state variable constantly,
Local kinetics equation for node i, in this method, be taken as the logistic mapping, namely, f (x)=mx (1-x), m ∈ (3.57,4), obtain containing the complex dynamic network of message weight, make any subtle change in the message be diffused into all nodes of the whole network rapidly by node initial value and network topology matrix;
3) pass through message blocks M
kThe complex dynamic network that contains the message weight carry out R wheel interative computation and quantification treatment, obtain exporting Y
k, again with the middle hash value H of k-1 message blocks
K-1Carry out XOR, obtain this to message blocks M
kThe middle hash value H that handles
k, the hash value H that last piece MK disposes and obtains
KBe final hash value.
2. the Hash function construction method based on complex dynamic network according to claim 1, it is characterized in that: step 2) in, the node kinetics equation adopts the Logistic mapping, and the node kinetics equation that contains in the complex dynamic network of message weight is alternative with any chaotic maps.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010197983 CN101872339B (en) | 2010-06-11 | 2010-06-11 | Hash algorithm based on complex dynamic network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010197983 CN101872339B (en) | 2010-06-11 | 2010-06-11 | Hash algorithm based on complex dynamic network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101872339A CN101872339A (en) | 2010-10-27 |
| CN101872339B true CN101872339B (en) | 2013-08-07 |
Family
ID=42997205
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010197983 Active CN101872339B (en) | 2010-06-11 | 2010-06-11 | Hash algorithm based on complex dynamic network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101872339B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103139013A (en) * | 2013-01-22 | 2013-06-05 | 南京邮电大学 | State observer and state estimation method of complex dynamic network |
| CN105629728B (en) * | 2015-12-23 | 2018-07-17 | 辽宁石油化工大学 | The modeling method of complex dynamic network and the design method of model controller |
| CN106100825A (en) * | 2016-05-31 | 2016-11-09 | 深圳市风云实业有限公司 | High-throughput SHA 1 algorithm based on FPGA |
| CN107800531A (en) * | 2017-12-13 | 2018-03-13 | 广西师范大学 | A kind of method in the cycle of chaos system under table analysis finite accuracy using Hash |
| CN108235447B (en) * | 2018-01-15 | 2019-07-02 | 淮阴师范学院 | A kind of connection method of complex dynamic network |
| CN109253985B (en) * | 2018-11-28 | 2022-01-11 | 东北林业大学 | Method for identifying wood grade for koto panel by near infrared spectrum based on neural network |
| CN109523611B (en) * | 2018-11-28 | 2023-05-09 | 百度在线网络技术（北京）有限公司 | Verification code picture generation method and device |
| CN110011838B (en) * | 2019-03-25 | 2021-08-03 | 武汉大学 | Real-time tracking method for PageRank value of dynamic network |
| CN112532475B (en) * | 2020-11-23 | 2022-03-08 | 南京邮电大学 | State estimation method of multilayer complex dynamic network |
| CN115994373B (en) * | 2023-03-22 | 2023-05-30 | 山东中联翰元教育科技有限公司 | College entrance examination volunteer filling system data encryption method based on big data |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5949884A (en) * | 1996-11-07 | 1999-09-07 | Entrust Technologies, Ltd. | Design principles of the shade cipher |
| CN101399667A (en) * | 2007-09-29 | 2009-04-01 | 索尼（中国）有限公司 | Step function device and message spreading method for generating fast safe Hash function |
-
2010
- 2010-06-11 CN CN 201010197983 patent/CN101872339B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5949884A (en) * | 1996-11-07 | 1999-09-07 | Entrust Technologies, Ltd. | Design principles of the shade cipher |
| CN101399667A (en) * | 2007-09-29 | 2009-04-01 | 索尼（中国）有限公司 | Step function device and message spreading method for generating fast safe Hash function |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101872339A (en) | 2010-10-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101872339B (en) | Hash algorithm based on complex dynamic network | |
| Boyle et al. | Function secret sharing: Improvements and extensions | |
| Aragon et al. | Durandal: a rank metric based signature scheme | |
| Patro et al. | Secure, lossless, and noise-resistive image encryption using chaos, hyper-chaos, and DNA sequence operation | |
| CN106941407B (en) | Method and device for dynamically encrypting platform data | |
| CN104270247A (en) | Efficient generic Hash function authentication scheme suitable for quantum cryptography system | |
| CN111552849B (en) | Searchable encryption method, system, storage medium, vehicle-mounted network and smart grid | |
| CN103425941A (en) | Cloud storage data integrity verification method, equipment and server | |
| CN107733655B (en) | APUF security authentication method based on polynomial reconstruction | |
| Saravanan et al. | A hybrid chaotic map with coefficient improved whale optimization-based parameter tuning for enhanced image encryption | |
| Soleymani et al. | List-decodable coded computing: Breaking the adversarial toleration barrier | |
| CN102289425A (en) | Hash algorithm based on extensible precision chaos | |
| WO2017049790A1 (en) | Online/offline signature system and method based on multivariate cryptography | |
| CN113094633A (en) | Efficient range proving method based on scalar equality inner product | |
| AU2020202883B1 (en) | Systems and computer-implemented methods for generating pseudo random numbers | |
| Yang et al. | Image encryption scheme based on mixed chaotic bernoulli measurement matrix block compressive sensing | |
| Li et al. | A image encryption algorithm based on coexisting multi-attractors in a spherical chaotic system | |
| Jiang et al. | Image encryption algorithm based on discrete quantum baker map and chen hyperchaotic system | |
| Applebaum et al. | Cryptography by cellular automata or how fast can complexity emerge in nature? | |
| Song et al. | Multi-image reorganization encryption based on SLF cascade chaos and bit scrambling | |
| Li et al. | Quantum key distribution post-processing: A heterogeneous computing perspective | |
| CN106201435A (en) | Pseudo-random number generation method based on cell neural network | |
| Zhang et al. | Construction of high-dimensional cyclic symmetric chaotic map with one-dimensional chaotic map and its security application | |
| Pointcheval et al. | A New-Complete Problem and Public-Key Identification | |
| Dawson et al. | Ensuring privacy and confidentiality of data on the cloud using an enhanced homomorphism scheme |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20101027 Assignee: Jiangsu Nanyou IOT Technology Park Ltd. Assignor: NANJING University OF POSTS AND TELECOMMUNICATIONS Contract record no.: 2016320000208 Denomination of invention: Hash algorithm based on complex dynamic network Granted publication date: 20130807 License type: Common License Record date: 20161110 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model | ||
| EC01 | Cancellation of recordation of patent licensing contract |
Assignee: Jiangsu Nanyou IOT Technology Park Ltd. Assignor: NANJING University OF POSTS AND TELECOMMUNICATIONS Contract record no.: 2016320000208 Date of cancellation: 20180116 |
|
| EC01 | Cancellation of recordation of patent licensing contract | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20101027 Assignee: NANJING NANYOU INSTITUTE OF INFORMATION TECHNOVATION Co.,Ltd. Assignor: NANJING University OF POSTS AND TELECOMMUNICATIONS Contract record no.: 2018320000285 Denomination of invention: Hash algorithm based on complex dynamic network Granted publication date: 20130807 License type: Common License Record date: 20181101 |
|
| EE01 | Entry into force of recordation of patent licensing contract | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210105 Address after: Room 102 and 103, building 1, No. 53, Renmin Road, Huangjian Town, Tinghu District, Yancheng City, Jiangsu Province 224000 (20) Patentee after: Yancheng Heye Industrial Investment Co.,Ltd. Address before: 518000 No.6 Qinglong Road, Qinglong Road, Qinghua community, Longhua street, Longhua District, Shenzhen City, Guangdong Province Patentee before: Shenzhen Pengbo Information Technology Co.,Ltd. Effective date of registration: 20210105 Address after: 518000 No.6 Qinglong Road, Qinglong Road, Qinghua community, Longhua street, Longhua District, Shenzhen City, Guangdong Province Patentee after: Shenzhen Pengbo Information Technology Co.,Ltd. Address before: 210003, No. 66, new exemplary Road, Nanjing, Jiangsu Patentee before: NANJING University OF POSTS AND TELECOMMUNICATIONS |
|
| TR01 | Transfer of patent right |