## Topics from this paper

## 3 Citations

An Efficient Quantum Computing technique for cracking RSA using Shor’s Algorithm

- Computer Science2020 IEEE 5th International Conference on Computing Communication and Automation (ICCCA)
- 2020

This paper will discuss about various QC algorithms and will illustrate how shor’s algorithm is able to crack RSA algorithms and the demonstration of the applicability has been evaluated based on Computation time, storage capacity, accuracy, confidentiality, efficiency, integrity, and availability.

Lattice-based cryptography - A comparative description and analysis of proposed schemes

- Computer Science
- 2017

This thesis presents several possible candidates for new standard public-key cryptosystems, mainly NTRU and ring-LWE-based systems that are shown to be very fast and have strong, provable security against quantum computers, but are a lot more complicated than RSA and Diffie-Hellman.

A Compare between Shor's quantum factoring algorithm and General Number Field Sieve

- Mathematics2014 International Conference on Electrical Engineering and Information & Communication Technology
- 2014

Factoring large integers has been one of the most difficult problems in the history of mathematics and computer science. There was no efficient solution of this problem until Shor's algorithm…

## References

SHOWING 1-10 OF 14 REFERENCES

Timeline of quantum computing

- Available at: http://en.wikipedia.org/wiki/Timeline of quantum computing [Accessed 14 Jan. 2015].
- 2015

Introduction to Algorithms

- Computer Science
- 2014

This chapter provides an overview of the fundamentals of algorithms and their links to self-organization, exploration, and exploitation.

An Introduction to the Bootstrap

- Computer Science
- 2001

This article presents bootstrap methods for estimation, using simple arguments, with Minitab macros for implementing these methods, as well as some examples of how these methods could be used for estimation purposes.

Explorations in quantum computing

- Physics, Computer Science
- 1997

This book draws upon the very latest research and uses executable software simulations to help explain the material and allow the reader to experiment with the ideas behind quantum computers.

Searching a Quantum Phone Book

- PhysicsScience
- 1997

Finding a phone number in a directory when one knows the name is easy; much harder is finding the name given the number. On average, a search algorithm will have to scan half the total number of…

A fast quantum mechanical algorithm for database search

- Computer Science, PhysicsSTOC '96
- 1996

In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .

Algorithms for quantum computation: discrete logarithms and factoring

- Mathematics, Computer ScienceProceedings 35th Annual Symposium on Foundations of Computer Science
- 1994

Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.

An approximate Fourier transform useful in quantum factoring", IBM Research Report RC19642 ,; R. Cle

- Mathematics, Physics
- 1994

We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring…