A quantum version of Pollard's Rho of which Shor's algorithm is a particular case

DOI10.1007/978-3-031-22105-7_19arXiv2011.05355OpenAlexW3101943331MaRDI QIDQ6113845

Daniel Chicayban Bastos, Luis Antonio B. Kowada

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.05355

zbMATH Keywords

quantum computingfactoringPollard's RhoShor's algorithmorder-findingperiod-finding

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast multiplication of large numbers
• Modern Computer Algebra
• A monte carlo method for factorization
• A method for obtaining digital signatures and public-key cryptosystems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Cryptography

This page was built for publication: A quantum version of Pollard's Rho of which Shor's algorithm is a particular case