One of the most important quantum computing algorithms, known as Shor’s algorithm, would allow a large-scale quantum computer to quickly break essentially all of the encryption systems that are currently used to secure internet traffic against interception. In very general terms, Shor’s algorithm allows us to find prime decomposition of very big numbers in O((logN)^3) time and O(logN) space. Currently, our internet’s security relies mainly on the RSA encryption scheme, which involves encryption using a large number made of two large prime numbers.
Read the full article on the publisher's website.
Myself
As an Investment Consultant and Specialist, Pompeo Pontone is a Professional Investor with 25 years’ experience in the fields of Investment Management and Quantitative Finance, with advanced expertise in Computer Science and Data Science.