CN112770140A - Stream encryption method and system combining Chen's theorem and RSA depth - Google Patents
Stream encryption method and system combining Chen's theorem and RSA depth Download PDFInfo
- Publication number
- CN112770140A CN112770140A CN202011525569.1A CN202011525569A CN112770140A CN 112770140 A CN112770140 A CN 112770140A CN 202011525569 A CN202011525569 A CN 202011525569A CN 112770140 A CN112770140 A CN 112770140A
- Authority
- CN
- China
- Prior art keywords
- data stream
- rsa
- stream
- key
- prime
- 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
- 238000000034 method Methods 0.000 title claims abstract description 30
- 230000005540 biological transmission Effects 0.000 claims description 7
- 238000003491 array Methods 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 description 5
- 238000012163 sequencing technique Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000012216 screening Methods 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/234—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs
- H04N21/2347—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs involving video stream encryption
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/44—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs
- H04N21/4405—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs involving video stream decryption
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Storage Device Security (AREA)
Abstract
The invention provides a stream encryption method and system combining Chen's theorem and RSA depth, wherein an RSA public key and a private key are generated before a data stream sending end sends a data stream, the RSA private key is directly stored in a data stream receiving end, and the data stream receiving end acquires the RSA private key; the data stream sending end encrypts the large even number and the specific mark by using an RSA public key and transmits the encrypted large even number and the specific mark to the data stream receiving end; generating a random large even number, simplifying the random large even number into the sum of a prime number and a product of no more than two prime numbers according to the Chen's theorem, and extracting one prime number/semi-prime number as a true stream encryption key through the large even number and a specific mark; and the data stream receiving end carries out XOR operation on the encrypted stream according to a certain prime number specified by the specific mark to obtain the original data stream. The invention ensures the speed and the safety of file decryption and solves the problems of key distribution and management.
Description
Technical Field
The invention relates to a streaming media technology, in particular to a stream encryption method and system combining Chen's theorem and RSA depth.
Background
At present, with self-media data, a great amount of data such as live broadcast and the like appear, and encryption protection of data streams is a key part of data transmission; the traditional DVB data encryption and decryption (encryption and descrambling) structure is complex and consumes hardware resources.
Disclosure of Invention
The invention provides a stream encryption method and system combining Chen's theorem and RSA depth, which can realize simple, easy-to-use and high-strength encryption to a certain extent and consume less hardware resources.
In order to achieve the purpose, the invention adopts the following specific technical scheme:
a stream encryption method combining Chen's theorem and RSA depth specifically comprises the following steps:
s1, the data flow sending end generates a RSA public key and private key before sending the data flow, the RSA private key is directly stored in the data flow receiving end, and the data flow receiving end obtains the RSA private key;
s2, the data flow sending end uses RSA public key to encrypt the large even number and the special mark and transmits to the data flow receiving end;
s3, generating a random large even number, simplifying the random large even number into the sum of a prime number and a product of no more than two prime numbers according to the Chen' S theorem, thus extracting one prime number/half prime number as a true stream encryption key through the large even number and a specific mark;
and S4, the data stream sending end performs XOR operation on a certain prime number specified by the specific mark and the original stream to generate an encrypted stream and transmits the encrypted stream to the data stream receiving end, and the data stream receiving end performs XOR operation on the encrypted stream according to the certain prime number specified by the specific mark to obtain the original data stream.
Preferably, the step S1 of generating a public key and a private key of an RSA by the data stream sender specifically includes the following steps:
s101, randomly obtaining two unequal large prime numbers p and q; the bit width difference between the big prime number p and the big prime number q is a designated bit, and the maximum common factor of p-1 and q-1 is not less than a designated value;
s102, calculating N ═ pq; and calculating R-1 (q-1) according to the Euler function;
s103, finding out the condition
And the greatest common divisor gcd (d, R) is 1, find d as the private key;
s104, calculating a public key e by the private key d through an expanded Euclidean algorithm: e ═ d-1modR；
S105, the (e, N) is marked as a public key of the RSA, and the (d, N) is marked as a private key of the RSA.
Preferably, in step S2, the large even and specific mark combined key is updated periodically, and the updated large even and specific mark combined key is encrypted again by the RSA public key and transmitted to the data stream receiving end.
Preferably, in step 2, the RSA encryption and decryption algorithm is as follows:
assuming that a plaintext (a large even number and a specific mark combined key) is M and a ciphertext is C;
and (3) encryption process: c ═ Me modN；
And (3) decryption process: m ═ Cd modN；
And performing operation by using a modular exponentiation algorithm and a modular multiplication algorithm in the encryption and decryption processes.
Preferably, in step S4, the data stream sender encrypts the original data stream in a segmented manner, and the data stream receiver decrypts the encrypted stream in a segmented manner.
Preferably, the original data stream is a streaming media, and the data stream sending end and the data stream receiving end are used for implementing encrypted transmission of the streaming media.
A kind of Chen's theorem and RSA deeply combined stream encryption system, including data flow sending end and data flow receiving end;
the data stream sending terminal is used for generating a public key and a private key of RSA before sending the data stream, the RSA private key is directly stored in the data stream receiving terminal, and the data stream receiving terminal obtains the RSA private key; encrypting the large even number and the specific mark combined key by using an RSA public key and transmitting the encrypted large even number and the specific mark combined key to a data stream receiving end; generating a random large even number, and simplifying the random large even number into the sum of a prime number and a product of no more than two prime numbers according to the Chen's theorem, so that one prime number/half prime number can be extracted as a true stream encryption key through the large even number and a specific mark;
and the data stream receiving end carries out XOR operation on the encrypted stream according to a certain prime number specified by the specific mark to obtain the original data stream.
Preferably, the data stream transmitting end and the data stream receiving end reserve all prime number/semi-prime number arrays which can be stored by a specific bit width maximum even number in advance respectively, and are used for sequencing and storing all prime numbers/semi-prime numbers thereof by using the Chen's theorem after obtaining a random large even number, and the prime numbers/semi-prime numbers can be directly called according to a specific mark in the encryption/decryption process.
Preferably, two prime numbers in the RSA are larger than a set value, and the prime numbers derived by the chen theorem are used by the data stream sending end and the receiving end to encrypt and decrypt in a segmented manner.
The invention has the beneficial effects that: the encryption of the stream media combining the Chen's theorem and the RSA depth is realized by using a certain prime number/half prime number in a large even number of the Chen's theorem as a key and embedding the large even number encrypted by the RSA and a specific mark into a transmission stream, so that the encryption has higher safety, the speed requirement of file decryption can be ensured, and the problems of distribution and management of the key can be solved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flow chart of a stream encryption method combining Chen's theorem and RSA depth according to an embodiment of the present invention;
fig. 2 is a flow chart of a stream encryption method combining chen's theorem and RSA depth according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. Other embodiments, which can be derived by one of ordinary skill in the art from the embodiments given herein without any creative effort, shall fall within the protection scope of the present invention.
In the description of the present invention, it should be noted that the terms "vertical", "upper", "lower", "horizontal", and the like indicate orientations or positional relationships based on those shown in the drawings, and are only for convenience of describing the present invention and simplifying the description, but do not indicate or imply that the referred device or element must have a specific orientation, be constructed in a specific orientation, and be operated, and thus, should not be construed as limiting the present invention.
In the description of the present invention, it should also be noted that, unless otherwise explicitly specified or limited, the terms "disposed," "mounted," "connected," and "connected" are to be construed broadly and may, for example, be fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; they may be connected directly or indirectly through intervening media, or they may be interconnected between two elements. The specific meanings of the above terms in the present invention can be understood by those skilled in the art according to specific situations.
As shown in fig. 1 and fig. 2, the present invention provides a stream encryption method combining chen's theorem and RSA depth, which specifically includes the following steps:
s1, the data flow sending end generates a RSA public key and private key before sending the data flow, the RSA private key is directly stored in the data flow receiving end, and the data flow receiving end obtains the RSA private key;
the step S1 of generating a public key and a private key of an RSA by the data stream sending end specifically includes the following steps:
s101, on the premise of ensuring the safety of a plaintext, simplifying an encryption calculation process; two inequality prime numbers p and q obtained randomly need to satisfy: the bit difference between the big prime number p and the q bit is a designated bit, and the maximum common factor of p-1 and q-1 is smaller than a designated value;
s102, calculating N ═ pq; and calculating R-1 (q-1) according to the Euler function;
s103, finding out the condition
And the greatest common divisor gcd (d, R) is 1, find d as the private key;
s104, calculating a public key e by the private key d through an expanded Euclidean algorithm: e ═ d-1modR；
S105, the (e, N) is marked as a public key of the RSA, and the (d, N) is marked as a private key of the RSA.
And extracting prime numbers and semi-prime numbers in a large even number by adopting a screening method, setting the step length to be 6, increasing the screening speed, and sequencing according to two prime numbers or the combination of one prime number and one semi-prime number.
The prime/semi-prime is found in steps of 6,
inputting: large even _ data;
and (3) outputting: prime/semi-prime;
initialization: gab is 4; check _ data0 ═ 2; check _ data1 ═ 2;
1 FOR check_data1＝2to even_data/2
1.1 N＝check_data0；
1.2 IF N<5
1.2.1 IF N＝2|N＝3
1.2.1.1 PRINTF ("is prime"); JUMP TO 1.5; BREAK;
1.2.2 ELSE IF N＝2|N＝3
1.2.2.1 PRINTF ("is a semi-prime number"); JUMP TO 1.5; BREAK;
1.3 ELSE For k＝5to N
1.3.1 IF N mod k
1.3.1.1 PRINTF ("not a prime number"); JUMP TO 1.5; BREAK;
1.3.2 ELSE IF N＝k
1.3.2.1 PRINTF ("is prime"); JUMP TO 1.5; BREAK;
1.3.3 ELSE N＝N/k；BREAK；
1.4 FOR k＝5to N
1.4.1 IF N mod k
1.4.1.1 PRINTF ("not a prime number"); BREAK;
1.4.2 ELSE IF N＝k
1.4.2.1 PRINTF ("is a semi-prime number"); BREAK;
1.5 k+＝gab^6
1.6 N＝even_data–check_data0；JUMP TO 1.1.1；
1.7 check_data1＝check_data1+1；
1.8 check_data0＝check_data1；
2 RETURN all prime and half prime;
s2, the data flow sending end uses RSA public key to encrypt the big even number and special mark combined key and transmits to the data flow receiving end;
in step S2, the large even and specific mark combined key is updated at regular time, and the updated large even and specific mark combined key is encrypted again by the RSA public key and transmitted to the data stream receiving end.
In step 2, the RSA encryption and decryption algorithm is as follows:
assuming that a plaintext (a large even number and a specific mark combined key) is M and a ciphertext is C;
and (3) encryption process: c ═ Me modN；
And (3) decryption process: m ═ Cd modN；
According to the two equations, the key of RSA encryption and decryption lies in modular exponentiation calculation, and as the key, the plaintext and the ciphertext are all large in numerical value, if modular exponentiation calculation is directly performed, the calculation speed is very slow, and resources are consumed considerably; if the modular exponentiation calculation is performed by using the modular exponentiation algorithm and the modular multiplication algorithm, the operation speed can be increased, and the implementation on software and hardware is convenient, and the following two algorithms are introduced:
modular exponentiation algorithm
The modular exponentiation square modular multiplication algorithm has the core idea that the modular exponentiation operation is decomposed into repeated modular multiplication operation and modular square operation, and the realization process is approximately the following two steps:
the squaring operation is performed, i.e. the exponent is shifted to the left by one bit, and 0 is added to the rightmost end,
judging whether the binary exponent is 1 at the bit, if so, multiplying the result obtained by the 1) square operation by the plaintext M.
The pseudo code for the squaring-multiplying algorithm is as follows:
inputting: plaintext M, modulus N, public key exponent E, expanding E with binary:
output Pn＝MEmodN；
Initialization: p0＝1；Z0＝M；
The algorithm is as follows:
modular multiplication algorithm
The expression of the modular multiplication algorithm is as follows:
c ═ A × B) mod N, where A is not less than 0 and B is not more than N
The montgomery algorithm is the most common modular multiplication operation at present, and is characterized in that division operation on a large integer is converted into division operation on a small integer r, wherein a radix r needs to satisfy gcd (N, r) ═ 1, in order to enable software and hardware to be quickly realized, r is generally taken as a multiple of 2 or 2, and the division operation is converted into shift operation (the number of shifts is equal to the multiple of 2).
The pseudo code for the Montgomery algorithm is as follows:
inputting: a, B and N are odd numbers of N bits; wherein n is the number of bits of A,
and (3) outputting: rn＝A*B*2-n modN；
Initialization: r0＝0；
The algorithm is as follows:
For i＝0DOWNTO＝n-1
qi＝(Ri+ai*B)mod2
Ri+1＝(Ri+ai*B+qi*N)/2
IF Rn>N
Rn＝Rn-N
RETURN Rn。
s3, generating a random large even number, simplifying the random large even number into the sum of a prime number and a product of no more than two prime numbers according to the Chen' S theorem, thus extracting one prime number/half prime number as a true stream encryption key through the large even number and a specific mark; the method of directly transmitting large even number and mark is used in the transmission process, and the mark is used for marking out the prime number selected.
And S4, the data stream sending end performs XOR operation on a certain prime number specified by the specific mark and the original stream to generate an encrypted stream and transmits the encrypted stream to the data stream receiving end, and the data stream receiving end performs XOR operation on the encrypted stream according to the certain prime number specified by the specific mark to obtain the original data stream.
In step S4, the data stream sending end encrypts the original data stream in a segmented manner, and the data stream receiving end decrypts the encrypted stream in a segmented manner.
Preferably, the original data stream is a streaming media, and the data stream sending end and the data stream receiving end are used for implementing encrypted transmission of the streaming media.
The invention also provides a stream encryption system combining Chen's theorem and RSA depth, which comprises a data stream sending end and a data stream receiving end;
the data stream sending terminal is used for generating a public key and a private key of RSA before sending the data stream, the RSA private key is directly stored in the data stream receiving terminal, and the data stream receiving terminal obtains the RSA private key; encrypting the large even number and the specific mark combined key by using an RSA public key and transmitting the encrypted large even number and the specific mark combined key to a data stream receiving end; generating a random large even number, and simplifying the random large even number into the sum of a prime number and a product of no more than two prime numbers according to the Chen's theorem, so that one prime number/half prime number can be extracted as a true stream encryption key through the large even number and a specific mark;
and the data stream receiving end carries out XOR operation on the encrypted stream according to a certain prime number specified by the specific mark to obtain the original data stream.
Preferably, the data stream transmitting end and the data stream receiving end reserve all prime number/semi-prime number arrays which can be stored by a specific bit width maximum even number in advance respectively, and are used for sequencing and storing all prime numbers/semi-prime numbers thereof by using the Chen's theorem after obtaining a random large even number, and the prime numbers/semi-prime numbers can be directly called according to a specific mark in the encryption/decryption process.
Preferably, two prime numbers in the RSA are larger than a set value, and the prime numbers derived by the chen theorem are used by the data stream sending end and the receiving end to encrypt and decrypt in a segmented manner.
The encryption of the stream media combining the Chen's theorem and the RSA depth is realized by using a certain prime number in a large even number of the Chen's theorem as a secret key, embedding the large even number encrypted by the RSA and a specific mark into a transport stream, updating the secret key at intervals of half an hour or an hour at a sending end, and using the secret key in all programs of the transport stream, so that the programs can be encrypted at regular time by the sending end, a receiving end needs to be matched with the sending end, and the programs can be normally played by decrypting the transport stream at regular time by using the updated secret key.
The invention has the beneficial effects that:
1. as long as two prime numbers in RSA are large enough, large even numbers and specific mark interval time are updated, and the prime numbers derived by utilizing the Chen's theorem are encrypted and decrypted in a segmented mode, the stream encryption is more safe.
2. The RSA algorithm encrypts the key, so that the requirement on the speed of file decryption can be met, and the problems of distribution and management of the key can be solved.
3. The Chen's theorem and the RSA depth combined algorithm are used for streaming media transmission, and a receiving end cannot store the decrypted multimedia file locally any more, so that the multimedia file can be prevented from being illegally copied and spread after being decrypted.
In light of the foregoing description of the preferred embodiments of the present invention, those skilled in the art can now make various alterations and modifications without departing from the scope of the invention. The technical scope of the present invention is not limited to the contents of the specification, and must be determined according to the scope of the claims.
Claims (9)
1. A stream encryption method combining Chen's theorem and RSA depth is characterized by comprising the following steps:
s1, the data flow sending end generates a RSA public key and private key before sending the data flow, the RSA private key is directly stored in the data flow receiving end, and the data flow receiving end obtains the RSA private key;
s2, the data flow sending end uses RSA public key to encrypt the large even number and the special mark and transmits to the data flow receiving end;
s3, generating a random large even number, simplifying the random large even number into the sum of a prime number and a product of no more than two prime numbers according to the Chen' S theorem, thus extracting one prime number/half prime number as a true stream encryption key through the large even number and a specific mark;
and S4, the data stream sending end performs XOR operation on a certain prime number specified by the specific mark and the original stream to generate an encrypted stream and transmits the encrypted stream to the data stream receiving end, and the data stream receiving end performs XOR operation on the encrypted stream according to the certain prime number specified by the specific mark to obtain the original data stream.
2. The stream encryption method according to claim 1, wherein the step S1 of generating a public key and a private key of RSA by the data stream sender specifically comprises the steps of:
s101, randomly obtaining two unequal large prime numbers p and q; the bit width difference between the big prime number p and the big prime number q is a designated bit, and the maximum common factor of p-1 and q-1 is not less than a designated value;
s102, calculating N ═ pq; and calculating R-1 (q-1) according to the Euler function;
s103, finding out the condition
And the greatest common divisor gcd (d, R) is 1, find d as the private key;
s104, calculating a public key e by the private key d through an expanded Euclidean algorithm: e ═ d-1mod R；
S105, the (e, N) is marked as a public key of the RSA, and the (d, N) is marked as a private key of the RSA.
3. The stream encryption method according to claim 1, wherein the large even and specific mark combined key is updated periodically in step S2, and the updated large even and specific mark combined key is encrypted again by the RSA public key and transmitted to the data stream receiving end.
4. The flow encryption method combining Chen's theorem and RSA depth according to claim 1 or 3, wherein in step 2, the RSA encryption/decryption algorithm is as follows:
assuming that a plaintext (a large even number and a specific mark combined key) is M and a ciphertext is C;
and (3) encryption process: c ═ Memod N；
And (3) decryption process: m ═ Cdmod N；
And performing operation by using a modular exponentiation algorithm and a modular multiplication algorithm in the encryption and decryption processes.
5. The stream encryption method according to claim 1, wherein the data stream transmitting end encrypts the original data stream in a segmented manner, and the data stream receiving end decrypts the encrypted stream in a segmented manner in step S4.
6. The stream encryption method according to claim 1, wherein the original data stream is a stream media, and the data stream transmitting end and the data stream receiving end are configured to implement stream media encryption transmission.
7. A kind of Chen's theorem and RSA deeply combined stream encryption system, characterized by that, including data flow sending end and data flow receiving end;
the data stream sending terminal is used for generating a public key and a private key of RSA before sending the data stream, the RSA private key is directly stored in the data stream receiving terminal, and the data stream receiving terminal obtains the RSA private key; encrypting the large even number and the specific mark combined key by using an RSA public key and transmitting the encrypted large even number and the specific mark combined key to a data stream receiving end; generating a random large even number, and simplifying the random large even number into the sum of a prime number and a product of no more than two prime numbers according to the Chen's theorem, so that one prime number/half prime number can be extracted as a true stream encryption key through the large even number and a specific mark;
and the data stream receiving end carries out XOR operation on the encrypted stream according to a certain prime number specified by the specific mark to obtain the original data stream.
8. The stream encryption system according to claim 7, wherein the stream transmitting end and the stream receiving end respectively reserve in advance all prime number/semi-prime number arrays that can be stored by a specific bit width maximum even number, for sorting and storing all prime numbers/semi-prime numbers thereof by using the chen theorem after obtaining a random large even number, and can directly call the prime numbers/semi-prime numbers according to a specific flag in the encryption/decryption process.
9. The system according to claim 7, wherein two prime numbers in the RSA are greater than a set value, and the large and even numbers of the data stream transmitting end and the receiving end are encrypted and decrypted in a segmented manner using the prime numbers derived by the chen theorem.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011525569.1A CN112770140B (en) | 2020-12-22 | 2020-12-22 | Stream encryption method and system combining Chen's theorem and RSA depth |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011525569.1A CN112770140B (en) | 2020-12-22 | 2020-12-22 | Stream encryption method and system combining Chen's theorem and RSA depth |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112770140A true CN112770140A (en) | 2021-05-07 |
| CN112770140B CN112770140B (en) | 2021-08-24 |
Family
ID=75694531
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011525569.1A Active CN112770140B (en) | 2020-12-22 | 2020-12-22 | Stream encryption method and system combining Chen's theorem and RSA depth |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112770140B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113868682A (en) * | 2021-09-28 | 2021-12-31 | 山东云缦智能科技有限公司 | Multimedia file encryption and decryption method based on RSA |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103701593A (en) * | 2013-12-26 | 2014-04-02 | 西安理工大学 | 256-system large number-based Ron Rivest, Adi Shamir and Leonard Adleman (RSA) encryption method |
| CN103873239A (en) * | 2014-03-31 | 2014-06-18 | 刘诗章 | Method for rapid generation of even number prime pair based on application of even number public key system |
| CN105636026A (en) * | 2014-10-30 | 2016-06-01 | 深圳市福斯康姆智能科技有限公司 | Configuration method of WIFI one-key intelligent system |
| EP3667647A1 (en) * | 2017-08-10 | 2020-06-17 | Sony Corporation | Encryption device, encryption method, decryption device, and decryption method |
-
2020
- 2020-12-22 CN CN202011525569.1A patent/CN112770140B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103701593A (en) * | 2013-12-26 | 2014-04-02 | 西安理工大学 | 256-system large number-based Ron Rivest, Adi Shamir and Leonard Adleman (RSA) encryption method |
| CN103873239A (en) * | 2014-03-31 | 2014-06-18 | 刘诗章 | Method for rapid generation of even number prime pair based on application of even number public key system |
| CN105636026A (en) * | 2014-10-30 | 2016-06-01 | 深圳市福斯康姆智能科技有限公司 | Configuration method of WIFI one-key intelligent system |
| EP3667647A1 (en) * | 2017-08-10 | 2020-06-17 | Sony Corporation | Encryption device, encryption method, decryption device, and decryption method |
Non-Patent Citations (2)
| Title |
|---|
| 张韶华: "改进的加密算法在嵌入式网上教学平台中的应用", 《中国优秀硕士学位论文全文数据库（信息科技辑）》 * |
| 彭接鑫: "用快速素数算法实现报税数字签名", 《电子商务技术》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113868682A (en) * | 2021-09-28 | 2021-12-31 | 山东云缦智能科技有限公司 | Multimedia file encryption and decryption method based on RSA |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112770140B (en) | 2021-08-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6396926B1 (en) | Scheme for fast realization of encrytion, decryption and authentication | |
| US6154541A (en) | Method and apparatus for a robust high-speed cryptosystem | |
| US9172529B2 (en) | Hybrid encryption schemes | |
| Almaiah et al. | A new hybrid text encryption approach over mobile ad hoc network | |
| CN109039640B (en) | Encryption and decryption hardware system and method based on RSA cryptographic algorithm | |
| Iyer et al. | A novel idea on multimedia encryption using hybrid crypto approach | |
| NZ535698A (en) | An cryptosystem involving generating an isogeny that maps points from one elliptic curve onto another elliptic curve and publishing a public key corresponding to the isogeny | |
| KR20000071078A (en) | Cyclotomic polynomial construction of discrete logarithm cryptosystems over finite fields | |
| Suguna et al. | A study on symmetric and asymmetric key encryption algorithms | |
| US7248692B2 (en) | Method of and apparatus for determining a key pair and for generating RSA keys | |
| CN112770140B (en) | Stream encryption method and system combining Chen's theorem and RSA depth | |
| US20100150343A1 (en) | System and method for encrypting data based on cyclic groups | |
| US20060251248A1 (en) | Public key cryptographic methods and systems with preprocessing | |
| Rahim | Applied Pohlig-Hellman algorithm in three-pass protocol communication | |
| Fuchsbauer | An introduction to probabilistic encryption | |
| US8306220B2 (en) | Method to generate a private key in a boneh-franklin scheme | |
| EP2225846B1 (en) | Method to generate a private key in a Boneh-Franklin scheme | |
| CN110912673B (en) | Additive homomorphic encryption and decryption method with double decryption mechanisms | |
| Encinas et al. | Maple implementation of the Chor-Rivest cryptosystem | |
| Vigila et al. | Elliptic curve based key generation for symmetric encryption | |
| JP2004246350A (en) | Enciphering device, deciphering device, enciphering system equipped with the same, enciphering method, and deciphering method | |
| Shepherd et al. | The quadratic residue cipher and some notes on implementation | |
| CN1258051A (en) | Encryption system and device for public key | |
| Young et al. | A subliminal channel in secret block ciphers | |
| Kumar et al. | Exploration and Implementation of RSA-KEM 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |