CN107800531A - A kind of method in the cycle of chaos system under table analysis finite accuracy using Hash - Google Patents
A kind of method in the cycle of chaos system under table analysis finite accuracy using Hash Download PDFInfo
- Publication number
- CN107800531A CN107800531A CN201711326605.XA CN201711326605A CN107800531A CN 107800531 A CN107800531 A CN 107800531A CN 201711326605 A CN201711326605 A CN 201711326605A CN 107800531 A CN107800531 A CN 107800531A
- Authority
- CN
- China
- Prior art keywords
- chaos system
- hash
- chaos
- cycle
- finite accuracy
- 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
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/001—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using chaotic signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Power Engineering (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of method in the cycle of chaos system under table analysis finite accuracy using Hash, it is characterised in that comprises the following steps：1）The generation of chaos sequence；2）The construction of hash function；3）Obtain Hash table storage address；4）The cycle of chaos system searches.This method passes through some position for the element in chaos sequence being mapped in Hash table, when the Hash table directly conducted interviews when the lookup of chaos sequence can obtain the cycle of chaos sequence, to accelerate the speed searched, and seeking scope can be reduced, can quickly search cycle of the chaos system under finite accuracy, the time of storage and the lookup consumption of data is substantially reduced, can almost regard constant time as.
Description
Technical field
The present invention relates to cycle location technology of the fast positioning chaos system under computer finite accuracy, is specifically one kind
Using the method in the cycle of chaos system under Hash table analysis finite accuracy.
Background technology
Chaos refers to uncertain, the similar randomness that certainty dynamic system is shown because sensitive to initial value
Motion.In theory, chaos system has the characteristics that ergodic, the sensitiveness to primary condition, long-term unpredictability, and
And chaos system or chaotic maps have preferable advanced dynamic.Digital chaotic system is normally based on computer or numeral electricity
Road system realizes, still, because the computational accuracy of computer or digital circuit is limited, therefore digital chaotic system meeting
There is the defects of long period, nondenaturing PAGE, linear complexity are low and correlation is strong, due to limited computational accuracy, this short week
Phase phenomenon is referred to as finite precision effect.
In the practical application such as secure communication and image encryption, the performance of chaos system is influenceed by finite accuracy, leads to
The security of Image Encryption Scheme of the research based on chaos sequence is crossed, can be bright only by the difference selection of three plaintext images
Text is analyzed to attack chaos system, and therefore, digital chaotic system dynamics degenerate problem causes the concern of scholars.In order to grind
The dynamics for studying carefully chaos system is degenerated, and its short periodic phenomena is the emphasis of research.Short periodic phenomena is that chaos sequence the cycle occurs
Property circulation or fixing point, therefore cycle of fast positioning chaos system and to study its short periodic phenomena be vital, however,
The basic thought of the cycle methods of tradition positioning chaos system is to compare each element of chaos system in order, until finding repetition
Chaos value, be that average search length is larger, less efficient when the element of chaos system is more the shortcomings that this method.Cause
This, quickly searches the repetition values of chaos system, it is necessary to a kind of new method for positioning the chaos system cycle under finite accuracy.
Hash also known as " hashes ", is by calculating Hash Round Robin data partition, breaking original relation between element, make the member in set
Element is arranged according to the classification of hash function.Hash table is referred to as according to the storage organization of Hash storage method, Hash table be by
Element in set is mapped to the storage location being recorded in table, simply enters and searches the element and can find it and deposit accordingly
Storage space is put.
The content of the invention
The purpose of the present invention is in view of the shortcomings of the prior art, and to provide a kind of use and mixed under Hash table analysis finite accuracy
The method in the cycle of ignorant system.This method by some position for the element in chaos sequence being mapped in Hash table,
The Hash table directly to be conducted interviews when the lookup of progress chaos sequence can obtain the cycle of chaos sequence, to accelerate to look into
The speed looked for, and seeking scope can be reduced, can quickly search cycle of the chaos system under finite accuracy, data
The time of storage and lookup consumption substantially reduces, and can almost regard constant time as.
Realizing the technical scheme of the object of the invention is：
The method in the cycle of chaos system, comprises the following steps under a kind of table analysis finite accuracy using Hash：
1) generation of chaos sequence：In this stage, it is thus necessary to determine that the computational accuracy of computer, the initial value of chaos system
And systematic parameter, and the iterations of chaos system, the condition of initialization is substituted into chaos system, obtains one group of chaos sequence
Row；
2) construction of hash function：Hash lookup is firstly the need of one hash function of construction, by original intuitively chaos system
The output of system is mapped as random value；
3) Hash table storage address is obtained：Chaos system is exported to the hash function acquisition chaos system for substituting into step 1) construction
The Hash Round Robin data partition of system, Hash table storage location corresponding to chaos system output can be found by Hash Round Robin data partition；
4) cycle of chaos system searches：With reference to step 2), if chaos system occur in Hash table two or two with
During upper identical storage location, illustrate that repeating occurs in the output of chaos system, that is, obtain chaos system second in Hash table
At the time of secondary identical storage location, as cycle of the chaos system under finite accuracy.
The construction of hash function described in step 1), comprises the following steps：
(1) constant A (0 ＜ A ＜ 1) is multiplied by with chaos system value key first, extracts its fractional part, obtain [keyA]；
(2) following operate is carried out：
H (key)=floor (m (keyA- [keyA])), (1)
Wherein, floor () represents the maximum integer more than (), and m is arbitrary constant.
Constant A described in step (1) is：
The advantages of this hash function is that m can select arbitrary constant, also, constant A ∈ (0,1), due to finite accuracy
Under the element of chaos system be mainly decimal, the element of chaos system can be converted into from decimal by the hash function whole
Number, therefore, the hash function is suitable for quickly searching the chaos system cycle under finite accuracy.
The technical program designs construction hash function first, and chaos system is exported and substitutes into hash function, obtains chaos system
The storage location that system output is calculated with hash function, i.e. Hash Round Robin data partition, it is defeated can to find chaos system by Hash Round Robin data partition
Go out corresponding storage location, because chaos system produces chaotic dynamics performance degradation under the finite accuracy of computer, and go out
Existing short periodic phenomena, so chaos system after successive ignition, may export multiple identical iterative values, utilizes Hash table
Identical storage location is found, i.e., the output of chaos system is identical twice, it is hereby achieved that the cycle of chaos system.
The technical program is associated with chaos system output by the storage location of record using the thought of Function Mapping, without
Searching loop search, directly according to chaos system output and mapping relations calculate storage location of the output in Hash table from
And the cycle of chaos system is found out, seeking scope can be significantly reduced, can quickly search chaos system in finite accuracy
Under cycle.
This method can reduce seeking scope, can quickly search cycle of the chaos system under finite accuracy, number
According to storage and search consumption time substantially reduce.
Brief description of the drawings
Fig. 1 is the method flow schematic diagram of embodiment.
Embodiment
Present invention is further elaborated with reference to the accompanying drawings and examples, but is not limitation of the invention.
Embodiment：
Reference picture 1, a kind of method in the cycle of chaos system under table analysis finite accuracy using Hash, including following step
Suddenly：
1) generation of chaos sequence：In this stage, it is thus necessary to determine that the computational accuracy of computer, the initial value of chaos system
And systematic parameter, and the iterations of chaos system, the condition of initialization is substituted into chaos system, obtains one group of chaos sequence
Row；
2) construction of hash function：Hash lookup is firstly the need of one hash function of construction, by original intuitively chaos system
The output of system is mapped as random value；
3) Hash table storage address is obtained：Chaos system is exported to the hash function acquisition chaos system for substituting into step 1) construction
The Hash Round Robin data partition of system, Hash table storage location corresponding to chaos system output can be found by Hash Round Robin data partition；
4) cycle of chaos system searches：With reference to step 2), if chaos system occur in Hash table two or two with
During upper identical storage location, illustrate that repeating occurs in the output of chaos system, that is, obtain chaos system second in Hash table
At the time of secondary identical storage location, as cycle of the chaos system under finite accuracy.
The construction of hash function described in step 1), comprises the following steps：
(1) constant A (0 ＜ A ＜ 1) is multiplied by with chaos system value key first, extracts its fractional part, obtain [keyA]；
(2) following operate is carried out：
H (key)=floor (m (keyA- [keyA])), (1)
Wherein, floor () represents the maximum integer more than (), and m is arbitrary constant.
Constant A described in step (1) is：
The advantages of this hash function is that m can select arbitrary constant, and in this example, m is 2 integral number power, also, constant
A ∈ (0,1), can be by the hash function by chaos system because the element of the chaos system under finite accuracy is mainly decimal
The element of system is converted into integer from decimal, and therefore, the hash function is suitable for quickly searching the chaos system under finite accuracy
Cycle.
Claims (3)
1. a kind of method in the cycle of chaos system under table analysis finite accuracy using Hash, it is characterised in that including following step
Suddenly：
1) generation of chaos sequence：Determine the computational accuracy of computer, the initial value of chaos system and systematic parameter, and chaos
The iterations of system, the condition of initialization is substituted into chaos system, obtains one group of chaos sequence；
2) construction of hash function：A hash function is constructed, the output of original intuitively chaos system is mapped as random value；
3) Hash table storage address is obtained：Chaos system is exported and substitutes into the hash function acquisition chaos system that step 1) constructs
Hash Round Robin data partition, Hash table storage location corresponding to chaos system output can be found by Hash Round Robin data partition；
4) cycle of chaos system searches：With reference to step 2), if there are two or more phases in Hash table in chaos system
With storage location when, illustrate chaos system output occur repeat, that is, obtain chaos system second of phase in Hash table
With storage location at the time of, as cycle of the chaos system under finite accuracy.
2. the method in the cycle of chaos system, its feature under the table analysis finite accuracy according to claim 1 using Hash
It is, the construction of the hash function described in step 1), comprises the following steps：
(1) constant A (0 ＜ A ＜ 1) is multiplied by with chaos system value key first, extracts its fractional part, obtain [keyA]；
(2) following operate is carried out：
H (key)=floor (m (keyA- [keyA])), (1)
Wherein, floor () represents the maximum integer more than (), and m is arbitrary constant.
3. the method in the cycle of chaos system, its feature under the table analysis finite accuracy according to claim 2 using Hash
It is, the constant A that step (1) is stated is：
<mrow>
<mi>A</mi>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msqrt>
<mn>5</mn>
</msqrt>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>/</mo>
<mn>2.</mn>
</mrow>
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711326605.XA CN107800531A (en) | 2017-12-13 | 2017-12-13 | A kind of method in the cycle of chaos system under table analysis finite accuracy using Hash |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711326605.XA CN107800531A (en) | 2017-12-13 | 2017-12-13 | A kind of method in the cycle of chaos system under table analysis finite accuracy using Hash |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107800531A true CN107800531A (en) | 2018-03-13 |
Family
ID=61537841
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711326605.XA Pending CN107800531A (en) | 2017-12-13 | 2017-12-13 | A kind of method in the cycle of chaos system under table analysis finite accuracy using Hash |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107800531A (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100459487C (en) * | 2003-12-31 | 2009-02-04 | 华中科技大学 | Chaotic cipher production method under limited precision |
| CN101872339A (en) * | 2010-06-11 | 2010-10-27 | 南京邮电大学 | Hash algorithm based on complex dynamic network |
| CN102184205A (en) * | 2011-04-28 | 2011-09-14 | 哈尔滨工业大学 | Multi-mode string matching algorithm based on extended precision chaos hash |
| CN102289425A (en) * | 2011-04-28 | 2011-12-21 | 哈尔滨工业大学 | Hash algorithm based on extensible precision chaos |
| CN102594566A (en) * | 2012-03-12 | 2012-07-18 | 浙江工业大学 | Chaos message authentication code realization method for wireless sensor network |
| CN104618091A (en) * | 2015-02-16 | 2015-05-13 | 哈尔滨理工大学 | Dual-chaotic system dynamic key and RSA jointed streaming media secret communication method |
| EP2966801A1 (en) * | 2014-07-08 | 2016-01-13 | Europa-Universität Viadrina Franfurt (ODER) | Chaotic based hash function and their use to authentication. |
| CN105681273A (en) * | 2015-12-17 | 2016-06-15 | 西安电子科技大学 | Client data deduplication method |
| CN106598969A (en) * | 2015-10-14 | 2017-04-26 | 北京国双科技有限公司 | Data query method and device |
-
2017
- 2017-12-13 CN CN201711326605.XA patent/CN107800531A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100459487C (en) * | 2003-12-31 | 2009-02-04 | 华中科技大学 | Chaotic cipher production method under limited precision |
| CN101872339A (en) * | 2010-06-11 | 2010-10-27 | 南京邮电大学 | Hash algorithm based on complex dynamic network |
| CN102184205A (en) * | 2011-04-28 | 2011-09-14 | 哈尔滨工业大学 | Multi-mode string matching algorithm based on extended precision chaos hash |
| CN102289425A (en) * | 2011-04-28 | 2011-12-21 | 哈尔滨工业大学 | Hash algorithm based on extensible precision chaos |
| CN102594566A (en) * | 2012-03-12 | 2012-07-18 | 浙江工业大学 | Chaos message authentication code realization method for wireless sensor network |
| EP2966801A1 (en) * | 2014-07-08 | 2016-01-13 | Europa-Universität Viadrina Franfurt (ODER) | Chaotic based hash function and their use to authentication. |
| CN104618091A (en) * | 2015-02-16 | 2015-05-13 | 哈尔滨理工大学 | Dual-chaotic system dynamic key and RSA jointed streaming media secret communication method |
| CN106598969A (en) * | 2015-10-14 | 2017-04-26 | 北京国双科技有限公司 | Data query method and device |
| CN105681273A (en) * | 2015-12-17 | 2016-06-15 | 西安电子科技大学 | Client data deduplication method |
Non-Patent Citations (2)
| Title |
|---|
| ROGELIO HASIMOTO-BELTRÁN等: "Cycle detection for secure chaos-based encryption", 《COMMUN NONLINEAR SCI NUMER SIMULAT》 * |
| 罗玉玲: "混沌图像编码加密及Hash函数构造研究", 《中国博士学位论文全文数据库》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2018032721A1 (en) | Image sharing method based on thumbnail image and terminal | |
| Yuan et al. | EncKV: An encrypted key-value store with rich queries | |
| Awad et al. | Chaotic searchable encryption for mobile cloud storage | |
| Zou et al. | Efficient and secure encrypted image search in mobile cloud computing | |
| CN105808622A (en) | File storage method and device | |
| WO2016134628A1 (en) | Hybrid data distribution in a massively parallel processing architecture | |
| CN102542405A (en) | Digital archive storage and identification method and system | |
| CN103699679A (en) | Method and equipment for retrieving information of target objects | |
| US20210044653A1 (en) | Method, apparatus, client terminal, and server for data processing | |
| CN108390760A (en) | Public key keyword can search for encryption method end to end in a kind of cloud data transmission | |
| CN104298687A (en) | Hash partitioning management method and device | |
| CN106599091A (en) | Storage and indexing method of RDF graph structures stored based on key values | |
| Yuan et al. | Towards privacy-preserving and practical image-centric social discovery | |
| Kang et al. | A security-aware data placement mechanism for big data cloud storage systems | |
| CN107086917B (en) | The encryption method that a kind of parallelization and structuring public key can search for | |
| CN104102748B (en) | File Mapping method and device and file recommendation method and device | |
| CN105389398A (en) | Picture photographing and searching method and device | |
| CN107800531A (en) | A kind of method in the cycle of chaos system under table analysis finite accuracy using Hash | |
| Su et al. | Design and implementation of various file deduplication schemes on storage devices | |
| US11106488B2 (en) | Blockchain read/write data processing method, apparatus, and server | |
| Parsola et al. | Mobile application for storage and retrieval of e-learning videos using hadoop | |
| CN113763099A (en) | Data searching method, device, equipment and storage medium | |
| CN112307035B (en) | Method and device for managing characteristic value ID, electronic equipment and storage medium | |
| Wadhwa et al. | Distributed locality sensitivity hashing | |
| Wei et al. | Verifiable multi-keyword fuzzy search over encrypted data in the cloud |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180313 |
|
| RJ01 | Rejection of invention patent application after publication |