On completely factoring any integer efficiently in a single run of an order-finding algorithm
Crossref DOI link: https://doi.org/10.1007/s11128-021-03069-1
Published Online: 2021-06-09
Published Print: 2021-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
EkerÄ, Martin http://orcid.org/0000-0002-7061-2374
Funding for this research was provided by:
Swedish NCSA, Swedish Armed Forces
Text and Data Mining valid from 2021-06-01
Version of Record valid from 2021-06-09
Article History
Received: 6 December 2020
Accepted: 15 March 2021
First Online: 9 June 2021