On computing ord_N(2) and its application
From MaRDI portal
Publication:2500476
Recommendations
Cites work
- A monte carlo method for factorization
- Factoring integers with elliptic curves
- scientific article; zbMATH DE number 3885978 (Why is no real title available?)
- scientific article; zbMATH DE number 3959521 (Why is no real title available?)
- scientific article; zbMATH DE number 475432 (Why is no real title available?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Riemann's hypothesis and tests for primality
Cited in
(10)- Quantum algorithms for computing short discrete logarithms and factoring RSA integers
- Odd orders in Shor's factoring algorithm
- Quantum factorization algorithm by NMR ensemble computers
- On completely factoring any integer efficiently in a single run of an order-finding algorithm
- Probability estimates for Shor's algorithm
- Factorization
- Quantum factoring algorithm: resource estimation and survey of experiments
- Improving the success probability for Shor's factorization algorithm
- A new quantum algorithm for computing RSA ciphertext period
- RSA quantum cryptanalysis: a thorough exploration of n-bit attacks and emerging factoring techniques
This page was built for publication: On computing ord\(_{N}(2)\) and its application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500476)