2023 IEEE 12th International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applicat 2023
DOI: 10.1109/idaacs58523.2023.10348718
|View full text |Cite
|
Sign up to set email alerts
|

Quantum-Inspired Computing: Shor's Algorithm and Euler's Totient Function

Valerii Hlukhov
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…The computational complexity of classical algorithms is exponential, while the Shor's algorithm offers polynomial complexity, which results in significantly faster computations. This solution combines conventional mathematical approaches and the principles of quantum mechanics [10]. The currently widely used RSA algorithm is based precisely on the complexity of the large number factorisation problem.…”
Section: Quantum Algorithmsmentioning
confidence: 99%
“…The computational complexity of classical algorithms is exponential, while the Shor's algorithm offers polynomial complexity, which results in significantly faster computations. This solution combines conventional mathematical approaches and the principles of quantum mechanics [10]. The currently widely used RSA algorithm is based precisely on the complexity of the large number factorisation problem.…”
Section: Quantum Algorithmsmentioning
confidence: 99%