CN103117850B - A kind of method for building up of the cryptographic system based on random sequence database - Google Patents
A kind of method for building up of the cryptographic system based on random sequence database Download PDFInfo
- Publication number
- CN103117850B CN103117850B CN201110364005.9A CN201110364005A CN103117850B CN 103117850 B CN103117850 B CN 103117850B CN 201110364005 A CN201110364005 A CN 201110364005A CN 103117850 B CN103117850 B CN 103117850B
- Authority
- CN
- China
- Prior art keywords
- random sequence
- database
- character string
- sequence
- byte
- 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.)
- Expired - Fee Related
Links
Abstract
Denomination of invention: a kind of cryptographic system based on random sequence database the invention provides a kind of cryptographic system based on random sequence database.This cryptographic system changes bit stream into random sequence bit stream by 8 bits be made up of 256 data and the random sequence database D corresponding with it.The conversion of random sequence database D to bit stream is realized by character string search.Random sequence database D can realize each encryption or deciphers a byte and dynamically update with synchronous.This cryptographic system be real " one-time pad " improve cryptographic system, can not decode completely.
Description
Technical field
The invention belongs to information security field, particularly relate to a kind of method for building up of the cryptographic system based on random sequence database.
Background technology
Cryptographic system is core and the key technology of information security.Although the cryptographic system kind of current practical application is a lot, its cryptographic system can be divided into two classes: DSE arithmetic and asymmetric cryptosystem.1949, Shannon delivered " Communicationtheoryofsecrecysystem " seminal paper, demonstrated and only had the cryptographic system of " one-time pad " to be only cryptographic system that can not decode in theory, that be perfectly safe.But there is the problem that secret key produces, distributes and manage very difficulty in the cryptographic system due to " one-time pad ", makes it apply and be restricted.In order to reach similar " one-time pad " such fail safe, the cryptographic system of " one-time pad " is imitated to give birth to as block cipher and stream cipher application.At present, stream cipher is the main flow password of countries in the world information security field.Stream cipher has many kinds of methods for designing, such as shift-register sequence, nonlinear combined sequences, nonlinear filtered sequence and the method such as clock controlled sequence and chaos sequence.
Stream cipher refers to and utilizes a small amount of key to produce a large amount of pseudo random bit, for the encryption to plaintext bit stream by specific complicated cryptographic algorithm.Deciphering refers to by same key and cryptographic algorithm and the pseudo random bit identical with encryption, in order to reduction expressly bit stream.Therefore, the key of stream cipher is the algorithm producing key sequence, the fail safe of its cryptographic system also depends primarily on key sequence, but because mostly key sequence is by the pseudo random sequence of a seed secret key k through certain specific deterministic algorithm generation, therefore stream cipher is the cryptographic system based on mathematical computations, and it can be decoded by computer in theory.Therefore, essentially, stream cipher is not the cryptographic system of " one-time pad ".
The present invention proposes a cryptographic system based on random sequence database, this cryptographic system is similar to stream cipher, it is all each encryption byte, but stream cipher uses pseudo random sequence as key sequence, and this cryptographic system then uses random sequence database that plain text stream is transformed to random sequence.What the invention provides one " one-time pad " improves cryptographic system, can not decode completely, also automatically can detect the integrality of cipher-text information simultaneously, guarantees that cipher-text information is not tampered, counterfeit, can be widely used in the every field of information security.
Summary of the invention
A kind of cryptographic system based on random sequence database that the present invention sets up, take following steps and method:
(1) 8 bit binary data storehouse D first, are set up.
As shown in Figure 1, A is 8 bits to the structure of this database, and B is the random sequence (random sequence be such as made up of 0 and 1) that each binary number is corresponding.Represent 8 bits of 0-255 with A (i), B (i) represents the random sequence corresponding with A (i).The setting of B (i) sequence length is enough to ensure that the uniqueness of random sequence ki and sequence search arithmetic speed are for foundation.This database D has 256 data.Due to 2
16=2
8* 2
8=256*2
8=256*256, corresponding to 256 binary data, each 8 bit binary data can find 256 different 16 binary random sequences to correspond in theory.The length of each random sequence B (i) is arranged between 30-100 character and is enough to satisfy the demand.
(2) encryption method:
First plaintext M is converted to binary system, is then automatically divided into some unit by each byte i.e. 8 bits, such as m
1, m
2, m
3..., m
n.Then, retrieve in database D successively, find the random sequence B (i) of its correspondence according to its 8 bits A (i) retrieved, then in B (i), intercept one section of sequence ki be made up of 16 characters at random again.K is obtained successively after all bytes of plaintext M complete above-mentioned conversion
1, k
2, k
3..., k
n, namely form ciphertext.Random sequence ki also can again through enciphering transformation Ci=E (ki) (i=1,2,3 ..., n), then finally can obtain ciphertext C=c
1c
2c
3... c
n.
Wherein, k
1, k
2, k
3...
,k
nneed meet uniqueness condition, namely in database D, these random sequence ki are unique, if the ki be truncated to can not meet uniqueness condition, then must again choose, until meet uniqueness condition.The uniqueness of inspection ki, can use string search algorithm, search in database D, if ki only has a Search Results, then show that ki is unique in database D, otherwise be not unique.
(3) secret key dynamic updating method:
In ciphering process, secret key can with each encryption byte (8 bit m
i) expressly automatically upgrade afterwards, its method upgraded is: m
iafter corresponding random sequence is intercepted a cross-talk sequence ki, namely automatically to delete from former random sequence, and be inserted into after certain conversion (as 0 and 1 exchange process) on the jth position in the random sequence after deletion ki.J can be the constant of an agreement, also can be the function of plaintext " byte " ordinal number.If byte ordinal number is i, then when encryption i-th byte, j=F (i).
(4) decryption method:
Ciphertext C is through decryption transformation ki=D (c
i) (i=1,2,3 ..., n), obtain random sequence character string successively: k
1, k
2, k
3..., ki ... k
n.If ciphertext itself is made up of above-mentioned random sequence, then need not be decrypted conversion again, in database D, searches character string k successively
1, k
2, k
3..., ki ... k
n, obtain 8 bit m of its correspondence
1, m
2, m
3..., m
n, be namely convertible into cleartext information.In decrypting process, secret key upgrades after can obtaining a byte plaintext with each deciphering automatically, and its method upgraded is: obtain corresponding m at random data library lookup ki at every turn
iafterwards, this character string ki and automatically to delete from former random sequence, and be inserted into after certain conversion (as 0 and 1 exchange process) on the jth position in the random sequence of deleting after ki.
(5) database D synchronized update way:
Because database D is in the state of dynamically updating when encryption and decryption, this renewal is the rearrangement to the random sequence in database D, so, any active attack (such as insert ciphertext character, delete or replay operations) having influence on random sequence rearrangement in database all may cause decryption interruptions (as long as the random sequence character string uniqueness condition that ciphertext solves is destroyed, decrypting process and self termination).If sending and receiving the original shared database of both sides is D
0, after encryption, the database update of transmit leg is D
1if recipient's successful decryption, then its database is automatically updated into D
1, otherwise do not upgrade, request transmit leg resends, and the database of transmit leg encryption turns back to D
0.That is, as long as recipient deciphers unsuccessful, then ask transmit leg to resend by database before.
Cryptographic system of the present invention has following features:
1, the database D that in this cryptographic system, communication two party has is a toy data base only having 256 data, and in encryption process, the speed of service is very fast.
2, after both sides share a database D, this database can realize automatically upgrading in encryption process, introduces randomisation process at no point in the update process, thus achieves real " one-time pad ".
3, this cryptographic system overcame completely in the past in " one-time pad " system and required the shortcoming that secret key must be identical with length of the plaintext, the distribution of secret key is no longer a difficult problem with management, only need build a small-sized random sequence database, the secret key utilizing character string search comparison instrument can easily realize each bit is encrypted is distributed.
4, native system, owing to being that " one-time pad " can not decode system, carries out active attack to native system exactly to the unique channel that native system damages.When assailant ciphertext character is inserted, delete or replay operations time, if the character inserted is not present in database D through deciphering the ki that obtains, the character so inserted just does not affect correct deciphering.But, carry out deleting or replay operations time, just may impact deciphering.If occur correctly to decipher and (occur when searching character string ki in such as decrypting process successively in database D that lookup result uniqueness is destroyed, or deciphered rear discovery mess code or other meaningless information) situation, then can judge that ciphertext is tampered.Therefore, whether this cryptographic system has and automatically detects ciphertext and be stolen and the feature of distorting, destroying, and ciphertext can accomplish to maintain complete secrecy, can not be counterfeit.
Accompanying drawing illustrates:
Fig. 1: 8 bit binary data storehouse D, are made up of 256 data, and A is 8 bits of 0-255, and B is the random sequence (30-100 individual 0 and 1 be made up of) corresponding with each 8 binary systems.
Fig. 2: information encryption flow process and method
Fig. 3: decrypts information flow process and method
Fig. 4: the method that secret key upgrades
Embodiment
First, 8 bit binary data storehouse D are built.As shown in Figure 1, A (i) represents 8 bits from 0 to 255; B (i) represents the random sequence corresponding with it.Random sequence B (i) can be made up of any character, and in Fig. 1, we suppose that random sequence is made up of 0 and 1.The setting of sequence length is enough to ensure that the uniqueness of random sequence ki and sequence search arithmetic speed are for foundation.Due to 2
16=65536, corresponding to 256 binary data, each binary data can find 256 16 binary random sequences to correspond in theory.The length of each random sequence is arranged between 30-100 character and is enough to satisfy the demand.
As a cleartext information M need be encrypted, be first converted into binary system, be then automatically divided into some unit by each byte i.e. 8 bits, such as m
1, m
2, m
3..., m
n.Then, retrieve in database D successively, find the random sequence B (i) of its correspondence according to its 8 bits A (i) retrieved, then in B (i), intercept one section of sequence ki be made up of 16 characters at random again.K is obtained successively after all bytes of plaintext M complete above-mentioned conversion
1, k
2, k
3..., k
n, namely form ciphertext.Random sequence ki also can again through enciphering transformation Ci=E (k
i) (i=1,2,3 ..., n), then finally can obtain ciphertext C=c
1c
2c
3... c
n.Enciphering transformation can be to k with the binary number K of 16
ido XOR process.Fig. 2 represents flow process and the method for information encryption.
Wherein, k
1, k
2, k
3..., k
nneed meet uniqueness condition, namely in database D, these random sequence ki are unique, if the ki be truncated to can not meet uniqueness condition, then must again choose, until meet uniqueness condition.
Random sequence database D can dynamically update along with often encrypting a byte.Fig. 4 represents encryption binary data m
iafter the ki " 0101011000010100 " of " 10011010 " is selected, delete from original position, after 0 and 1 exchange process, become " 1010100111101011 ", on the position being inserted into the 10th character of the random sequence of deleting after ki again (j=10), thus change original random sequence corresponding to binary data " 10011010 ".
The method of decrypts information is, ciphertext C is through decryption transformation ki=D (c
i) (i=1,2,3 ..., (decryption transformation can be to c with the binary number K of 16 n) afterwards
ido XOR process), obtain random sequence character string successively: k
1, k
2, k
3..., ki ... k
n.If ciphertext itself is made up of above-mentioned random sequence ki, then need not be decrypted conversion again, in database D, searches character string k successively
1, k
2, k
3..., ki ... k
n, obtain 8 bit m of its correspondence
1, m
2, m
3..., m
n, be namely convertible into cleartext information.
Random sequence database D also can dynamically update along with each deciphering byte, thus ensures that random sequence database D is synchronously consistent with information transmitter.Dynamically update identical with encrypting the dynamic updating method of random sequence database D after a byte.For Fig. 4, in random sequence database D, during deciphering, search character string ki " 0101011000010100 ", obtain the binary data m of its correspondence
i" 10011010 ", then ki deletes from original position, after 0 and 1 exchange process, become " 1010100111101011 ", on the position being inserted into the 10th character of the random sequence of deleting after ki again (j=10), the random sequence database D after dynamically updating like this and information transmitter just maintain synchronous.
If expressly have 1000 bytes, so after encryption, random sequence database D just experience 1000 secondary data upgrades.If database is D before encryption
0, encrypted data storehouse is D
1, the byte number so encrypted is more, or after too much taking turns information encryption, D
1and D
0to difference be become larger, to such an extent as to completely different.
This cryptographic system can carry out Information hiding.Can add some in ciphertext is non-existent character string in random sequence database D, does not affect decrypted result completely.
Because random sequence database D is made up of random sequence, the character string ki simultaneously intercepted also is random intercepting, after each encryption byte, database D upgrades once automatically, therefore this cryptographic system be real " one-time pad " improve cryptographic system, can not decode completely.
When assailant ciphertext character is inserted, delete or replay operations time, may impact (if the character inserted is not present in database D through deciphering the ki that obtains, the character so inserted just does not affect correct deciphering) deciphering.In decrypting process, if find when searching character string ki that its uniqueness in database D is destroyed, or decipher the situation of rear discovery mess code or other meaningless information, then can judge that ciphertext is tampered.Therefore, whether this cryptographic system has and automatically detects ciphertext and be stolen and the feature of distorting, destroying, and ciphertext can accomplish to maintain complete secrecy, can not be counterfeit.
Claims (6)
1., based on a method for building up for the cryptographic system of random sequence database, it is characterized in that:
(1) first, random sequence database D is set up; This database is made up of 256 data, and every bar data are that the random sequence B (i) of 8 bits A (i) and correspondence thereof is formed;
(2) encryption method: first plaintext M is converted to binary number, is divided into some unit m automatically by each byte i.e. 8 bits
1, m
2, m
3..., m
n; Then, retrieve in database D successively, find the random sequence B (i) of its correspondence according to its 8 bits A (i) retrieved, then in B (i), intercept one section of sequence ki be made up of 16 characters at random again; Ki need meet uniqueness condition, and namely in database D, these random sequence ki are unique, if the ki be truncated to can not meet uniqueness condition, then must again choose, until meet uniqueness condition; Use the uniqueness of string search algorithm inspection ki, search in database D, if ki only has a Search Results, then show that ki is unique in database D, otherwise be not unique; K is obtained successively after all bytes of plaintext M complete above-mentioned conversion
1, k
2, k
3..., k
n, namely form ciphertext;
(3) secret key dynamic updating method: in ciphering process, secret key is with each encryption byte expressly m
iupgrade afterwards and automatically, described secret key is made up of random sequence database D; Its method upgraded is: m
icorresponding random sequence deletes ki after being intercepted a cross-talk sequence ki automatically from former random sequence, and is inserted on the jth position in the random sequence after deleting ki after 0 and 1 exchange process; J is the function of agreement constant or plaintext byte ordinal number;
(4) decryption method: search character string k successively in the D of receiving side data storehouse
1, k
2, k
3..., k
n, obtain 8 bit m of its correspondence
1, m
2, m
3..., m
n, be namely convertible into cleartext information;
(5) database D synchronized update way: set and send and receive the original database of both sides as D
0, after encryption, the database update of transmit leg is D
1if recipient's successful decryption, then its database is automatically updated into D
1, it is identical that update method and transmit leg encrypt the update method of random sequence database after a byte, otherwise do not upgrade, and request transmit leg resends, and the database of transmit leg encryption turns back to D
0.
2. method according to claim 1, is characterized in that: step (2) obtains k
1, k
2, k
3..., k
nafter, also comprise and conversion c is encrypted to random sequence
i=E (k
i), i=1,2,3 ..., n, finally obtains ciphertext C=c
1c
2c
3c
n; Accordingly, in database D, search character string in step (4) before also comprise: ciphertext C is through decryption transformation k
i=E ' (c
i), i=1,2,3 ..., after n, obtain random sequence character string k successively
1, k
2, k
3..., k
n.
3. method according to claim 2, is characterized in that: the character string that B (i) is made up of 0 and 1, or other arbitrary string.
4. method according to claim 1, it is characterized in that: in decrypting process, secret key upgrades after obtaining a byte plaintext with each deciphering automatically, and its method upgraded is: when deciphering at every turn, search obtain corresponding m according to the character string ki that will decipher in random sequence database
iafterwards, this character string ki deletes automatically from former random sequence, and is inserted into after 0 and 1 exchange on the jth position in the random sequence of deleting after ki.
5. method according to claim 1, is characterized in that inserting non-existent sequence ks in random sequence database D in cipher-text information, and does not affect it and correctly decipher.
6. method according to claim 1, is characterized in that: the random sequence database D that information sent and received both sides carries out synchronized update; If ciphertext meets with attack and distorts, cause ki uniqueness to be destroyed, then decipher and interrupt voluntarily, require that transmit leg resends information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110364005.9A CN103117850B (en) | 2011-11-16 | 2011-11-16 | A kind of method for building up of the cryptographic system based on random sequence database |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110364005.9A CN103117850B (en) | 2011-11-16 | 2011-11-16 | A kind of method for building up of the cryptographic system based on random sequence database |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103117850A CN103117850A (en) | 2013-05-22 |
| CN103117850B true CN103117850B (en) | 2016-01-20 |
Family
ID=48416131
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110364005.9A Expired - Fee Related CN103117850B (en) | 2011-11-16 | 2011-11-16 | A kind of method for building up of the cryptographic system based on random sequence database |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103117850B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9454653B1 (en) * | 2014-05-14 | 2016-09-27 | Brian Penny | Technologies for enhancing computer security |
| CN105024807A (en) * | 2014-04-30 | 2015-11-04 | 宇龙计算机通信科技(深圳)有限公司 | Data processing method and system |
| CN107209787B (en) * | 2015-02-11 | 2022-02-08 | 维萨国际服务协会 | Improving searching ability of special encrypted data |
| KR20180083093A (en) * | 2017-01-12 | 2018-07-20 | 에스케이하이닉스 주식회사 | Memory system and operating method of memory system |
| CN107196760B (en) | 2017-04-17 | 2020-04-14 | 徐智能 | Sequence encryption method of adjoint random reconstruction key with adjustability |
| US11502818B2 (en) * | 2020-05-06 | 2022-11-15 | King Saud University | System to secure encoding and mapping on elliptic curve cryptography (ECC) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1769637A (en) * | 2004-11-01 | 2006-05-10 | 华为技术有限公司 | Electric key and electric lock device and realization method thereof |
| CN102025482A (en) * | 2009-09-10 | 2011-04-20 | 中国科学院华南植物园 | Virtual genome-based cryptosystem (VGC) |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8031875B1 (en) * | 2007-08-09 | 2011-10-04 | Emc Corporation | Key distribution in unidirectional channels with applications to RFID |
-
2011
- 2011-11-16 CN CN201110364005.9A patent/CN103117850B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1769637A (en) * | 2004-11-01 | 2006-05-10 | 华为技术有限公司 | Electric key and electric lock device and realization method thereof |
| CN102025482A (en) * | 2009-09-10 | 2011-04-20 | 中国科学院华南植物园 | Virtual genome-based cryptosystem (VGC) |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103117850A (en) | 2013-05-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108683501B (en) | Multiple identity authentication system and method with timestamp as random number based on quantum communication network | |
| CN109525390B (en) | Quantum key wireless distribution method and system for terminal equipment secret communication | |
| CN103117850B (en) | A kind of method for building up of the cryptographic system based on random sequence database | |
| CN103795533A (en) | Id-based encryption and decryption method, and apparatus for executing same | |
| JP7353375B2 (en) | End-to-end double ratchet encryption with epoch key exchange | |
| CN109543434B (en) | Block chain information encryption method, decryption method, storage method and device | |
| EP3476078B1 (en) | Systems and methods for authenticating communications using a single message exchange and symmetric key | |
| CN103152362B (en) | Based on the large data files encrypted transmission method of cloud computing | |
| US6640303B1 (en) | System and method for encryption using transparent keys | |
| CN112738051B (en) | Data information encryption method, system and computer readable storage medium | |
| CN111970114B (en) | File encryption method, system, server and storage medium | |
| US9059838B2 (en) | Encryption algorithm with randomized buffer | |
| CN105306194A (en) | Multiple encryption method and multiple encryption system for encrypting file and/or communication protocol | |
| CN104243149A (en) | Encrypting and decrypting method, device and server | |
| CN111385085B (en) | Quantum three-level key system implementation method and system | |
| CN115632880B (en) | Reliable data transmission and storage method and system based on state cryptographic algorithm | |
| CN210955077U (en) | Bus encryption and decryption device based on state cryptographic algorithm and PUF | |
| CN110225028B (en) | Distributed anti-counterfeiting system and method thereof | |
| CN103051459A (en) | Management method and device of traction secrete key of safety card | |
| CN103237302A (en) | Sensing information safety protection method for RFID (radio frequency identification) tags in Internet of Things | |
| CN103873257A (en) | Secrete key updating, digital signature and signature verification method and device | |
| CN100459493C (en) | Stream cipher generator, random digit generation method, encrypting system and encryption method | |
| KR101602803B1 (en) | The encryption and decryption Method of using to polarization | |
| CN113518244B (en) | Digital television signal data transmission method and device based on substitute text combination | |
| US20160359620A1 (en) | Method and system for remotely keyed encrypting/decrypting data with prior checking a token |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160120 Termination date: 20171116 |