No abstract

No abstract

No abstract

Abstract. In the research of knowledge acquisition based on rough sets theory, attribute reduction is a key problem. Many researchers proposed some algorithms for attribute reduction. Unfortunately, most of them are designed for static data processing. However, many real data are generated dynamically. In this paper, an incremental attribute reduction algorithm is proposed. When new objects are added into a decision information system, a new attribute reduction can be got by this method quickly.

This paper provides a new (second) way, which is completely different from Shor's algorithm, to show the optimistic potential of a D-Wave quantum computer for deciphering RSA and successfully factoring all integers within 10000. Our method significantly reduced the local field coefficient h and coupling term coefficient J by more than 33% and 26%, respectively, of those of Ising model, which can further improve the stability of qubit chains and improve the upper bound of integer factorization. In addition, our results obtained the best index (20-bit integer (1028171)) of quantum computing for deciphering RSA via the quantum computing software environment provided by D-Wave. Furthermore, Shor's algorithm requires approximately 40 qubits to factor the integer 1028171, which is far beyond the capacity of universal quantum computers. Thus, post quantum cryptography should further consider the potential of the D-Wave quantum computer for deciphering the RSA cryptosystem in future. The majority of scholars think that Shor's algorithm is a unique and powerful quantum algorithm for the cryptanalysis of RSA. Therefore, the current state of the post quantum cryptography (constructing post quantum public key cryptosystems that would be secure against quantum computers) research has exclusively studied the potential threats to Shor's algorithm. The security of the RSA cryptography system is based on the high complexity and security of the integer factorization problem. Shor's algorithm 1 can attack the RSA cryptosystem in polynomial time. There have been many simulations about quantum computers 2 and attempts to implement Shor's algorithm on quantum computing hardware 3-7. Researchers have developed classic emulators based on reconfigurable technology, enabling efficient simulation of various quantum algorithms and circuits, and they have the potential to simulate number of quits than software based simulators 2. Nuclear Magnetic Resonance (NMR) is the technology that we have for the implementation of small quantum computers. Vandersypen et al. 8 and Lu et al. 9 applied Shor's algorithm to factor the integer 15 via NMR and an optical quantum computer, respectively. Enrique et al. implemented a scalable version of Shor's algorithm via the iterative approach to factor 21 10. Based on the characteristics of the Fermat number 11 , Geller et al. used 8 qubits to successfully factor 51 and 85. The real physical realizations of Shor's algorithm cannot breakthrough the scale of factorization beyond 100 for the moment, as shown by principle-of-proof simulations and experiments 12. Actually, the number of qubits for performing Shor's algorithm to factor an n-bit integer still remains approximately 2n qubits 13. Shor's algorithm requires not only a large number of qubits but also a general-purpose quantum computer with high precision. Achieving practical quantum applications will take longer, perhaps much longer, as said by John Martinis, the physicist who leads Google's efforts 14 , and Science 15 commented that it will be years befor...