CN108270565A - A kind of data mixing encryption method - Google Patents
A kind of data mixing encryption method Download PDFInfo
- Publication number
- CN108270565A CN108270565A CN201611257612.4A CN201611257612A CN108270565A CN 108270565 A CN108270565 A CN 108270565A CN 201611257612 A CN201611257612 A CN 201611257612A CN 108270565 A CN108270565 A CN 108270565A
- Authority
- CN
- China
- Prior art keywords
- key
- plaintext
- des
- rsa
- algorithms
- 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/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L9/3006—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters
- H04L9/302—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters involving the integer factorization problem, e.g. RSA or quadratic sieve [QS] schemes
-
- 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/0618—Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
- H04L9/0625—Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation with splitting of the data block into left and right halves, e.g. Feistel based algorithms, DES, FEAL, IDEA or KASUMI
-
- 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/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
- H04L9/0822—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s) using key encryption key
-
- 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
Abstract
The present invention provides a kind of data mixing encryption method, the method comprising the steps of S1：Sender sends plaintext P；Step S2：Plaintext P is encrypted with DES algorithms；Step S3：In data transmission procedure, key K is encrypted with RSA Algorithm；Step S4：On the basis of RSA Algorithm, to CKIt is decrypted；Step S5：With DES algorithms and key K to CPIt is decrypted；Step S6：Reciever obtains plaintext P.Compared with prior art：The present invention provides a kind of data mixing encryption methods, substantially increase the safety in data transmission procedure；The present invention Hybrid Encryption algorithm synthesis DES and RSA enciphering rate, for handle big data transmission when, enciphering rate far faster than the Hybrid Encryption algorithm of the rsa encryption speed present invention well solved DES and RSA key generation and manage the problem of.
Description
Technical field
The present invention relates to information security fields, and in particular to a kind of data mixing encryption method.
Background technology
With the rapid development of mobile Internet and computer technology, people’s lives level just steps up, intelligent hand
Machine plays very important role in daily life.Due to mobile phone it is light, quick, full-featured the advantages that, Ren Menyue
Come more dependent on mobile phone, and gradually computer is replaced to carry out various communications and data exchange service.Therefore, in mobile terminal to service
Data information security problem in device data transmission procedure is increasingly taken seriously, in information-based so flourishing society, once
The safety guarantee of mobile Internet and stablize system and be on the hazard, huge economic loss will be brought to operator and user.For
It solves the above problems, contemporary cryptology and network security technology gradually grow up.
Mainstream cryptography is divided into symmetric cryptography algorithm and Asymmetric Cryptography algorithm, the former Typical Representative algorithm has
DES, AES etc., the latter mainly supports RSA Algorithm.DES algorithm for encryption speed is quite fast, can be applied to big data and encrypts, but by
In the too short uncertainty with S boxes of its key length, information security is especially low, vulnerable in plain text, and the key management of DES
Consume very much the expense of system；RSA Algorithm is although safe, and still, RSA Algorithm is there are prime number examination and generates Big prime etc.
Problem, and the key generation of RSA is more difficult, it is difficult to all data be accomplished with the effect of one-time pad, and enciphering rate is unhappy, no
It is suitable for big data encryption.
In view of drawbacks described above, creator of the present invention obtains the present invention finally by prolonged research and practice.
Invention content
To solve above-mentioned technological deficiency, the technical solution adopted by the present invention is, provides a data mixing encryption method, should
Method includes the following steps：
Step S1：Sender sends plaintext P；
Step S2：Plaintext P is encrypted with DES algorithms, is expressed as：CP=ED(K, P), wherein, CPIt is that plaintext P adds
Ciphertext after close, EDA series of encryption conversion formulas of DES algorithms are represented, K is the key of DES algorithms；
Step S3：In data transmission procedure, key K is encrypted with RSA Algorithm, is expressed as：CK=ER(Ka,
K), wherein, CKIt is the encrypted ciphertexts of key K, ERRepresent the encryption formula of RSA Algorithm, KaIt is the public key of RSA Algorithm；
Step S4：On the basis of RSA Algorithm, to CKIt is decrypted, is expressed as：K=DR(Kb,CK), wherein, DRIt represents
The decryption formula of RSA Algorithm, KaIt is the private key of RSA Algorithm；
Step S5：With DES algorithms and key K to CPIt is decrypted, is expressed as P=DD(K,CP), wherein, DDRepresent DES calculations
A series of decryption conversion formulas of method；
Step S6：Reciever obtains plaintext P.
Preferably, the step S2 is specifically included：
Step S21：64 bit plaintext P are inputted, are expressed as p1,p2,…,p64；
Step S22：Initial permutation IP, the plaintext P after being replaced are carried out to 64 bit plaintext P of input0；
Step S23：By plaintext P0It is divided into L0And R0Left and right two parts represent plaintext P respectively032 bit of a left side and the right side 32
Bit；
Step S24：16 identical iterative steps are carried out, then carry out wheel encryption, by last round of Li-1And Ri-1As under
The input of one wheel, the output of next round is LiAnd Ri；
Step S25：Carry out inverse permutation IP-1, i.e. the inverse operation of initial permutation obtains ciphertext CP；
Step S26：The ciphertext C of 64 bits is exported, is expressed as c1,c2,…c64。
Preferably, the iterative step in the step S24 is Li=Ri-1,Wherein, f is
One permutation function, including E variations, S boxes and Q transformation, KiFor round key.
It is obtained preferably, the round key is 64 bit keys actually entered by ring shift left position and compression displacement
48 bit round key.
Preferably, the step S3 is specifically included：
Step S31：Two Big primes p and q, and p ≠ q are selected, calculates n=p × q,
Wherein,It is the Euler's function of n；
Step S32：Choose prime numberAnd a withIt is coprime；
Step S33：By (a, n) as public key Ka, formula C is pressed to key KK≡KaMod n are encrypted.
Preferably, the step S32 detects the prime number in the big integer generated at random by Miller-Rabin algorithms, and
Before Miller-Rabin algorithms, in the big integer generated at random, first removal is apparent to close number.
Preferably, the apparent specific steps for closing number of removal include：
Step S32-1：Big integer m is generated at random, and chooses the prime number group that one group of long degree since 2 is 53, is denoted as v
[i]；
Step S32-2：If i=0；
Step S32-3：As i ＜ 53, y=m mod v [i] value of calculating；
Step S32-4：If y=0, illustrate that m can divide exactly, be not prime number；Otherwise, i=i+1 goes to step S32-3.
Preferably, the step S4 calculates private key K according to Euclidean algorithmsbFor (b, n),Ciphertext is decrypted, formula is K ≡ CK bMod n, so as to obtain the key of DES.
Compared with the prior art, the beneficial effects of the present invention are：The present invention provides a kind of data mixing encryption sides
Method by the key of rsa encryption DES, substantially increases the safety in data transmission procedure；The Hybrid Encryption algorithm of the present invention
The enciphering rate of comprehensive DES and RSA, when being transmitted for handling big data, enciphering rate is far faster than rsa encryption speed；The present invention
Hybrid Encryption algorithm in, RSA only needs to perform primary, i.e., DEA key is encrypted, does not need to key and repeatedly generate, and
Key is by rsa encryption, and there is no the problem of key secret and management, therefore, Hybrid Encryption algorithm of the invention is fine
Ground solves the problems, such as the key generation of DES and RSA and management.
Description of the drawings
It is required in being described below to embodiment in order to illustrate more clearly of the technical solution in various embodiments of the present invention
The attached drawing used is briefly described.
Fig. 1 is a kind of flow diagram of data mixing encryption method provided by the invention；
Fig. 2 is a kind of flow diagram of data mixing encryption method provided by the invention；
Fig. 3 is the flow diagram of the step S2 of the present invention；
The E that Fig. 4 is the step S24 of the present invention changes extension rule table；
Fig. 5 is the tables of data of one of the S boxes of step S24 of the present invention；
Fig. 6 is the round key generating means schematic diagram of the present invention；
Fig. 7 is the step S3 flow diagrams of the present invention；
Fig. 8 is that the apparent flow diagram for closing number is removed in the step S32 of the present invention；
Fig. 9 is the flow diagram of the Miller-Rabin algorithms of the present invention.
Specific embodiment
Below in conjunction with attached drawing, the forgoing and additional technical features and advantages are described in more detail.
As depicted in figs. 1 and 2, show for a kind of flow diagram of data mixing encryption method provided by the invention and flow
It is intended to, this method includes the following steps：
Step S1：Sender sends plaintext P.
Step S2：Plaintext P is encrypted with DES algorithms, is expressed as CP=ED(K,P).Wherein, CPIt is plaintext P encryptions
Ciphertext afterwards, EDA series of encryption conversion formulas of DES algorithms are represented, K is the key of DES algorithms.
As shown in figure 3, the flow diagram for step S2, step S2 is specifically included：
Step S21：Input 64 bit plaintext P, respectively p1,p2,…,p64。
Step S22：Initial permutation IP, the plaintext P after being replaced are carried out to 64 bit plaintext P of input0。P0It remains as
64 bits only change cleartext information volume sequential bits and put, improve the safety of ciphering process.
In step S22, for 64 bit plaintext P of input, the operation carried out first is initial permutation IP, these displacements
Only change the arrangement of information in plaintext P.After wheel is encrypted, inverse permutation IP is carried out to the result of output-1, can just obtain in this way
Final ciphertext CP.For example, the plaintext of input is p1p2L p64, after initial permutation, become p58p50L p8, i.e. the of plaintext
58 bits become the first bit, and the 50th bit of plaintext becomes the second bit, and so on, the 8th bit of plaintext becomes last
One bit has upset putting in order for original plaintext.
Step S23：By plaintext P0It is divided into L0And R0Left and right two parts represent plaintext P respectively032 bit of a left side and the right side 32
Bit.
Step S24：16 identical iterative steps are carried out, then carry out wheel encryption, by last round of Li-1And Ri-1As under
The input of one wheel, the output of next round is LiAnd Ri.Wherein, i=1,2, L, 16, final output L16And R16。
The iterative step of each step is Li=Ri-1,Wherein, f is a permutation function, inner
Face includes E variations, S boxes and Q transformation, symbolRepresent XOR logic operation, KiIt is 64 bit keys that actually enter by following
The round key of 48 bits that ring shifts and compression displacement obtains.
In step s 24, f is a permutation function, if being encrypted for ith wheel, it is known that input data is 32 bits
Li-1, 32 bit Ri-1With the round key K of 48 bitsi, specific E variations, S boxes and Q transformation are described as follows：
(1) E variations are by the R of 32 bitsi-1Be extended to 48 bits, then again with the round key K of 48 bitsiCarry out exclusive or
Operation obtains the binary data of 48 bits, is denoted asAs shown in table 4, change extension rule table for specific E, from the 32nd
Position data start, and every 6 data are one group, two bits after extension.
(2) S boxes also known as change mould, are really to play the role of upsetting data in DES algorithms so as to reach the key step of encryption
Suddenly.One shares 8 S boxes, the character matrix that the value that each S boxes can be described as 4 × 16 is 0~15.As shown in table 5, for wherein
One S box inputs the binary data of 6 bits, by S box operations, exports the binary data of 4 bits.Concrete operation process
It is：By 48 bitsIt is divided into 8 groups, respectively B1,B2,L,B8, then every group of 6 bits calculate S respectivelyi(Bi), i=1,2, L,
8.If Bi=b1b2b3b4b5b6, by BiIt is mapped to SiIn r rows c arrange corresponding data, wherein, r=2b1+b6, c b2b3b4b5
The decimal number of conversion.The data obtained is converted into the binary data of 4 bits again, therefore, 32 bit data of final output
(3) Q transformation is direct permutation box, i.e., rearranges in a certain order.It such as willThrough Q
Transformation, becomes Li=t16t7L t25。
As shown in fig. 6, the round key generating means schematic diagram for the present invention.The symbiosis of round key generator is into 16 round key
Ki, i=1,2, L, 16, the key K of 64 bits is inputted first, after removing parity bits (8,16,24, L, 64), is converted into 56 ratios
Special input, then, the operating procedure of each round is all to shift left and compress displacement.
(1) shift left.56 bit keys are equally divided into two parts, per 28 bits are partly accounted for, per part in each round all
Once shifted left, then two parts are synthesized one 56 by the digit shifted in each round as shown in the table in left side in Fig. 6
The entirety of bit.
(2) compression displacement.According to fixed compression permutation table, by 56 bit permutations into 48 bits, obtained 48 bit
It is exactly that round key used is encrypted in each round.
Step S25：Carry out inverse permutation IP-1, i.e. the inverse operation of initial permutation obtains ciphertext CP。
Step S26：Export the ciphertext C of 64 bits, respectively c1,c2,…c64。
Step S3：In data transmission procedure, key K is encrypted with RSA Algorithm, is expressed as CK=ER(Ka,K)。
Wherein, CKIt is the encrypted ciphertexts of key K, ERRepresent the encryption formula of RSA Algorithm, KaIt is the public key of RSA Algorithm.
As shown in fig. 7, the flow diagram for step S3, step S3 is specifically included：
Step S31：Two Big primes p and q, and p ≠ q are selected, calculates n=p × q,
Wherein,It is the Euler's function of n.
Step S32：Choose prime numberAnd a withIt is coprime.
In step s 32, the digit of Big prime p and q generated at random determines the safe class of RSA Algorithm.In reality
It is general using 512 bits and 1024 bits n in, bigger random number is firstly generated, is then detected whether as element
Number, detects whether that the method for prime number has deterministic algorithm and probabilistic synchronization algorithm.The method of the present invention is in probabilistic synchronization algorithm
Before Miller-Rabin algorithms, in the big integer formerly generated at random, some obvious conjunction numbers are removed, so as to
Reduction judges the time.
As shown in figure 8, to remove the apparent flow diagram for closing number in the step S32 of the present invention, include the following steps：
Step S32-1：Big integer m is generated at random, and chooses the prime number group that one group of long degree since 2 is 53, is denoted as v
[i]；
Step S32-2：If i=0；
Step S32-3：As i ＜ 53, y=m mod v [i] value of calculating；
Step S32-4：If y=0, illustrate that m can divide exactly, be not prime number；Otherwise, i=i+1 goes to step S32-3.
As shown in figure 9, the flow diagram of the Miller-Rabin algorithms for the present invention, after the apparent conjunction number of removal
Big integer carry out Miller-Rabin algorithms, step is as follows：
(1) several p to be measured are randomly selected, calculate d, e so that p-1=d*2e.Wherein d is positive odd number, and e is nonnegative integer, and
Take a k, k >=2 at random；
(2) l=k is calculateddMod p, if l=1, by test, i.e. p is prime number, return to step (1)；
(3) if l ≠ 1, then j=1 is enabled；
(4) if l=p-1, pass through test, return to step (1)；
(5) stop condition is j=e, and p is non-prime, terminates to test at this time；
(6) if being not step (4), the situation of (5), l=l is enabled2Mod p, j=j+1 go to step (3).
Step S33：By (a, n) as public key Ka, formula C is pressed to key KK≡KaMod n are encrypted.Wherein, " ≡ "
Represent congruence, " mod " represents modular arithmetic.
Step S4：On the basis of RSA Algorithm, to CKIt is decrypted, is expressed as K=DR(Kb,CK).Wherein, DRRepresent RSA
The decryption formula of algorithm, KaIt is the private key of RSA Algorithm.
In step s 4, according to Euclidean algorithms, private key K is calculatedbFor (b, n),To ciphertext
It is decrypted, formula is K ≡ CK bMod n, so as to obtain the key of DES algorithms.
Step S5：With DES algorithms and key K to CPIt is decrypted, is expressed as P=DD(K,CP).Wherein, DDRepresent DES calculations
A series of decryption conversion formulas of method, are EDInverse process.
Step S6：Reciever obtains plaintext P.
A kind of data mixing encryption method provided by the invention, by the key of rsa encryption DES, substantially increases data
Safety in transmission process；The enciphering rate of Hybrid Encryption the algorithm synthesis DES and RSA of the present invention, for handling big data
During transmission, enciphering rate is far faster than rsa encryption speed；In the Hybrid Encryption algorithm of the present invention, RSA only needs to perform once, i.e.,
DEA key is encrypted, key is not needed to and repeatedly generates, and key is by rsa encryption, there is no key secrets and pipe
The problem of reason, therefore, Hybrid Encryption algorithm of the invention well solved DES and RSA key generation and management the problem of.
Although the present invention is described in detail referring to the foregoing embodiments, for those skilled in the art,
It still can modify to the technical solution recorded in foregoing embodiments or which part technical characteristic is carried out etc.
With replacing, all within the spirits and principles of the present invention, any modification, equivalent replacement, improvement and so on should be included in this
Within the protection domain of invention.
Claims (8)
1. a kind of data mixing encryption method, which is characterized in that this method includes the following steps：
Step S1：Sender sends plaintext P；
Step S2：Plaintext P is encrypted with DES algorithms, is expressed as：CP=ED(K, P), wherein, CPIt is after plaintext P is encrypted
Ciphertext, EDA series of encryption conversion formulas of DES algorithms are represented, K is the key of DES algorithms；
Step S3：In data transmission procedure, key K is encrypted with RSA Algorithm, is expressed as：CK=ER(Ka, K),
In, CKIt is the encrypted ciphertexts of key K, ERRepresent the encryption formula of RSA Algorithm, KaIt is the public key of RSA Algorithm；
Step S4：On the basis of RSA Algorithm, to CKIt is decrypted, is expressed as：K=DR(Kb,CK), wherein, DRRepresent RSA calculations
The decryption formula of method, KaIt is the private key of RSA Algorithm；
Step S5：With DES algorithms and key K to CPIt is decrypted, is expressed as P=DD(K,CP), wherein, DDRepresent DES algorithms
A series of decryption conversion formulas；
Step S6：Reciever obtains plaintext P.
2. a kind of data mixing encryption method according to claim 1, which is characterized in that the step S2 is specifically included：
Step S21：64 bit plaintext P are inputted, are expressed as p1,p2,…,p64；
Step S22：Initial permutation IP, the plaintext P after being replaced are carried out to 64 bit plaintext P of input0；
Step S23：By plaintext P0It is divided into left and right two parts L0And R0, plaintext P is represented respectively032 bit of a left side and right 32 bits；
Step S24：16 identical iterative steps are carried out, then carry out wheel encryption, by last round of Li-1And Ri-1As next round
Input, the output of next round is LiAnd Ri；
Step S25：Carry out inverse permutation IP-1, i.e. the inverse operation of initial permutation obtains ciphertext CP；
Step S26：The ciphertext C of 64 bits is exported, is expressed as c1,c2,…c64。
A kind of 3. data mixing encryption method according to claim 2, which is characterized in that the iteration in the step S24
Step is Li=Ri-1,Wherein, f is a permutation function, is become including E variations, S boxes and Q
It changes, KiFor round key.
4. a kind of data mixing encryption method according to claim 3, which is characterized in that the round key is actually enters
64 bit keys pass through ring shift left position and the obtained 48 bit round key of compression displacement.
5. a kind of data mixing encryption method according to claim 1, which is characterized in that the step S3 is specifically included：
Step S31：Two Big primes p and q, and p ≠ q are selected, calculates n=p × q,Wherein,It is the Euler's function of n；
Step S32：Choose prime numberAnd a withIt is coprime；
Step S33：By (a, n) as public key Ka, formula C is pressed to key KK≡KaMod n are encrypted.
6. a kind of data mixing encryption method according to claim 5, which is characterized in that the step S32 passes through
Prime number in the big integer that the detection of Miller-Rabin algorithms generates at random, and before Miller-Rabin algorithms, described
In the big integer generated at random, first removal is apparent to close number.
A kind of 7. data mixing encryption method according to claim 6, which is characterized in that the apparent tool for closing number of removal
Body step includes：
Step S32-1：Big integer m is generated at random, and chooses the prime number group that one group of long degree since 2 is 53, is denoted as v [i]；
Step S32-2：If i=0；
Step S32-3：As i ＜ 53, y=m mod v [i] value of calculating；
Step S32-4：If y=0, illustrate that m can divide exactly, be not prime number；Otherwise, i=i+1 goes to step S32-3.
8. a kind of data mixing encryption method according to claim 1, which is characterized in that the step S4 according to
Euclidean algorithms calculate private key KbFor (b, n),Ciphertext is decrypted, formula is K ≡ CK bmod
N, so as to obtain the key of DES.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611257612.4A CN108270565A (en) | 2016-12-30 | 2016-12-30 | A kind of data mixing encryption method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611257612.4A CN108270565A (en) | 2016-12-30 | 2016-12-30 | A kind of data mixing encryption method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108270565A true CN108270565A (en) | 2018-07-10 |
Family
ID=62754709
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611257612.4A Pending CN108270565A (en) | 2016-12-30 | 2016-12-30 | A kind of data mixing encryption method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108270565A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109450881A (en) * | 2018-10-26 | 2019-03-08 | 天津海泰方圆科技有限公司 | A kind of data transmission system, method and device |
| CN113259345A (en) * | 2021-05-12 | 2021-08-13 | 国网山东省电力公司东平县供电公司 | Intelligent power distribution network data secure transmission method, system and storage medium |
| CN114040366A (en) * | 2021-09-22 | 2022-02-11 | 惠州城市职业学院(惠州商贸旅游高级职业技术学校) | Bluetooth connection encryption method with high network communication safety |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101262341A (en) * | 2008-02-22 | 2008-09-10 | 北京航空航天大学 | A mixed encryption method in session system |
| CN102685739A (en) * | 2011-12-08 | 2012-09-19 | 北京高森明晨信息科技有限公司 | Authentication method and system for Android enterprise applications |
| CN103475664A (en) * | 2013-09-18 | 2013-12-25 | 北京工业大学 | Credible extraction method for digital evidence of Android |
| CN103684794A (en) * | 2013-12-25 | 2014-03-26 | 华南理工大学 | Communication data encryption and decryption method based on DES (Data Encryption Standard), RSA and SHA-1 (Secure Hash Algorithm) encryption algorithms |
| CN104009842A (en) * | 2014-05-15 | 2014-08-27 | 华南理工大学 | Communication data encryption and decryption method based on DES encryption algorithm, RSA encryption algorithm and fragile digital watermarking |
| US8942371B2 (en) * | 2009-09-03 | 2015-01-27 | Jerzy Henryk Urbanik | Method and system for a symmetric block cipher using a plurality of symmetric algorithms |
| CN105099672A (en) * | 2015-08-04 | 2015-11-25 | 东南大学 | Hybrid encryption method and device for realizing the same |
| CN105373366A (en) * | 2015-10-12 | 2016-03-02 | 武汉瑞纳捷电子技术有限公司 | Method and device for generating big prime number |
-
2016
- 2016-12-30 CN CN201611257612.4A patent/CN108270565A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101262341A (en) * | 2008-02-22 | 2008-09-10 | 北京航空航天大学 | A mixed encryption method in session system |
| US8942371B2 (en) * | 2009-09-03 | 2015-01-27 | Jerzy Henryk Urbanik | Method and system for a symmetric block cipher using a plurality of symmetric algorithms |
| CN102685739A (en) * | 2011-12-08 | 2012-09-19 | 北京高森明晨信息科技有限公司 | Authentication method and system for Android enterprise applications |
| CN103475664A (en) * | 2013-09-18 | 2013-12-25 | 北京工业大学 | Credible extraction method for digital evidence of Android |
| CN103684794A (en) * | 2013-12-25 | 2014-03-26 | 华南理工大学 | Communication data encryption and decryption method based on DES (Data Encryption Standard), RSA and SHA-1 (Secure Hash Algorithm) encryption algorithms |
| CN104009842A (en) * | 2014-05-15 | 2014-08-27 | 华南理工大学 | Communication data encryption and decryption method based on DES encryption algorithm, RSA encryption algorithm and fragile digital watermarking |
| CN105099672A (en) * | 2015-08-04 | 2015-11-25 | 东南大学 | Hybrid encryption method and device for realizing the same |
| CN105373366A (en) * | 2015-10-12 | 2016-03-02 | 武汉瑞纳捷电子技术有限公司 | Method and device for generating big prime number |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109450881A (en) * | 2018-10-26 | 2019-03-08 | 天津海泰方圆科技有限公司 | A kind of data transmission system, method and device |
| CN113259345A (en) * | 2021-05-12 | 2021-08-13 | 国网山东省电力公司东平县供电公司 | Intelligent power distribution network data secure transmission method, system and storage medium |
| CN114040366A (en) * | 2021-09-22 | 2022-02-11 | 惠州城市职业学院(惠州商贸旅游高级职业技术学校) | Bluetooth connection encryption method with high network communication safety |
| CN114040366B (en) * | 2021-09-22 | 2024-04-09 | 惠州城市职业学院(惠州商贸旅游高级职业技术学校) | Bluetooth connection encryption method with high network communication security |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP3782351B2 (en) | Variable length key cryptosystem | |
| CN105024994B (en) | Without the safety to computing label decryption method is mixed without certificate | |
| CN103905187B (en) | A kind of network service encryption method based on content | |
| CN101262341A (en) | A mixed encryption method in session system | |
| CN104488218A (en) | Shared secret key generation device, encryption device, decryption device, shared secret key generation method, encryption method, decryption method, and program | |
| CN109981265B (en) | Identity-based ciphertext equivalence determination method without using bilinear pairings | |
| CN113285959A (en) | Mail encryption method, decryption method and encryption and decryption system | |
| CN109873699A (en) | A kind of voidable identity public key encryption method | |
| CN109474425A (en) | A method of length derivative key is arbitrarily designated based on the acquisition of multiple shared keys | |
| WO2020164252A1 (en) | Identity-based identity hiding key agreement method based on bilinear paring | |
| CN103746805B (en) | The generation method and system of external authentication key | |
| CN106878322A (en) | A kind of encryption and decryption method of the fixed length ciphertext based on attribute and key | |
| CN102279840B (en) | Method for quickly generating prime number group applicable to information encryption technology | |
| CN105933101B (en) | A kind of full homomorphic cryptography public key compression method based on the offset of parameter high order | |
| CN108270565A (en) | A kind of data mixing encryption method | |
| CN101841415A (en) | Word-oriented key stream generating method and encrypting method | |
| JunLi et al. | Email encryption system based on hybrid AES and ECC | |
| CN109344627A (en) | A kind of novel Shannon perfection time slot scrambling | |
| Salam et al. | ShiftMod cipher: A symmetrical cryptosystem scheme | |
| CN108494556A (en) | A kind of method of efficient RSA Algorithm encrypting metadata file | |
| CN112422278A (en) | Byte-oriented random multi-table replacement encryption and decryption method | |
| CN111314053B (en) | Data encryption and decryption method | |
| CN106850192A (en) | A kind of method for optimizing mobile device data storehouse encryption efficiency | |
| CN106357382A (en) | Encryption method and system for network data transmission | |
| CN103297221B (en) | Based on the chaotic secret communication system of digital chaos encryption algorithm |
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: 20180710 |
|
| RJ01 | Rejection of invention patent application after publication |