CN110868297A - Method for improving RSA reverse decryption difficulty - Google Patents

Method for improving RSA reverse decryption difficulty Download PDF

Info

Publication number
CN110868297A
CN110868297A CN201911137172.2A CN201911137172A CN110868297A CN 110868297 A CN110868297 A CN 110868297A CN 201911137172 A CN201911137172 A CN 201911137172A CN 110868297 A CN110868297 A CN 110868297A
Authority
CN
China
Prior art keywords
public key
rsa
key
receiver
sender
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
Application number
CN201911137172.2A
Other languages
Chinese (zh)
Inventor
谭朋柳
王雪娇
唐伟强
万里旭冉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanchang Hangkong University
Original Assignee
Nanchang Hangkong University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nanchang Hangkong University filed Critical Nanchang Hangkong University
Priority to CN201911137172.2A priority Critical patent/CN110868297A/en
Publication of CN110868297A publication Critical patent/CN110868297A/en
Pending legal-status Critical Current

Links

Images

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/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/0852—Quantum cryptography
    • 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/14—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using a plurality of keys or algorithms

Abstract

The invention discloses a method for improving RSA reverse decryption difficulty, which combines a quantum key distribution technology with RSA, and designs a method for improving RSA reverse decryption difficulty by using parameter replacement on the premise that a quantum key distribution technology detects a channel to ensure that a public key is not stolen, wherein the mechanism has three different replacement modes, 1) replacing the public key (n, E) with (n, E); 2) replacing the public key (N, e) with (N, e); 3) the public key (N, E) is replaced by (N, E). The invention combines the quantum key distribution technology and the RSA, uses the RSA technology to generate a public and private secret key, uses the quantum key distribution technology to send the public key and monitors whether an eavesdropper exists in a channel.

Description

Method for improving RSA reverse decryption difficulty
Technical Field
The invention relates to the technical field of asymmetric encryption algorithms, in particular to a method for improving RSA reverse decryption difficulty.
Background
The RSA algorithm can be used not only for encryption but also for digital signatures, and is easy to understand and operate, and is widely considered as one of the most elegant public key schemes by 2017. The reliability of the RSA algorithm depends on the difficulty of factoring very large integers. In other words, the more difficult factoring a very large integer, the more reliable the RSA algorithm is. Although no reliable way to attack the RSA algorithm has been found at present, with the development of computers and the advent of supercomputers and Quantum computers, the occurrence of the algorithm of Shor [ hamza jaffali, frid ric holweck, Quantum entry and content in silver grover's and Shor's ' saligorithms: the four-qubit case [ J ]. Quantum information processing,2019,18(5) ], and the depth of research of Quantum computers will greatly threaten the reliability of the RSA algorithm, and the computing power of the computer will be strong, so that it is not difficult to deduce two prime numbers p and q from n and once these two prime numbers are obtained, the private key will be cracked.
Aiming at the problems of the RSA algorithm, in order to improve the safety, the peri-gold, the high-epitaxy, the research on the improved RSA algorithm based on multi-prime number and parameter replacement [ J ] the research on computer application, 2019,36(02):495-498 ], an improved RSA algorithm based on multi-prime number and parameter replacement is provided, the traditional RSA is improved into the RSA with four prime numbers, the parameter replacement is carried out by using mathematical transformation, the requirement of transmitting the product n of two random prime numbers in a public key is eliminated, and a new parameter x is introduced to replace the original parameter n. Aiming at the deficiency of the improved algorithm in the aspect of the operational efficiency, the CRT (cathode ray tube) with the Chinese remainder theorem is adopted to optimize the operation of the large digital-analog power. Jiangxiang and the like [ Jiangxiang, Hujing, research on an improved method based on an RSA algorithm [ J ]. research on engineering technology, 2018(11): 251-. In the literature [ Baijunfen, improvement research and realization of public key RSA algorithm [ J ]. Industrial instruments and automation devices, 2019(01): 101-. Liyunfei [ Liyunfei, RSA improved algorithm [ A ] based on load transfer and Multi-Power technology, China computer society, 33 rd national computer Security academy discourse, corpus [ C ] China computer society, China computer science accounting Special Committee for computer Security, 2018:5 ] proposes an RSA improved algorithm based on load transfer and Multi-Power technology, and the improved algorithm combines the technology of Multi-Power accelerated algorithm modular screen calculation and the load transfer technology of RSA-S1 system to accelerate the decryption process of the RSA system. Zhengmengjing [ Zhengmengjing, lattice analysis of RSA and its variant algorithm [ D ]. university of Chinese science and technology, 2018 ] the security of RSA algorithm is studied based on the cryptanalysis technique of lattice reduction technique, and the security analysis is converted into solving the small root of the modular equation or the integral equation in polynomial time. The documents mentioned above all start from the perspective of conversion of the prime numbers and parameters of the RSA algorithm, and use more prime numbers or parameters on the basis of the RSA complex calculation, so that the calculation is more complex to achieve the purpose of being safer.
Disclosure of Invention
The invention aims to solve the problems that: the method for improving the RSA reverse decryption difficulty is characterized in that a quantum key distribution technology and the RSA are combined, a public key and a private key are generated by using the RSA technology, the public key is sent by using the quantum key distribution technology, and whether an eavesdropper exists in a channel or not is monitored.
The technical scheme provided by the invention for solving the problems is as follows: a method for improving RSA reverse decryption difficulty combines a quantum key distribution technology and RSA, and designs a method for improving RSA reverse decryption difficulty by parameter replacement on the premise that a quantum key distribution technology detects a channel to ensure that a public key is not stolen, wherein the mechanism has three different replacement modes, namely, 1) replacing the public key (n, E) with (n, E); 2) replacing the public key (N, e) with (N, e); 3) the public key (N, E) is replaced by (N, E).
Preferably, in the process of RSA algorithm key generation, one key is added, where E is 3, the public key (n, E) is not disclosed any more, the public key is (n, E), and the private key is not changed and is still (n, d).
Preferably, the sender confirms whether the receiver is reliable before sending the message, and after confirming that the receiver is reliable, the sender sends the public key (n, e) to the receiver by using the quantum key distribution technology and monitors whether the eavesdropper exists in the channel, if the eavesdropper is found, the sender is informed to regenerate the public and private key by using the RSA algorithm, and the sending and eavesdropping are carried out again until the eavesdropper is not found in the channel and the public key (n, e) is received by the receiver; then, the sender uses the public key (n, E) to encrypt the plaintext message M when sending the plaintext message M to the receiver, and the whole encryption and decryption process is not changed, but the public key (n, E) is changed into (n, E).
Preferably, in the process of RSA algorithm key generation, another N is generated, where N is equal to pmax*qmax,pmaxAnd q ismaxThe two largest prime numbers are different in value range, the public key (N, e) is not disclosed any more, the public key is (N, e), and the private key is not changed and is still (N, d).
Preferably, the sender confirms whether the receiver is reliable before sending the message, and after confirming that the receiver is reliable, the sender sends the public key (n, e) to the receiver by using the quantum key distribution technology and monitors whether the eavesdropper exists in the channel, if the eavesdropper is found, the sender is informed to regenerate the public and private key by using the RSA algorithm, and the sending and eavesdropping are carried out again until the eavesdropper is not found in the channel and the public key (n, e) is received by the receiver; then, the sender uses the public key (N, e) to encrypt the plaintext message M to the receiver, and the whole encryption and decryption process is not changed, but the public key (N, e) is changed into (N, e).
Preferably, in the process of RSA algorithm key generation, another N is generated, where N is equal to pmax*qmax,pmaxAnd q ismaxThe two largest prime numbers which are different in value range are added, one E is equal to 3, the public key (N, E) is not disclosed any more, the public key is (N, E), and the private key is not changed and is still (N, d).
Preferably, the sender confirms whether the receiver is reliable before sending the message, and after confirming that the receiver is reliable, the sender sends the public key (n, e) to the receiver by using the quantum key distribution technology and monitors whether the eavesdropper exists in the channel, if the eavesdropper is found, the sender is informed to regenerate the public and private key by using the RSA algorithm, and the sending and eavesdropping are carried out again until the eavesdropper is not found in the channel and the public key (n, e) is received by the receiver; then, the sender still uses the public key (N, E) to encrypt when sending the plaintext message M to the receiver, and the whole encryption and decryption process is not changed, but the public key (N, E) is changed into (N, E).
Compared with the prior art, the invention has the advantages that:
(1) the RSA technology and the quantum key distribution technology are combined, and the safety of public key (n, e) transmission is ensured.
(2) The time consumed by RSA reverse analysis can be greatly increased, the difficulty of RSA reverse analysis is improved, and the safety of RSA is improved.
(3) N ═ p addedmax*qmax,pmaxThe generation of the sum E ═ 3 consumes almost negligible resources and time, so the method is simple to implement and has low overhead, and the RSA has superiority and practicability at the same time.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the invention and not to limit the invention.
FIG. 1 is a flow diagram of an add E-key generation process;
FIG. 2 is a flow diagram of an add N-key generation process;
FIG. 3 is a flow diagram of an add N, E key generation process;
FIG. 4 shows the RSA inverse parsing decryption time after (n, E) is substituted for (n, E);
FIG. 5 shows the RSA inverse parsing decryption time after (N, e) is substituted for (N, e);
FIG. 6 shows the RSA inverse parsing decryption time after (N, E) is substituted for (N, E);
FIG. 7 is a 6-bit RSA decryption time;
FIG. 8 is an 8-bit RSA decryption time;
FIG. 9 is a 10-bit RSA decryption time;
Detailed Description
The following detailed description of the embodiments of the present invention will be provided with reference to the accompanying drawings and examples, so that how to implement the embodiments of the present invention by using technical means to solve the technical problems and achieve the technical effects can be fully understood and implemented.
A method for improving RSA reverse decryption difficulty combines a quantum key distribution technology and RSA, and designs a method for improving RSA reverse decryption difficulty by parameter replacement on the premise that a quantum key distribution technology detects a channel to ensure that a public key is not stolen, wherein the mechanism has three different replacement modes, namely, 1) replacing the public key (n, E) with (n, E); 2) replacing the public key (N, e) with (N, e); 3) the public key (N, E) is replaced by (N, E).
Further, in the process of RSA algorithm key generation, one key E is added as 3, the public key (n, E) is not disclosed any more, the public key is (n, E), and the private key is not changed and is still (n, d).
Further, a sender confirms whether a receiver is reliable before sending a message, and then sends a public key (n, e) to the receiver by using a quantum key distribution technology and monitors whether an eavesdropper exists in a channel, if the eavesdropper is found, the sender is informed to regenerate a public and private key by using an RSA algorithm, and the public key is sent and eavesdropped again until the eavesdropper is not found in the channel and the public key (n, e) is received by the receiver; then, the sender uses the public key (n, E) to encrypt the plaintext message M when sending the plaintext message M to the receiver, and the whole encryption and decryption process is not changed, but the public key (n, E) is changed into (n, E).
Furthermore, in the process of generating the RSA algorithm key, another N is generated, and N is equal to pmax*qmax,pmaxAnd q ismaxThe two largest prime numbers are different in value range, the public key (N, e) is not disclosed any more, the public key is (N, e), and the private key is not changed and is still (N, d).
Further, a sender confirms whether a receiver is reliable before sending a message, and then sends a public key (n, e) to the receiver by using a quantum key distribution technology and monitors whether an eavesdropper exists in a channel, if the eavesdropper is found, the sender is informed to regenerate a public and private key by using an RSA algorithm, and the public key is sent and eavesdropped again until the eavesdropper is not found in the channel and the public key (n, e) is received by the receiver; then, the sender uses the public key (N, e) to encrypt the plaintext message M to the receiver, and the whole encryption and decryption process is not changed, but the public key (N, e) is changed into (N, e).
Furthermore, in the process of generating the RSA algorithm key, another N is generated, and N is equal to pmax*qmax,pmaxAnd q ismaxIs within the range of valuesTwo different largest prime numbers are added, and then one more prime number E is added to be 3, the public key (N, E) is not disclosed any more, the public key is (N, E), and the private key is not changed and is still (N, d).
Further, a sender confirms whether a receiver is reliable before sending a message, and then sends a public key (n, e) to the receiver by using a quantum key distribution technology and monitors whether an eavesdropper exists in a channel, if the eavesdropper is found, the sender is informed to regenerate a public and private key by using an RSA algorithm, and the public key is sent and eavesdropped again until the eavesdropper is not found in the channel and the public key (n, e) is received by the receiver; then, the sender still uses the public key (N, E) to encrypt when sending the plaintext message M to the receiver, and the whole encryption and decryption process is not changed, but the public key (N, E) is changed into (N, E).
The experiment is carried out by selecting MATLABR2018a under i5-8400M CPU, 8GB memory and Windows 1064 bit operating system. Because of the limited computer capability, the experiment only carries out the experiment simulation of 6-bit RSA, 8-bit RSA and 10-bit RSA, and compares the time difference between three mechanisms for improving the RSA reverse analysis difficulty and the traditional RSA analysis difficulty.
TABLE 1 Experimental Environment
Figure BDA0002279886570000051
The foregoing is merely illustrative of the preferred embodiments of the present invention and is not to be construed as limiting the claims. The present invention is not limited to the above embodiments, and the specific structure thereof is allowed to vary. All changes which come within the scope of the invention as defined by the independent claims are intended to be embraced therein.

Claims (7)

1. The utility model provides a method for improving RSA reverse decryption degree of difficulty, combines together quantum key distribution technique and RSA, under the prerequisite that quantum key distribution technique detection channel guarantee public key is not stolen, utilizes parameter substitution to improve the RSA reverse decryption degree of difficulty, and this method has three kinds of different alternative modes, its characterized in that: 1) replacing the public key (n, E) with (n, E); 2) replacing the public key (N, e) with (N, e); 3) the public key (N, E) is replaced by (N, E).
2. The method for increasing the difficulty of RSA reverse decryption as claimed in claim 1, wherein: in the process of generating the key by the RSA algorithm, an E ═ 3 is added, the public key (n, E) is not disclosed any more, the public key is (n, E), and the private key is not changed and is still (n, d).
3. The method for increasing the difficulty of RSA reverse decryption as claimed in claim 2, wherein: the sender confirms whether the receiver is reliable before sending the message, and after confirming that the receiver is reliable, the sender sends the public key (n, e) to the receiver by using the quantum key distribution technology and monitors whether the channel has an eavesdropper, if the eavesdropper is found, the sender is informed to regenerate the public and private key by using an RSA algorithm, and the sending and the eavesdropping are carried out again until the channel does not find the eavesdropper and the public key (n, e) is received by the receiver; then, the sender uses the public key (n, E) to encrypt the plaintext message M when sending the plaintext message M to the receiver, and the whole encryption and decryption process is not changed, but the public key (n, E) is changed into (n, E).
4. The method for increasing the difficulty of RSA reverse decryption as claimed in claim 1, wherein: in the process of RSA algorithm key generation, another N is generated, and N is equal to pmax*qmax,pmaxAnd q ismaxThe two largest prime numbers are different in value range, the public key (N, e) is not disclosed any more, the public key is (N, e), and the private key is not changed and is still (N, d).
5. The method for increasing the difficulty of RSA reverse decryption as claimed in claim 4, wherein: the sender confirms whether the receiver is reliable before sending the message, and after confirming that the receiver is reliable, the sender sends the public key (n, e) to the receiver by using the quantum key distribution technology and monitors whether the channel has an eavesdropper, if the eavesdropper is found, the sender is informed to regenerate the public and private key by using an RSA algorithm, and the sending and the eavesdropping are carried out again until the channel does not find the eavesdropper and the public key (n, e) is received by the receiver; then, the sender uses the public key (N, e) to encrypt the plaintext message M to the receiver, and the whole encryption and decryption process is not changed, but the public key (N, e) is changed into (N, e).
6. The method for increasing the difficulty of RSA reverse decryption as claimed in claim 1, wherein: in the process of RSA algorithm key generation, another N is generated, and N is equal to pmax*qmax,pmaxAnd q ismaxThe two largest prime numbers which are different in value range are added, one E is equal to 3, the public key (N, E) is not disclosed any more, the public key is (N, E), and the private key is not changed and is still (N, d).
7. The method for increasing the difficulty of RSA reverse decryption as claimed in claim 6, wherein: the sender confirms whether the receiver is reliable before sending the message, and after confirming that the receiver is reliable, the sender sends the public key (n, e) to the receiver by using the quantum key distribution technology and monitors whether the channel has an eavesdropper, if the eavesdropper is found, the sender is informed to regenerate the public and private key by using an RSA algorithm, and the sending and the eavesdropping are carried out again until the channel does not find the eavesdropper and the public key (n, e) is received by the receiver; then, the sender still uses the public key (N, E) to encrypt when sending the plaintext message M to the receiver, and the whole encryption and decryption process is not changed, but the public key (N, E) is changed into (N, E).
CN201911137172.2A 2019-11-19 2019-11-19 Method for improving RSA reverse decryption difficulty Pending CN110868297A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911137172.2A CN110868297A (en) 2019-11-19 2019-11-19 Method for improving RSA reverse decryption difficulty

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911137172.2A CN110868297A (en) 2019-11-19 2019-11-19 Method for improving RSA reverse decryption difficulty

Publications (1)

Publication Number Publication Date
CN110868297A true CN110868297A (en) 2020-03-06

Family

ID=69654884

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911137172.2A Pending CN110868297A (en) 2019-11-19 2019-11-19 Method for improving RSA reverse decryption difficulty

Country Status (1)

Country Link
CN (1) CN110868297A (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0658020A1 (en) * 1993-12-07 1995-06-14 A.J. Fonseca, Lda A high security remote controlled actuating system
JPH1022991A (en) * 1996-06-28 1998-01-23 Hitachi Ltd Multi-address cipher communication method/device
CN107438006A (en) * 2017-09-12 2017-12-05 西安电子科技大学 Full multi-receiver label decryption method of the anonymity without certificate
WO2018166920A1 (en) * 2017-03-16 2018-09-20 British Telecommunications Public Limited Company Quantum key distribution in optical communications network
CN108923911A (en) * 2018-07-12 2018-11-30 广州安研信息科技有限公司 RSA cloud signature generating method
CN109660340A (en) * 2018-12-11 2019-04-19 北京安御道合科技有限公司 A kind of application system and its application method based on quantum key

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0658020A1 (en) * 1993-12-07 1995-06-14 A.J. Fonseca, Lda A high security remote controlled actuating system
JPH1022991A (en) * 1996-06-28 1998-01-23 Hitachi Ltd Multi-address cipher communication method/device
WO2018166920A1 (en) * 2017-03-16 2018-09-20 British Telecommunications Public Limited Company Quantum key distribution in optical communications network
CN107438006A (en) * 2017-09-12 2017-12-05 西安电子科技大学 Full multi-receiver label decryption method of the anonymity without certificate
CN108923911A (en) * 2018-07-12 2018-11-30 广州安研信息科技有限公司 RSA cloud signature generating method
CN109660340A (en) * 2018-12-11 2019-04-19 北京安御道合科技有限公司 A kind of application system and its application method based on quantum key

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
KYUNG-AH SHIM: "\"A survey of public-key cryptographic primitives in wireless sensor networks\"" *
叶燕: "数据安全传输及加密技术的研究" *

Similar Documents

Publication Publication Date Title
CN116321129B (en) Lightweight dynamic key-based power transaction private network communication encryption method
Mahesh et al. Design of new security algorithm: Using hybrid Cryptography architecture
Najaf Torkaman et al. Improving hybrid cryptosystems with DNA steganography
Subedar et al. Hybrid cryptography: Performance analysis of various cryptographic combinations for secure communication
CN113078997A (en) Terminal protection method based on lightweight cryptographic algorithm
Settia Cryptanalysis of modern cryptographic algorithms
CN111800784A (en) Block chain cloud service system based on cloud computing
CN110868297A (en) Method for improving RSA reverse decryption difficulty
Tiwari Cryptography in blockchain
Liu et al. Information Leakage Problem in High-Capacity Quantum Secure Communication with Authentication Using Einstein—Podolsky—Rosen Pairs
Liu et al. A secure and efficient code-based signature scheme
CN115694922A (en) File transmission encryption method and equipment under domestic CPU and OS
CN112367159B (en) Mixed encryption and decryption method and system for medical data secure storage
CN108566270B (en) Novel encryption method using double block cipher
Patro et al. Text-to-Image Encryption and Decryption Using Piece Wise Linear Chaotic Maps
CN111800384A (en) Financial service application management method and device based on block chain
Abdulhameed et al. Lightweight security protocol for WSNs using hybrid cryptography algorithm
Das et al. Statistical Cryptanalysis of ElGamal Cryptosystem for measuring security in disruptive technology
Zhang et al. Research on image-text encryption techniques in mobile communications
Wang et al. A one-time one-key encryption algorithm based on the ergodicity of chaos
Maihankali et al. Symmetric Cryptography for Confidential Communications: Implemented by Enhancing the Caesar Cipher
Hu et al. An Efficient Hybrid Encryption Scheme for Encrypting Smart Grid Business Data
Khan et al. LIGHTWEIGHT PRETTY GOOD PRIVACY EMAIL ENCRYPTION
JP3615133B2 (en) Public key encryption / decryption method and system using algebraic field
Adomey Introduction to cryptography

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
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20200306

WD01 Invention patent application deemed withdrawn after publication