CN102437912A - Digital rights management method based on N RSA (Rivest Shamir Adleman) encryption algorithms based on chaotic algorithm - Google Patents
Digital rights management method based on N RSA (Rivest Shamir Adleman) encryption algorithms based on chaotic algorithm Download PDFInfo
- Publication number
- CN102437912A CN102437912A CN2012100030614A CN201210003061A CN102437912A CN 102437912 A CN102437912 A CN 102437912A CN 2012100030614 A CN2012100030614 A CN 2012100030614A CN 201210003061 A CN201210003061 A CN 201210003061A CN 102437912 A CN102437912 A CN 102437912A
- Authority
- CN
- China
- Prior art keywords
- algorithm
- random
- prime
- generate
- prime number
- 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.)
- Granted
Links
Images
Abstract
The invention relates to a digital rights management method based on N RSA (Rivest Shamir Adleman) encryption algorithms based on a chaotic algorithm, comprising three steps of privet key generation, data encryption and data decryption. The method comprises the specific steps of: utilizing the chaotic algorithm as the RSA encryption algorithm to generate prime numbers and combining the generated prime numbers to form a public key and a privet key; and then utilizing the public key and the privet key to encrypt and decrypt contents of files. As the chaotic algorithm process provided by the invention has the characteristics of randomness, balance and stability, the generated prime numbers have good quality and fast speed and are uniformly distributed; the calculation of the prime numbers is operated in the class of the prime numbers and is convenient; the response speed of the calculation is fast and results are reliable and accurate; in the encryption process and the decryption process, the length of the privet key is long enough through encrypting and decrypting data of the privet key and the public key; meanwhile, the encryption speed of the data is faster, so that the encryption and the decryption are assured; and meanwhile, the privet key is not easy to crack, so that the practical applicability and the openness of the algorithm are greatly enhanced.
Description
Technical field
The invention belongs to information security technology, relate to a kind of digital literary property protection method that weighs RSA cryptographic algorithms based on the N of chaos algorithm.
Background technology
Digital copyright protection technology (Digital Rights Management; Be DRM) be exactly with certain calculation method; Realization is to the protection of digital content, and its concrete application can comprise the protection of digital contents such as eBook, video, audio frequency, picture, security document.
Digital literary property protection method mainly contains two types, and one type is to adopt digital watermark technology, and another kind of is to be the DRM technology of core with data encryption and anti-copy.
Digital watermarking (Digital Watermark) technology is in digital content, to embed hidden mark, and this mark is normally sightless, has only the testing tool through special use to extract.Digital watermarking can be used for the copyright protection of picture, music and film; Basically do not damaging under the situation of original works quality; In picture, music or film, and vision or the sense of hearing of the variation that produces through the people can't find the relevant Information hiding of copyright.But that is that all right is ripe in application facet for digital watermarking product in the market, is destroyed easily or cracks, and digital watermark method, can only after finding piracy, be used for evidence obtaining or follows the trail of, and can not prevent piracy in advance.
Data encryption and anti-copy are that the DRM technology of core is to encrypt digital content, the key that has only authorized user just can obtain deciphering, and also key is to bind with user's hardware information.Encryption technology adds the hardware binding technology, has prevented illegal copies, and this technology can reach the purpose of copyright protection effectively, and the DRM technology of current domestic and international most of Computer Company and research institution adopts this method.
Chaos is a kind of comparatively general phenomenon that is present in the non linear system, and chaos is not a complete confusion, but one type of phenomenon of exquisite immanent structure is arranged.Chaotic motion has characteristics such as ergodic, regularity.Therefore, if utilize Chaos Variable to be optimized search, can have more priority than random search undoubtedly.
RSA cryptographic algorithms is a kind of rivest, shamir, adelman.RSA is widely used in public key cryptography standards and e-business.RSA Algorithm is that first can be used to encrypt the algorithm with digital signature simultaneously; Be to be studied public key algorithm the most widely,, experienced the test of various attack from proposing till now recent two decades; For people accept, generally believe it is one of present classic PKI scheme gradually.The fail safe of RSA cryptographic algorithms depends on the factor of big number decomposes, but the difficulty of proof decoding RSA and big number do not decompose the difficulty equivalence theoretically.The significant deficiency that is RSA be can't hold it theoretically security performance how, and the majority scholar of password educational circles to tend to that the factor decomposes be not the NPC problem.
The shortcoming of RSA mainly contains: it is pretty troublesome 1) to produce key, receives the restriction of prime number generating technique, thereby is difficult to accomplish one-time pad.2) block length is too big, and for guaranteeing fail safe, n at least also wants more than the 600bits, makes the computing cost very high, and especially speed is slower, than the slow several magnitude of symmetric cryptographic algorithm; And along with the development of big several decomposition techniques, this length also increasing, is unfavorable for the standardization of data format.At present, require CA to adopt the long key of 2048bits in SET (the Secure Electronic Transaction) agreement, other entities use the key of 1024 bits.3) RSA key length increases very fast along with security classification is improved.
Summary of the invention
Main purpose of the present invention is to provide a kind of digital literary property protection method of the heavy RSA cryptographic algorithms of N based on chaos algorithm, and fail safe and reliability are higher, and the speed of service is fast, and tool is stable and open preferably.
A kind of digital literary property protection method that weighs RSA cryptographic algorithms based on the N of chaos algorithm of the present invention comprises private key generation, data encryption and 3 steps of data decryption:
Step 1, generate the private key parameter, and with this produce public affairs, private key is right, use as encrypting and decrypting;
Step 11, earlier uses chaos algorithm to generate the random number of lowest order as odd number at random, then, the random number that generates is closed number judge test, when through the closing number and judge that test is passed through yet of preset times, then this random number is regarded as prime number; So, generate three prime number p, q and r at random through said method;
Step 12, utilize step 11 to generate three prime number p at random through chaos algorithm, q, r calculates N=p*q*r;
Step 13, calculating N=(p-1) be (r-1) (q-1);
Step 14, picked at random integer e, this integer e satisfy Mod (e, N)=1;
Step 15, utilize Euclidean algorithm to calculate d, satisfy e*d ≡ 1 MOD N;
Step 16, open N, integer e is designated as PKI E=< N, e>as E, and secret p, q, r, d, N are designated as private key D=< p, q, r, d, N>as D;
Step 2, read the digital content of file to be encrypted, the digital content of utilizing the PKI E that obtains in the step 1 to treat encrypt file is carried out rsa encryption, and wherein, the AES during encryption is: c=E (m)=m
e(MOD N), additional private key file and the length of taking out ciphertext each time when preserving encrypted digital content are so that use during deciphering;
Step 3, in decrypting process, deciphering module obtains private key through reading private key file, and encrypted digital content is deciphered; Wherein, the decipherment algorithm that uses during deciphering is: m=D (c)=c
d(MOD N).
It is following to generate 3 ALGORITHM OF PRIME NUMBERS in the described step 11 at random:
(1) selection is used for the Chaos Variable of carrier wave:
Select formula x for use
N+1=μ x
n(1-x
n), μ=4,0≤x wherein
0≤1, n=0,1,2;
At first, produce a random value c, set x with system's random function
0=c;
Then through formula x
N+1=μ x
n(1-x
n) carry out M time cycle calculations respectively, obtain M Chaos Variable, binary figure place of the prime number that this cycle-index M equals to generate after M circulation, can obtain one group of Chaos Variable x
1, x
2, x
3..., x
MValue;
(2) with the excursion of all Chaos Variable that produce in the step (1), through formula m_value [i]=c
i+ d
ix
i, i=0,1,2,3 ..., M-1 is amplified to corresponding optimization variable (c respectively
i, c
i+ d
i) in the span, c wherein
i, d
iBe constant, c
iFor producing random value, c with system's random function in the step (1)
i=x
i550, d
iBe the value of picked at random in the little table of primes, be worth [c for prime
iThereby]., can obtain a random number p, M position altogether, wherein, the size of random number p can be expressed as:
p＝m_value[0]+m_value[1]·0x10000000+
m_value[2]·(0x10000000)
2+
+…+m_value[M-1]·(0x10000000)
M-1
(3) close number with the Miller-Rabin algorithm and judge test, when through preset times close number judge test yet through the time, the random number that is then generated by step (2) is regarded as prime number; Get into step (4); If test crash, the random number that then generates is not a prime number, returns step (2); Continue to generate ALGORITHM OF PRIME NUMBERS, regenerate prime number;
Described Miller-Rabin algorithm makes n-1=2
tM, wherein t is a nonnegative integer, m is a positive odd number, if b
m≡ 1 (mod d) perhaps
0≤j≤t-1 then claims n through being the Rabin-Miller test of base with b, and concrete steps are following:
A, supposition prime number to be tested are p, calculate b, and b 2 is divided exactly the number of times of p-1, that is, and and 2
bBe 2 the maximum exponential of aliquot p-1, calculate m then, make n=1+2
bM;
B, selection a random number a, i.e. 1≤a≤p-1 less than p;
C, establish j=0 and z=a
mMod p;
If D z=1 or z=p-1, p possibly be a prime number through test so;
If E is j＞and 0 and z=1, so, p is not a prime number;
F, establish j=j+1, if j<b and z ≠ p-1 establish z=z
2Mod p gets back to step e then, if z=p-1, p possibly be prime number through test so;
If G j=b and z ≠ p-1, p is not a prime number so;
Circulation above-mentioned steps several times if p then is regarded as prime number with p through having tested, represent successfully to generate a prime number;
If also do not generate 3 prime numbers, then to return step (2), with the Chaos Variable x that obtains in the step (2)
MCarry out iterative search, otherwise, jump to step (5);
(5) judge 3 prime number p of this generation, whether q, r equate, if equate, then return step (2) and continue to generate ALGORITHM OF PRIME NUMBERS, if having nothing in common with each other, then generate 3 ALGORITHM OF PRIME NUMBERS at random and finish.
Integer e choosing value 65537 in the described step 14.
The present invention utilizes chaos algorithm to generate prime number for RSA cryptographic algorithms, utilizes the prime number that is generated to be combined into PKI and private key, utilizes this PKI and private key that the content of file is carried out encryption and decryption again.Because chaos algorithm has characteristics such as ergodic, randomness, regularity, makes search more effective, thereby make that the generation prime number is better faster.At present, also have no the mode of reliable attack RSA Algorithm in the world, the present invention adopts RSA cryptographic algorithms; Fail safe is higher, and generates the private key that makes up, length long enough based on chaos algorithm; Speed is enough fast, because PKI is known, so RSA cryptographic algorithms has good opening.
Description of drawings
Fig. 1 is a schematic flow sheet of the present invention.
Below in conjunction with accompanying drawing and specific embodiment the present invention is made further detailed description.
Embodiment
As shown in Figure 1, a kind of digital literary property protection method that weighs RSA cryptographic algorithms based on the N of chaos algorithm of the present invention specifically comprises private key generation, data encryption and 3 key steps of data decryption:
Step 1, generate the private key parameter, and with this produce public affairs, private key is right, use as encrypting and decrypting;
Step 11, at first use chaos algorithm to generate the random number of lowest order at random, because prime number must be odd number, if the words of even number as odd number; Can be divided exactly by 2, then, the random number that generates is closed number judge test; If through test, then it is for closing number, otherwise when the test of passing through preset times is not passed through yet; Then this random number is regarded as prime number, and is last, generates three prime number p, q and r at random through chaos algorithm; Use the Miller-Rabin algorithm to close number among the present invention and judge test, in the present invention, because prime number is represented with a big integer class; And, be expressed as a 0x100000000 system number, wherein; All positions of this number are kept in the array; Therefore, for a generation of prime number at random, just carried out chaos evolution many times in the middle of this.
It is following to generate 3 ALGORITHM OF PRIME NUMBERS in the described step 11 at random:
(1) selection is used for the Chaos Variable of carrier wave:
Select formula x for use
N+1=μ x
n(1-x
n), μ=4,0≤x wherein
0≤1, n=0,1,2;
At first, produce a random value c, set x with system's random function
0=c;
Then through formula x
N+1=μ x
n(1-x
n) carry out M time cycle calculations respectively, obtain M Chaos Variable, binary figure place of the prime number that this cycle-index M equals to generate after M circulation, can obtain one group of Chaos Variable x
1, x
2, x
3..., x
MValue;
(2) with the excursion of all Chaos Variable that produce in the step (1), through formula m_value [i]=c
i+ d
ix
i, i=0,1,2,3 ..., M-1 is amplified to corresponding optimization variable (c respectively
i, c
i+ d
i) in the span, c wherein
i, d
iBe constant, c
iFor producing random value, c with system's random function in the step (1)
i=x
i550, d
iBe the value of picked at random in the little table of primes, be worth [c for prime
i], thereby, can obtain a random number p, M position altogether, wherein, the size of random number p can be expressed as:
p＝m_value[0]+m_value[1]·0x10000000+
m_value[2]·(0x10000000)
2+
+…+m_value[M-1]·(0x10000000)
M-1
(3) close number with the Miller-Rabin algorithm and judge test, when through preset times close number judge test yet through the time, the random number that is then generated by step (2) is regarded as prime number; Get into step (4); If test crash, the random number that then generates is not a prime number, returns step (2); Continue to generate ALGORITHM OF PRIME NUMBERS, regenerate prime number;
Described Miller-Rabin algorithm makes n-1=2
tM, wherein t is a nonnegative integer, m is a positive odd number, if b
m≡ 1 (mod d) perhaps
0≤j≤t-1 then claims n through being the Rabin-Miller test of base with b, and concrete steps are following:
A, supposition prime number to be tested are p, calculate b, and b 2 is divided exactly the number of times of p-1, that is, and and 2
bBe 2 the maximum exponential of aliquot p-1, calculate m then, make n=1+2
bM;
B, selection a random number a, i.e. 1≤a≤p-1 less than p;
C, establish j=0 and z=a
mMod p;
If D z=1 or z=p-1, p possibly be a prime number through test so;
If E is j＞and 0 and z=1, so, p is not a prime number;
F, establish j=j+1, if j＜b and z ≠ p-1 establish z=z
2Mod p gets back to step e then, if z=p-1, p possibly be prime number through test so;
If G j=b and z ≠ p-1, p is not a prime number so;
Circulation above-mentioned steps several times if p then is regarded as prime number with p through having tested, represent successfully to generate a prime number;
If also do not generate 3 prime numbers, then to return step (2), with the Chaos Variable x that obtains in the step (2)
MCarry out iterative search, otherwise, jump to step (5);
(5) judge 3 prime number p of this generation, whether q, r equate, if equate, then return step (2) and continue to generate ALGORITHM OF PRIME NUMBERS, if having nothing in common with each other, then generate 3 ALGORITHM OF PRIME NUMBERS at random and finish.
Step 12, utilize step 11 to generate three prime number p at random through chaos algorithm, q, r calculates N=p*q*r;
Step 13, calculating N=(p-1) be (r-1) (q-1);
Step 14, picked at random integer e, this integer e satisfy Mod (e, N)=1; Particular value can be chosen in order to take into account efficient, more special e value can be adopted.Such as 3 or 65537.But if e is too little, expressly m (content that needs encryption) is also very little, then to ciphertext (c), c=m
e(mod n) works as m
eDuring＜n, calculate, directly ciphertext is opened this side of e and just can obtain expressly m without delivery.In addition, it is too little that e gets, and is easy to cause little finger of toe to count success attack through after the ciphertext of intercepting and capturing e identical message.Comprehensive above consideration, e of the present invention selects 65537 for use;
Step 15, utilize Euclidean algorithm to calculate d, satisfy e*d ≡ 1 MOD N;
Step 16, open N, integer e is designated as PKI E=< N, e>as E, and secret p, q, r, d, N are designated as private key D=< p, q, r, d, N>as D;
Step 2, read the digital content of file to be encrypted; The digital content of utilizing the PKI E that obtains in the step 1 to treat encrypt file is carried out rsa encryption; Wherein, AES during encryption is: c=E (m)=me (MOD N), and additional private key file and the length of taking out ciphertext each time when preserving encrypted digital content are so that use during deciphering;
Step 3, in decrypting process, deciphering module obtains private key through reading private key file, and encrypted digital content is deciphered; Wherein, the decipherment algorithm that uses during deciphering is: m=D (c)=c
d(MOD N).
Chaos algorithm process tool randomness of the present invention, harmony and stable characteristics, the prime number quality of generation is good, and speed is fast, and equiblibrium mass distribution; When PKI and private key generate, represent prime number through big integer, prime number is carried out corresponding calculated, be combined into private key, and announce PKI, all in this type of prime number, operate for the calculating of prime number, convenience and response speed are fast, and reliable results is correct; At ciphering process and decrypting process, through private key and PKI data are carried out encryption and decryption, the length long enough of its private key; Simultaneously, very fast to the enciphering rate ratio of data, both all are guaranteed; Simultaneously, private key is difficult for again being cracked, and has strengthened the practicality and the opening of algorithm greatly.
Claims (3)
1. digital literary property protection method based on the heavy RSA cryptographic algorithms of the N of chaos algorithm is characterized in that comprising private key generation, data encryption and 3 steps of data decryption:
Step 1, generate the private key parameter, and with this produce public affairs, private key is right, use as encrypting and decrypting;
Step 11, earlier uses chaos algorithm to generate the random number of lowest order as odd number at random, then, the random number that generates is closed number judge test, when through the closing number and judge that test is passed through yet of preset times, then this random number is regarded as prime number; So, generate three prime number p, q and r at random through said method;
Step 12, utilize step 11 to generate three prime number p at random through chaos algorithm, q, r calculates N=p*q*r;
Step 13, calculating N=(p-1) be (r-1) (q-1);
Step 14, picked at random integer e, this integer e satisfy Mod (e, N)=1;
Step 15, utilize Euclidean algorithm to calculate d, satisfy e*d ≡ 1 MOD N;
Step 16, open N, integer e is designated as PKI E=< N, e>as E, and secret p, q, r, d, N are designated as private key D=< p, q, r, d, N>as D;
Step 2, read the digital content of file to be encrypted, the digital content of utilizing the PKI E that obtains in the step 1 to treat encrypt file is carried out rsa encryption, and wherein, the AES during encryption is: c=E (m)=m
e(MOD N), additional private key file and the length of taking out ciphertext each time when preserving encrypted digital content are so that use during deciphering;
Step 3, in decrypting process, deciphering module obtains private key through reading private key file, and encrypted digital content is deciphered; Wherein, the decipherment algorithm that uses during deciphering is:
m＝D(c)＝c
d(MOD?N)。
2. the digital literary property protection method of the heavy RSA cryptographic algorithms of a kind of N based on chaos algorithm according to claim 1, it is following to it is characterized in that generating 3 ALGORITHM OF PRIME NUMBERS in the described step 11 at random:
(1) selection is used for the Chaos Variable of carrier wave:
Select formula x for use
N+1=μ x
n(1-x
n), μ=4,0≤x wherein
0≤1, n=0,1,2;
At first, produce a random value c, set x with system's random function
0=c;
Then through formula x
N+1=μ x
n(1-x
n) carry out M time cycle calculations respectively, obtain M Chaos Variable, binary figure place of the prime number that this cycle-index M equals to generate after M circulation, can obtain one group of Chaos Variable x
1, x
2, x
3..., x
MValue;
(2) with the excursion of all Chaos Variable that produce in the step (1), through formula m_value [i]=c
i+ d
ix
i, i=0,1,2,3 ..., M-1 is amplified to corresponding optimization variable (c respectively
i, c
i+ d
i) in the span, c wherein
i, d
iBe constant, c
iFor producing random value, c with system's random function in the step (1)
i=x
i550, d
iBe the value of picked at random in the little table of primes, be worth [c for prime
i], thereby, can obtain a random number p, M position altogether, wherein, the size of random number p can be expressed as:
p＝m_value[0]+m_value[1]·0x10000000+
m_value[2]·(0x10000000)
2+
+…+m_value[M-1]·(0x10000000)
M-1
(3) close number with the Miller-Rabin algorithm and judge test, when through preset times close number judge test yet through the time, the random number that is then generated by step (2) is regarded as prime number; Get into step (4); If test crash, the random number that then generates is not a prime number, returns step (2); Continue to generate ALGORITHM OF PRIME NUMBERS, regenerate prime number;
Described Miller-Rabin algorithm makes n-1=2
tM, wherein t is a nonnegative integer, m is a positive odd number, if b
m≡ 1 (mod d) perhaps
0≤j≤t-1 then claims n through being the Rabin-Miller test of base with b, and concrete steps are following:
A, supposition prime number to be tested are p, calculate b, and b 2 is divided exactly the number of times of p-1, that is, and and 2
bBe 2 the maximum exponential of aliquot p-1, calculate m then, make n=1+2
bM;
B, selection a random number a, i.e. 1≤a≤p-1 less than p;
C, establish j=0 and z=a
mMod p;
If D z=1 or z=p-1, p possibly be a prime number through test so;
If E is j＞and 0 and z=1, so, p is not a prime number;
F, establish j=j+1, if j＜b and z ≠ p-1 establish z=z
2Mod p gets back to step e then, if z=p-1, p possibly be prime number through test so;
If G j=b and z ≠ p-1, p is not a prime number so;
Circulation above-mentioned steps several times if p then is regarded as prime number with p through having tested, represent successfully to generate a prime number;
If also do not generate 3 prime numbers, then to return step (2), with the Chaos Variable x that obtains in the step (2)
MCarry out iterative search, otherwise, jump to step (5);
(5) judge 3 prime number p of this generation, whether q, r equate, if equate, then return step (2) and continue to generate ALGORITHM OF PRIME NUMBERS, if having nothing in common with each other, then generate 3 ALGORITHM OF PRIME NUMBERS at random and finish.
3. a kind of digital literary property protection method that weighs RSA cryptographic algorithms based on the N of chaos algorithm according to claim 1 is characterized in that: integer e choosing value 65537 in the described step 14.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210003061.4A CN102437912B (en) | 2012-01-06 | 2012-01-06 | Digital rights management method based on N RSA (Rivest Shamir Adleman) encryption algorithms based on chaotic algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210003061.4A CN102437912B (en) | 2012-01-06 | 2012-01-06 | Digital rights management method based on N RSA (Rivest Shamir Adleman) encryption algorithms based on chaotic algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102437912A true CN102437912A (en) | 2012-05-02 |
| CN102437912B CN102437912B (en) | 2014-10-22 |
Family
ID=45985796
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210003061.4A Expired - Fee Related CN102437912B (en) | 2012-01-06 | 2012-01-06 | Digital rights management method based on N RSA (Rivest Shamir Adleman) encryption algorithms based on chaotic algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102437912B (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103580858A (en) * | 2013-11-06 | 2014-02-12 | 北京华大信安科技有限公司 | RSA algorithm private key element acquiring method and acquiring device |
| CN104917611A (en) * | 2014-03-13 | 2015-09-16 | 航天信息股份有限公司 | Data encryption and decryption processing method and device for cloud computing |
| CN105376050A (en) * | 2015-12-24 | 2016-03-02 | 鲁东大学 | Digital certificate signature method and signature scheme thereof |
| CN106559221A (en) * | 2016-11-04 | 2017-04-05 | 浙江大学 | A kind of network discovery protocol and encryption and authentication method of distributed network control system |
| CN106778333A (en) * | 2016-11-29 | 2017-05-31 | 江苏蓝深远望科技股份有限公司 | File encrypting method and device |
| CN107172005A (en) * | 2017-02-20 | 2017-09-15 | 江苏蓝深远望科技股份有限公司 | A kind of high security teletype code encryption method based on asymmetric arithmetic |
| CN108282327A (en) * | 2017-01-06 | 2018-07-13 | 重庆邮电大学 | A kind of OPC UA secret key exchange methods based on chaos rsa encryption |
| CN110098940A (en) * | 2019-06-10 | 2019-08-06 | 卓尔智联(武汉)研究院有限公司 | Email signature method, apparatus and storage medium |
| CN110162947A (en) * | 2018-09-11 | 2019-08-23 | 广州数源畅联科技有限公司 | A kind of method encrypted outside pair of Backup Data band |
| CN111130785A (en) * | 2018-10-31 | 2020-05-08 | 中国移动通信集团浙江有限公司 | Method and device for generating RSA encryption algorithm key based on real-time passenger flow model |
| CN111193584A (en) * | 2019-12-30 | 2020-05-22 | 青岛海尔科技有限公司 | Sensitive data encryption method and device based on operating system and storage medium |
| CN111447414A (en) * | 2020-04-02 | 2020-07-24 | 广东金宇恒软件科技有限公司 | Video monitoring system and method convenient to dispatch and monitor |
| CN114465804A (en) * | 2022-02-16 | 2022-05-10 | 贵州福润德文化产业发展有限公司 | Instruction encryption and decryption method capable of resisting replay attack |
| CN115865349A (en) * | 2023-02-24 | 2023-03-28 | 蓝象智联(杭州)科技有限公司 | Data encryption and decryption method for one-party encryption and multi-party combined decryption |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5048086A (en) * | 1990-07-16 | 1991-09-10 | Hughes Aircraft Company | Encryption system based on chaos theory |
| CN1359211A (en) * | 2002-01-10 | 2002-07-17 | 张红雨 | Chaotic encipher series generator |
| JP2005017612A (en) * | 2003-06-25 | 2005-01-20 | Japan Science & Technology Agency | Chaos generating device, program for generating chaos, recording medium for generating chaos, pseudo random number generating device, and ciphering device |
| CN101217360A (en) * | 2007-12-28 | 2008-07-09 | 中南大学 | A method to obtain uniform distributed pseudo random sequence in random chaos system |
-
2012
- 2012-01-06 CN CN201210003061.4A patent/CN102437912B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5048086A (en) * | 1990-07-16 | 1991-09-10 | Hughes Aircraft Company | Encryption system based on chaos theory |
| CN1359211A (en) * | 2002-01-10 | 2002-07-17 | 张红雨 | Chaotic encipher series generator |
| JP2005017612A (en) * | 2003-06-25 | 2005-01-20 | Japan Science & Technology Agency | Chaos generating device, program for generating chaos, recording medium for generating chaos, pseudo random number generating device, and ciphering device |
| CN101217360A (en) * | 2007-12-28 | 2008-07-09 | 中南大学 | A method to obtain uniform distributed pseudo random sequence in random chaos system |
Non-Patent Citations (2)
| Title |
|---|
| 徐进: "《三素数RSA算法的快速实现》", 《计算机工程与应用》, 30 November 2006 (2006-11-30) * |
| 王清华等: "《混沌系统在RSA加密算法中的应用》", 《现代电子技术》, 31 December 2007 (2007-12-31), pages 100 - 102 * |
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103580858B (en) * | 2013-11-06 | 2017-01-04 | 北京华大信安科技有限公司 | RSA Algorithm private key element acquisition methods and acquisition device |
| CN103580858A (en) * | 2013-11-06 | 2014-02-12 | 北京华大信安科技有限公司 | RSA algorithm private key element acquiring method and acquiring device |
| CN104917611A (en) * | 2014-03-13 | 2015-09-16 | 航天信息股份有限公司 | Data encryption and decryption processing method and device for cloud computing |
| CN105376050A (en) * | 2015-12-24 | 2016-03-02 | 鲁东大学 | Digital certificate signature method and signature scheme thereof |
| CN105376050B (en) * | 2015-12-24 | 2018-04-17 | 鲁东大学 | digital certificate signature method |
| CN106559221B (en) * | 2016-11-04 | 2019-10-18 | 浙江大学 | A kind of encryption and authentication method of distributed network control system |
| CN106559221A (en) * | 2016-11-04 | 2017-04-05 | 浙江大学 | A kind of network discovery protocol and encryption and authentication method of distributed network control system |
| CN106778333A (en) * | 2016-11-29 | 2017-05-31 | 江苏蓝深远望科技股份有限公司 | File encrypting method and device |
| CN106778333B (en) * | 2016-11-29 | 2019-10-25 | 江苏蓝深远望科技股份有限公司 | File encrypting method and device |
| CN108282327A (en) * | 2017-01-06 | 2018-07-13 | 重庆邮电大学 | A kind of OPC UA secret key exchange methods based on chaos rsa encryption |
| CN107172005A (en) * | 2017-02-20 | 2017-09-15 | 江苏蓝深远望科技股份有限公司 | A kind of high security teletype code encryption method based on asymmetric arithmetic |
| CN110162947A (en) * | 2018-09-11 | 2019-08-23 | 广州数源畅联科技有限公司 | A kind of method encrypted outside pair of Backup Data band |
| CN111130785A (en) * | 2018-10-31 | 2020-05-08 | 中国移动通信集团浙江有限公司 | Method and device for generating RSA encryption algorithm key based on real-time passenger flow model |
| CN111130785B (en) * | 2018-10-31 | 2022-11-29 | 中国移动通信集团浙江有限公司 | Method and device for generating RSA encryption algorithm key based on real-time passenger flow model |
| CN110098940A (en) * | 2019-06-10 | 2019-08-06 | 卓尔智联(武汉)研究院有限公司 | Email signature method, apparatus and storage medium |
| CN111193584A (en) * | 2019-12-30 | 2020-05-22 | 青岛海尔科技有限公司 | Sensitive data encryption method and device based on operating system and storage medium |
| CN111193584B (en) * | 2019-12-30 | 2023-03-28 | 青岛海尔科技有限公司 | Sensitive data encryption method and device based on operating system and storage medium |
| CN111447414A (en) * | 2020-04-02 | 2020-07-24 | 广东金宇恒软件科技有限公司 | Video monitoring system and method convenient to dispatch and monitor |
| CN114465804A (en) * | 2022-02-16 | 2022-05-10 | 贵州福润德文化产业发展有限公司 | Instruction encryption and decryption method capable of resisting replay attack |
| CN114465804B (en) * | 2022-02-16 | 2024-03-26 | 贵州福润德文化产业发展有限公司 | Instruction encryption and decryption method capable of resisting replay attack |
| CN115865349A (en) * | 2023-02-24 | 2023-03-28 | 蓝象智联(杭州)科技有限公司 | Data encryption and decryption method for one-party encryption and multi-party combined decryption |
| CN115865349B (en) * | 2023-02-24 | 2023-05-09 | 蓝象智联(杭州)科技有限公司 | Data encryption and decryption method for one-party encryption and multiparty joint decryption |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102437912B (en) | 2014-10-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102437912B (en) | Digital rights management method based on N RSA (Rivest Shamir Adleman) encryption algorithms based on chaotic algorithm | |
| EP2656537B1 (en) | Cryptography module for use with fragmented key and methods for use therewith | |
| CN107508667B (en) | Ciphertext policy ABE base encryption method and its device of the fix duty without key escrow can be disclosed | |
| CN107294697B (en) | Symmetrical full homomorphic cryptography method based on plaintext similar matrix | |
| US8917867B2 (en) | Elliptic curve cryptography with fragmented key processing and methods for use therewith | |
| CN107070948A (en) | Signature and verification method based on hybrid encryption algorithm in cloud storage | |
| US20100098253A1 (en) | Broadcast Identity-Based Encryption | |
| CN107317666A (en) | A kind of parallel full homomorphism encipher-decipher method for supporting floating-point operation | |
| CN105049207B (en) | A kind of broadcast encryption scheme with customized information of identity-based | |
| CN109936456B (en) | Anti-quantum computation digital signature method and system based on private key pool | |
| CN106134128A (en) | Use the system and method for the faster public key encryption of associated private key part | |
| CN103916248A (en) | Fully homomorphic encryption public key space compression method | |
| Liu et al. | Application of AES and RSA Hybrid Algorithm in E-mail | |
| Chatterjee et al. | Cryptography in cloud computing: a basic approach to ensure security in cloud | |
| Idrizi et al. | Analyzing the speed of combined cryptographic algorithms with secret and public key | |
| Suguna et al. | A study on symmetric and asymmetric key encryption algorithms | |
| CN104993924A (en) | Method for encryption and decryption of digital copyright | |
| EP3010173B1 (en) | Key storage device, key storage method, and program therefor | |
| CN107070900B (en) | It can search for re-encryption method based on what is obscured | |
| CN109495478B (en) | Block chain-based distributed secure communication method and system | |
| Karthik et al. | Hybrid cryptographic technique using OTP: RSA | |
| Nwe et al. | Performance Analysis of RSA and ElGamal for Audio Security | |
| Taylor et al. | Security approaches and crypto algorithms in mobile cloud storage environment to ensure data security | |
| CN110113331B (en) | Distributed ciphertext policy attribute-based encryption method for hidden access structure | |
| Dutta et al. | Hybrid Encryption Technique to Enhance Security of Health Data in Cloud Environment |
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: 20141022 Termination date: 20180106 |