Security analysis of public-key cryptosystems is of fundamental significance for both theoretical research and applications in cryptography. In particular, the security of widely used public-key cryptosystems merits d...Security analysis of public-key cryptosystems is of fundamental significance for both theoretical research and applications in cryptography. In particular, the security of widely used public-key cryptosystems merits deep research to protect against new types of attacks. It is therefore highly meaningful to research cryptanalysis in the quantum computing environment. Shor proposed a wellknown factoring algorithm by finding the prime factors of a number n =pq, which is exponentially faster than the best known classical algorithm. The idea behind Shor's quantum factoring algorithm is a straightforward programming consequence of the following proposition: to factor n, it suffices to find the order r; once such an r is found, one can compute gcd( a^(r/2) ±1, n)=p or q. For odd values of r it is assumed that the factors of n cannot be found(since a^(r/2) is not generally an integer). That is, the order r must be even. This restriction can be removed, however, by working from another angle. Based on the quantum inverse Fourier transform and phase estimation, this paper presents a new polynomial-time quantum algorithm for breaking RSA, without explicitly factoring the modulus n. The probability of success of the new algorithm is greater than 4φ( r)/π~2 r, exceeding that of the existing quantum algorithm forattacking RSA based on factorization. In constrast to the existing quantum algorithm for attacking RSA, the order r of the fixed point C for RSA does not need to be even. It changed the practices that cryptanalysts try to recover the private-key, directly from recovering the plaintext M to start, a ciphertext-only attack attacking RSA is proposed.展开更多
Based on the fluid transient theory and explosive dynamics, a new type explosive driven jet is put forward. The generator of the proposed jet system comprises an explosive power source, a dynamic cavity, a spacing blo...Based on the fluid transient theory and explosive dynamics, a new type explosive driven jet is put forward. The generator of the proposed jet system comprises an explosive power source, a dynamic cavity, a spacing block, a water storage chamber, and a rubber membrane. The dynamic explosive source of power for the jet is composed of a cartridge and a bullet. The pressure in the dynamic cavity goes up to a range from 300 MPa to 350 MPa very quickly when the bullet is emitted. Driven by such a high pressure, the speed of the jet reaches 120 m/s. The effective distance to distinguish a fire is within 40 m. The jet has the following advantages over a conventional high-pressure water jet system: 1)strong power and strong transient force produced by dynamic source; 2) the energy of the dynamical source concentrated in a small scope with very little loss; 3) extensive applicability; and 4) safe usage without sparkling and smoke.展开更多
基金partially supported by he State Key Program of National Natural Science of China No. 61332019Major State Basic Research Development Program of China (973 Program) No. 2014CB340601+1 种基金the National Science Foundation of China No. 61202386, 61402339the National Cryptography Development Fund No. MMJJ201701304
文摘Security analysis of public-key cryptosystems is of fundamental significance for both theoretical research and applications in cryptography. In particular, the security of widely used public-key cryptosystems merits deep research to protect against new types of attacks. It is therefore highly meaningful to research cryptanalysis in the quantum computing environment. Shor proposed a wellknown factoring algorithm by finding the prime factors of a number n =pq, which is exponentially faster than the best known classical algorithm. The idea behind Shor's quantum factoring algorithm is a straightforward programming consequence of the following proposition: to factor n, it suffices to find the order r; once such an r is found, one can compute gcd( a^(r/2) ±1, n)=p or q. For odd values of r it is assumed that the factors of n cannot be found(since a^(r/2) is not generally an integer). That is, the order r must be even. This restriction can be removed, however, by working from another angle. Based on the quantum inverse Fourier transform and phase estimation, this paper presents a new polynomial-time quantum algorithm for breaking RSA, without explicitly factoring the modulus n. The probability of success of the new algorithm is greater than 4φ( r)/π~2 r, exceeding that of the existing quantum algorithm forattacking RSA based on factorization. In constrast to the existing quantum algorithm for attacking RSA, the order r of the fixed point C for RSA does not need to be even. It changed the practices that cryptanalysts try to recover the private-key, directly from recovering the plaintext M to start, a ciphertext-only attack attacking RSA is proposed.
基金the national Natural Science Foundation of China (No. 59874033).
文摘Based on the fluid transient theory and explosive dynamics, a new type explosive driven jet is put forward. The generator of the proposed jet system comprises an explosive power source, a dynamic cavity, a spacing block, a water storage chamber, and a rubber membrane. The dynamic explosive source of power for the jet is composed of a cartridge and a bullet. The pressure in the dynamic cavity goes up to a range from 300 MPa to 350 MPa very quickly when the bullet is emitted. Driven by such a high pressure, the speed of the jet reaches 120 m/s. The effective distance to distinguish a fire is within 40 m. The jet has the following advantages over a conventional high-pressure water jet system: 1)strong power and strong transient force produced by dynamic source; 2) the energy of the dynamical source concentrated in a small scope with very little loss; 3) extensive applicability; and 4) safe usage without sparkling and smoke.
