{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T16:52:25Z","timestamp":1781369545718,"version":"3.54.1"},"reference-count":83,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T00:00:00Z","timestamp":1681430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T00:00:00Z","timestamp":1681430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s11227-023-05233-z","type":"journal-article","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T15:02:11Z","timestamp":1681484531000},"page":"15098-15139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":88,"title":["A survey on implementations of homomorphic encryption schemes"],"prefix":"10.1007","volume":"79","author":[{"given":"Thi Van Thao","family":"Doan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed-Lamine","family":"Messai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00e9rald","family":"Gavin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00e9r\u00f4me","family":"Darmont","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,14]]},"reference":[{"issue":"4","key":"5233_CR1","first-page":"1","volume":"51","author":"A Abbas","year":"2018","unstructured":"Abbas A et al (2018) A survey on homomorphic encryption schemes: theory and implementation. ACM Comput Surv (Csur) 51(4):1\u201335","journal-title":"ACM Comput Surv (Csur)"},{"key":"5233_CR2","unstructured":"Diffie W, Hellman ME (2019) New directions in cryptography. In: Secure communications and asymmetric cryptosystems. Routledge, pp 143\u2013180"},{"issue":"4","key":"5233_CR3","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"EG Taher","year":"1985","unstructured":"Taher EG (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 31(4):469\u2013472","journal-title":"IEEE Trans Inf Theory"},{"key":"5233_CR4","unstructured":"Pascal P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: International Conference on the Theory and Applications of Cryptographic Techniques. Springer, pp 223\u2013238"},{"key":"5233_CR5","unstructured":"Craig G (2009) A fully homomorphic encryption scheme. Stanford university"},{"issue":"3","key":"5233_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"B Zvika","year":"2014","unstructured":"Zvika B, Craig G, Vinod V (2014) (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans Comput Theory (TOCT) 6(3):1\u201336","journal-title":"ACM Trans Comput Theory (TOCT)"},{"key":"5233_CR7","unstructured":"Junfeng F, Frederik V (2012) Somewhat practical fully homomorphic encryption. In: Cryptology ePrint Archive"},{"key":"5233_CR8","doi-asserted-by":"crossref","unstructured":"Cheon JH et\u00a0al (2017) Homomorphic encryption for arithmetic of approximate numbers. In: International Conference on the Theory and Application of Cryptology and Information Security. Springer, pp 409\u2013437","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"5233_CR9","doi-asserted-by":"crossref","unstructured":"L\u00e9o D, Daniele M (2015) FHEW: bootstrapping homomorphic encryption in less than a second. In: Advances in Cryptology-EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part I 34. Springer, pp 617\u2013640","DOI":"10.1007\/978-3-662-46800-5_24"},{"issue":"1","key":"5233_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"C Ilaria","year":"2020","unstructured":"Ilaria C et al (2020) TFHE: fast fully homomorphic encryption over the torus. J Cryptol 33(1):34\u201391","journal-title":"J Cryptol"},{"key":"5233_CR11","doi-asserted-by":"crossref","unstructured":"Craig G, Amit S, Brent W (2013) Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Advances in Cryptology-CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322. Proceedings, Part I. Springer, pp 75\u201392","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"5233_CR12","unstructured":"Daniele M, Yuriy P (2021) Bootstrapping in FHEW-like cryptosystems. In: Proceedings of the 9th on Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pp 17\u201328"},{"key":"5233_CR13","doi-asserted-by":"crossref","unstructured":"Nicolas G et al (2016) Structural lattice reduction: generalized worstcase to average-case reductions and homomorphic cryptosystems. In: Advances in Cryptology-EUROCRYPT 2016: 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8\u201312, 2016, Proceedings, Part II 35. Springer, pp 528\u2013558","DOI":"10.1007\/978-3-662-49896-5_19"},{"key":"5233_CR14","doi-asserted-by":"crossref","unstructured":"Jacob A-S, Chris P (2014) Faster bootstrapping with polynomial error. In: Advances in Cryptology-CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2014, Proceedings, Part I 34. Springer, pp 297\u2013314","DOI":"10.1007\/978-3-662-44371-2_17"},{"issue":"2","key":"5233_CR15","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Adi S, Leonard A (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120\u2013126","journal-title":"Commun ACM"},{"key":"5233_CR16","doi-asserted-by":"crossref","unstructured":"Parmar PV et al (2014) Survey of various homomorphic encryption algorithms and schemes. Int J Comput Appl 91","DOI":"10.5120\/15902-5081"},{"key":"5233_CR17","doi-asserted-by":"crossref","unstructured":"Dan B, Eu-Jin G, Kobbi N (2005) Evaluating 2-DNF formulas on ciphertexts. In: Theory of Cryptography Conference. Springer, pp 325\u2013341","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"5233_CR18","unstructured":"Subir H, Mauro C (2021) Crypsh: a novel iot data protection scheme based on BGN cryptosystem. IEEE Trans Cloud Comput"},{"key":"5233_CR19","unstructured":"De\u00a0Castro LRN (2020) Practical homomorphic encryption implementations & applications. PhD thesis. Massachusetts Institute of Technology"},{"key":"5233_CR20","unstructured":"Oliver M et al (2019) Towards a homomorphic machine learning big data pipeline for the financial services sector. In: Cryptology ePrint Archive"},{"key":"5233_CR21","doi-asserted-by":"crossref","unstructured":"Chillotti I et al (2016) A homomorphic LWE based E-voting scheme. In: Post-Quantum Cryptography: 7th International Workshop, PQCrypto 2016, Fukuoka, Japan, February 24\u201326, 2016, Proceedings 7. Springer, pp 245\u2013265","DOI":"10.1007\/978-3-319-29360-8_16"},{"issue":"6","key":"5233_CR22","first-page":"1","volume":"50","author":"M Paulo","year":"2017","unstructured":"Paulo M, Leonel S, Artur M (2017) A survey on fully homomorphic encryption: an engineering perspective. ACM Comput Surv (CSUR) 50(6):1\u201333","journal-title":"ACM Comput Surv (CSUR)"},{"key":"5233_CR23","doi-asserted-by":"crossref","unstructured":"Andrey K, Yuriy P, Vincent Z (2021) Revisiting homomorphic encryption schemes for finite fields. In: International Conference on the Theory and Application of Cryptology and Information Security. Springer, pp 608\u2013639","DOI":"10.1007\/978-3-030-92078-4_21"},{"key":"5233_CR24","doi-asserted-by":"crossref","unstructured":"Tancrede L, Michael N (2014) A comparison of the homomorphic encryption schemes FV and YASHE. In: International Conference on Cryptology in Africa. Springer, pp 318\u2013335","DOI":"10.1007\/978-3-319-06734-6_20"},{"key":"5233_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2020.100235","volume":"36","author":"A Bechir","year":"2020","unstructured":"Bechir A, Lamri L, Nihel M (2020) Homomorphic encryption systems statement: trends and challenges. Comput Sci Rev 36:100235","journal-title":"Comput Sci Rev"},{"key":"5233_CR26","unstructured":"Vasily S, Ethan\u00a0Yi\u00a0Fan W, Wee KN (2022) Comprehensive performance analysis of homomorphic cryptosystems for practical data processing. In: arXiv preprint arXiv:2202.02960"},{"key":"5233_CR27","unstructured":"Vincent M, Guillaume B, Caroline F (2016) Determination and exploration of practical parameters for the latest Somewhat Homomorphic Encryption (SHE) Schemes"},{"key":"5233_CR28","unstructured":"Kim L (2017) Simple encrypted arithmetic library 2.3.1. https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2017\/11\/sealmanual- 2-3-1.pdf"},{"key":"5233_CR29","unstructured":"Yuriy P, et al (2022) Palisade lattice cryptography library user manual. In: Cybersecurity Research Center, New Jersey Institute of Technology (NJIT), Tech Rep"},{"key":"5233_CR30","doi-asserted-by":"crossref","unstructured":"Shai H, Victor S (2014) Algorithms in helib. In: Annual Cryptology Conference. Springer, pp 554\u2013571","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"5233_CR31","unstructured":"Jung\u00a0Hee C et al (2021) Implementation of HEAAN. https:\/\/github.com\/snucrypto\/HEAAN"},{"key":"5233_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2007\/13801","volume":"2007","author":"F Caroline","year":"2007","unstructured":"Caroline F, Fabien G (2007) A survey of homomorphic encryption for nonspecialists. EURASIP J Inf Secur 2007:1\u201310","journal-title":"EURASIP J Inf Secur"},{"key":"5233_CR33","doi-asserted-by":"crossref","unstructured":"Zaraket C et al (2021) Cloud based private data analytic using secure computation over encrypted data. J King Saud Univ Comput Inf Sci","DOI":"10.1016\/j.jksuci.2021.06.014"},{"key":"5233_CR34","doi-asserted-by":"crossref","unstructured":"Mohammed SJ, Taha DB (2022) Performance evaluation of RSA, ElGamal, and paillier partial homomorphic encryption algorithms. In: 2022 International Conference on Computer Science and Software Engineering (CSASE). IEEE, pp 89\u201394","DOI":"10.1109\/CSASE51777.2022.9759825"},{"key":"5233_CR35","unstructured":"HElib v2.2.1 (2020). https:\/\/github.com\/homenc\/HElib.IBM"},{"key":"5233_CR36","doi-asserted-by":"crossref","unstructured":"Halevi S, Shoup V (2018) Faster homomorphic linear transformations in HElib. In: Annual International Cryptology Conference. Springer, pp 93\u2013120","DOI":"10.1007\/978-3-319-96884-1_4"},{"key":"5233_CR37","unstructured":"PALISADE v1.10.6. (2020) https:\/\/gitlab.com\/palisade\/palisade-release. PALISADE Project, Dec 2020"},{"key":"5233_CR38","doi-asserted-by":"crossref","unstructured":"Al Badawi A et\u00a0al (2022) OpenFHE: Open-source fully homomorphic encryption library. In: Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pp 53\u201363","DOI":"10.1145\/3560827.3563379"},{"key":"5233_CR39","unstructured":"SEAL (release 4.0). https:\/\/github.com\/microsoft\/SEAL. Microsoft Research, Redmond, WA, Apr 2020"},{"key":"5233_CR40","unstructured":"SEAL\u2013Python (2022) https:\/\/github.com\/Huelse\/SEAL-Python. Microsoft SEAL 4.X For Python, May 2022"},{"key":"5233_CR41","unstructured":"pybind11 (2021). https:\/\/github.com\/pybind\/pybind11"},{"issue":"4","key":"5233_CR42","first-page":"337","volume":"7","author":"PL Montgomery","year":"1994","unstructured":"Montgomery PL (1994) A survey of modern integer factorization algorithms. CWI Quarterly 7(4):337\u2013366","journal-title":"CWI Quarterly"},{"key":"5233_CR43","doi-asserted-by":"crossref","unstructured":"Brakerski Z (2012) Fully homomorphic encryption without modulus switching from classical GapSVP. In: Annual Cryptology Conference. Springer, pp 868\u2013886","DOI":"10.1007\/978-3-642-32009-5_50"},{"issue":"6","key":"5233_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. JACM 56(6):1\u201340","journal-title":"JACM"},{"key":"5233_CR45","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O (2010) On ideal lattices and learning with errors over rings. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, pp 1\u201323","DOI":"10.1007\/978-3-642-13190-5_1"},{"issue":"2","key":"5233_CR46","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Vaikuntanathan V (2014) Efficient fully homomorphic encryption from (standard) LWE. SIAM Journal on Computing 43(2):831\u2013871","journal-title":"SIAM Journal on Computing"},{"key":"5233_CR47","unstructured":"Rocha VF, L\u00f3pez J, Falc\u00e3o Da Rocha V (2019) An overview on homomorphic encryption algorithms"},{"key":"5233_CR48","unstructured":"Rocha VF, L\u00f3pez J, Falc\u00e3o Da Rocha V (2018) An overview on homomorphic encryption algorithms. In: UNICAMP Universidade Estadual de Campinas, Tech Rep"},{"issue":"17","key":"5233_CR49","doi-asserted-by":"publisher","first-page":"5732","DOI":"10.3390\/app10175732","volume":"10","author":"W Yuan","year":"2020","unstructured":"Yuan W, Gao H (2020) An efficient BGV-type encryption scheme for IoT systems. Appl Sci 10(17):5732","journal-title":"Appl Sci"},{"key":"5233_CR50","unstructured":"Yongsoo S (2019) Introduction to CKKS. In: Private AI Boot-camp, Microsoft Research"},{"key":"5233_CR51","doi-asserted-by":"crossref","unstructured":"Lee Y et\u00a0al (2022) Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption. In: Cryptology ePrint Archive","DOI":"10.1007\/978-3-031-30620-4_8"},{"key":"5233_CR52","doi-asserted-by":"crossref","unstructured":"Albrecht M et\u00a0al (2021) Homomorphic encryption standard. In: Protecting Privacy Through Homomorphic Encryption, pp 31\u201362","DOI":"10.1007\/978-3-030-77287-1_2"},{"key":"5233_CR53","unstructured":"Doan TVT (2022) Implementation of PHE schemes: El-Gamal, Paillier and RSA. https:\/\/github.com\/ThaoDoanVan\/PHE. May 2022"},{"key":"5233_CR54","doi-asserted-by":"crossref","unstructured":"Heather J et\u00a0al (2013) Solving the discrete logarithm problem for packing candidate preferences. In: International Conference on Availability, Reliability, and Security. Springer, pp 209\u2013221","DOI":"10.1007\/978-3-642-40588-4_15"},{"key":"5233_CR55","doi-asserted-by":"crossref","unstructured":"Pohlig S, Hellman M (1978)An improved algorithm for computing logarithms over GF (p) and its cryptographic significance (corresp.). IEEE Trans Inf Theory 24(1):106- 110","DOI":"10.1109\/TIT.1978.1055817"},{"key":"5233_CR56","doi-asserted-by":"crossref","unstructured":"Bellare M et\u00a0al (1998) Relations among notions of security for public-key encryption schemes. In: Annual International Cryptology Conference. Springer, pp 26\u201345","DOI":"10.1007\/BFb0055718"},{"key":"5233_CR57","doi-asserted-by":"crossref","unstructured":"Chenal M, Tang Q (2014) On key recovery attacks against existing somewhat homomorphic encryption schemes. In: International Conference on Cryptology and Information Security in Latin America. Springer, pp 239\u2013258","DOI":"10.1007\/978-3-319-16295-9_13"},{"issue":"1","key":"5233_CR58","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3390\/cryptography6010013","volume":"6","author":"P Fauzi","year":"2022","unstructured":"Fauzi P, Hovd MN, Raddum H (2022) On the IND-CCA1 security of FHE schemes. Cryptography 6(1):13","journal-title":"Cryptography"},{"key":"5233_CR59","unstructured":"Peng Z (2019) Danger of using fully homomorphic encryption: A look at Microsoft SEAL. In: arXiv preprint arXiv:1906.07127"},{"key":"5233_CR60","doi-asserted-by":"crossref","unstructured":"Li B, Micciancio D (2021) On the security of homomorphic encryption on approximate numbers. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, pp 648\u2013677","DOI":"10.1007\/978-3-030-77870-5_23"},{"key":"5233_CR61","unstructured":"Guo Y, Cao Z, Dong X (2020) A generalization of Paillier\u2019s public-key system with fast decryption. In: Cryptology ePrint Archive"},{"issue":"2","key":"5233_CR62","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10623-011-9601-2","volume":"67","author":"F Armknecht","year":"2013","unstructured":"Armknecht F, Katzenbeisser S, Peter A (2013) Group homomorphic encryption: characterizations, impossibility results, and applications. Designs, Codes and Cryptography 67(2):209\u2013232","journal-title":"Designs, Codes and Cryptography"},{"key":"5233_CR63","doi-asserted-by":"crossref","unstructured":"Tsiounis Y, Yung M (1998) On the security of ElGamal based encryption. In: International Workshop on Public Key Cryptography. Springer, pp 117\u2013134","DOI":"10.1007\/BFb0054019"},{"key":"5233_CR64","unstructured":"Wu J, Stinson DR (2008) On the security of the ElGamal encryption scheme and Damgard\u2019s variant. In: Cryptology ePrint Archive"},{"key":"5233_CR65","doi-asserted-by":"crossref","unstructured":"JM Pollard (1974) Theorems on factorization and primality testing. In: Mathematical proceedings of the Cambridge philosophical society, vol 76(3). Cambridge University Press, pp 521\u2013528","DOI":"10.1017\/S0305004100049252"},{"key":"5233_CR66","unstructured":"Doan TVT, Nguyen TMP, Tran DN (2022) Simple methods for factorization. https:\/\/github.com\/ThaoDoanVan\/ Factorization. Project report. Sciences and Technologies Faculty, University of Limoges, Jan"},{"key":"5233_CR67","unstructured":"Loria (2021) Record factors found by Pollard\u2019s p-1 method. https:\/\/members.loria.fr\/PZimmermann\/records\/Pminus1.html"},{"key":"5233_CR68","doi-asserted-by":"crossref","unstructured":"Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th annual symposium on foundations of computer science. IEEE, pp 124\u2013134","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"2","key":"5233_CR69","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor PW (1999) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev 41(2):303\u2013332","journal-title":"SIAM Rev"},{"issue":"1","key":"5233_CR70","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep03023","volume":"3","author":"MR Geller","year":"2013","unstructured":"Geller MR, Zhou Z (2013) Factoring 51 and 85 with 8 qubits. Scientific Reports 3(1):1\u20135","journal-title":"Scientific Reports"},{"issue":"6866","key":"5233_CR71","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1038\/414883a","volume":"414","author":"LMK Vandersypen","year":"2001","unstructured":"Vandersypen LMK et al (2001) Experimental realization of Shor\u2019s quantum factoring algorithm using nuclear magnetic resonance. Nature 414(6866):883\u2013887","journal-title":"Nature"},{"issue":"11","key":"5233_CR72","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1038\/nphoton.2012.259","volume":"6","author":"E Martin-Lopez","year":"2012","unstructured":"Martin-Lopez E et al (2012) Experimental realization of Shor\u2019s quantum factoring algorithm using qubit recycling. Nature Photonics 6(11):773\u2013776","journal-title":"Nature Photonics"},{"key":"5233_CR73","doi-asserted-by":"publisher","first-page":"433","DOI":"10.22331\/q-2021-04-15-433","volume":"5","author":"C Gidney","year":"2021","unstructured":"Gidney C, Eker\u00e5 M (2021) How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum 5:433","journal-title":"Quantum"},{"issue":"2","key":"5233_CR74","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1103\/PhysRevA.54.1034","volume":"54","author":"D Beckman","year":"1996","unstructured":"Beckman D et al (1996) Efficient networks for quantum factoring. Phys Rev A 54(2):1034","journal-title":"Phys Rev A"},{"issue":"1","key":"5233_CR75","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1103\/PhysRevA.54.147","volume":"54","author":"V Vedral","year":"1996","unstructured":"Vedral V, Barenco A, Ekert A (1996) Quantum networks for elementary arithmetic operations. Phys Rev A 54(1):147","journal-title":"Phys Rev A"},{"key":"5233_CR76","doi-asserted-by":"crossref","unstructured":"Beauregard S (2002) Circuit for Shor\u2019s algorithm using 2n+ 3 qubits. In: arXiv preprint quant-ph\/0205095","DOI":"10.26421\/QIC3.2-8"},{"issue":"2","key":"5233_CR77","first-page":"184","volume":"6","author":"Y Takahashi","year":"2006","unstructured":"Takahashi Y, Kunihiro N (2006) A quantum circuit for Shor\u2019s factoring algorithm using 2n+ 2 qubits. Quantum Inf Comput 6(2):184\u2013192","journal-title":"Quantum Inf Comput"},{"key":"5233_CR78","doi-asserted-by":"crossref","unstructured":"H\u00e4ner T, Roetteler M, Svore KM (2016) Factoring using 2n+ 2 qubits with Toffoli based modular multiplication. In: arXiv preprint arXiv:1611.07995","DOI":"10.26421\/QIC17.7-8-7"},{"key":"5233_CR79","unstructured":"Gidney C (2017) Factoring with n+ 2 clean qubits and n-1 dirty qubits. In: arXiv preprint arXiv:1706.07884"},{"issue":"6","key":"5233_CR80","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-020-02673-x","volume":"19","author":"J Suo","year":"2020","unstructured":"Suo J et al (2020) Quantum algorithms for typical hard problems: a perspective of cryptanalysis. Quantum Inf Process 19(6):1\u201326","journal-title":"Quantum Inf Process"},{"key":"5233_CR81","doi-asserted-by":"crossref","unstructured":"Proos J, Zalka C (2003) Shor\u2019s discrete logarithm quantum algorithm for elliptic curves. In: arXiv preprint quant-ph\/0301141","DOI":"10.26421\/QIC3.4-3"},{"key":"5233_CR82","unstructured":"Eker\u00e5 M (2019) Revisiting Shor\u2019s quantum algorithm for computing general discrete logarithms. In: arXiv preprint arXiv:1905.09084"},{"key":"5233_CR83","unstructured":"Wang F (2010) The hidden subgroup problem. In: arXiv preprint arXiv:1008.0010"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05233-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05233-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05233-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T11:17:25Z","timestamp":1687864645000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05233-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,14]]},"references-count":83,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["5233"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05233-z","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,14]]},"assertion":[{"value":"26 March 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"I declare that the authors have no competing interests as defined by Springer, or other interests that might be perceived to influence the results and\/or discussion reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}