China
Africa
Explore chapters and articles related to this topic
Quantum Computing Application for Satellites and Satellite Image Processing
Published in Thiruselvan Subramanian, Archana Dhyani, Adarsh Kumar, Sukhpal Singh Gill, Artificial Intelligence, Machine Learning and Blockchain in Quantum Satellite, Drone and Network, 2023
Ajay Kumar, B.S. Tewari, Kamal Pandey
The existing methods of integration and testing of components of a satellite are very slow. The conventional process of manufacturing highly specialised and customised satellites is slow, which is one of the major drawbacks in the present scenario. The major reason behind this is that the existing systems lack the capability of solving the big numerical simulation problems at high speed. Alternatively, a fast quantum computer makes it possible to solve very complex simulation problems at a very high speed. The main inspiration for developing working quantum computers comes from quantum computers’ ability to crack public-key encryption systems like the commonly used Ron Rivest, Adi Shamir, and Leonard Adleman (RSA) scheme (Rivest et al., 1978). Shor’s quantum algorithm (1994) highlights the potential advantage of quantum computers in this sector by efficiently factoring huge integer numbers into prime factors in polynomial time, whereas the most efficient conventional techniques take sub-exponential time. Quantum computers will almost certainly be employed to solve complex scientific challenges once they are fully functional. Computer simulation technology is used to analyse difficult challenges that develop in several fields when computing scientific topics. In all simulation methodologies, the results’ reliability is always an issue. The approximation results could be regarded as “the real answer,” posing a societal risk. Therefore, we may trust the findings in cases where the approximations can be compared with measurements for a number of scenarios, but the results for difficult and new applications should be regarded with caution. Assume having a fully functional quantum computer, which is capable of solving the big complex numerical simulation problems in a few seconds. Obviously, it will result in speedy testing of satellite system components; thus, the process of developing a satellite will be faster.
Systematic Survey: Secure and Privacy-Preserving Big Data Analytics in Cloud
Published in Journal of Computer Information Systems, 2023
Arun Amaithi Rajan, Vetriselvi V
The majority of authentication mechanisms in classical cryptosystems are based on cryptographic primitives. For instance, RSA and ElGamal are cryptosystems built on factorization or discrete logarithm hard problems. It is widely assumed that such primitives are vulnerable to quantum algorithms. Shor’s algorithm32 is a quantum algorithm that solves discrete logarithm and factorization problems in sub-exponential time complexity. So, if we continue to have the same cryptosystem, there is a chance that quantum computers will attack secure applications within polynomial time in the future. So, with a longer vision, more works are being done in quantum cryptography.33 As we have hard problems in traditional systems, such as discrete logarithm, there are some hard problems in the quantum environment also such as lattice problems which prompted scientists to develop quantum cryptography algorithms. A survey on lattice-based cryptography implementations in software and hardware by Nejatollahi et al.34 gives an overview of existing algorithms in post-quantum cryptography based on lattice problems. The authors worked on implementations which tackles different issues such as memory footprint, energy, security and, given some proposals for lattices in information security