{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T18:10:01Z","timestamp":1746641401728,"version":"3.40.5"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172433"],"award-info":[{"award-number":["62172433"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006407","name":"Natural Science Foundation of Henan Province","doi-asserted-by":"publisher","award":["242300421414"],"award-info":[{"award-number":["242300421414"]}],"id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s10623-024-01554-z","type":"journal-article","created":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T14:46:19Z","timestamp":1735310779000},"page":"1357-1374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fault attacks on multi-prime RSA signatures"],"prefix":"10.1007","volume":"93","author":[{"given":"Chunzhi","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Jinzheng","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Junqi","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Qingfeng","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,27]]},"reference":[{"issue":"2","key":"1554_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s001450010016","volume":"14","author":"D Boneh","year":"2001","unstructured":"Boneh D., Demillo R.A., Lipton R.J.: On the importance of eliminating errors in cryptographic computations. J. Cryptol. 14(2), 101\u2013119 (2001). https:\/\/doi.org\/10.1007\/s001450010016.","journal-title":"J. Cryptol."},{"unstructured":"Cohn, H., Heninger, N.: Approximate common divisors via lattices. Preprint at arXiv:1108.2714 (2011)","key":"1554_CR2"},{"unstructured":"Collins, T., Hopkins, D., Langford, S., Sabin, M.: Public key cryptographic apparatus and method (1997)","key":"1554_CR3"},{"doi-asserted-by":"publisher","unstructured":"Coppersmith, D.: Finding a small root of a univariate modular equation. In: U.\u00a0Maurer (ed.) Advances in Cryptology-EUROCRYPT 1996, pp. 155\u2013165. Springer Berlin Heidelberg, Berlin, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_14","key":"1554_CR4","DOI":"10.1007\/3-540-68339-9_14"},{"issue":"4","key":"1554_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptol. 10(4), 233\u2013260 (1997). https:\/\/doi.org\/10.1007\/s001459900030.","journal-title":"J. Cryptol."},{"doi-asserted-by":"publisher","unstructured":"Coron, J.S., Joux, A., Kizhvatov, I., Naccache, D., Paillier, P.: Fault attacks on RSA signatures with partially unknown messages. In: C.\u00a0Clavier, K.\u00a0Gaj (eds.) Cryptographic Hardware and Embedded Systems-CHES 2009, pp. 444\u2013456. Springer Berlin Heidelberg, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04138-9_31","key":"1554_CR6","DOI":"10.1007\/978-3-642-04138-9_31"},{"doi-asserted-by":"publisher","unstructured":"Dodge, Y.: Central limit theorem, pp. 66\u201368. Springer New York, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-32833-1_50","key":"1554_CR7","DOI":"10.1007\/978-0-387-32833-1_50"},{"doi-asserted-by":"publisher","unstructured":"Gueron, S., Drucker, N.: Cryptosystems with a multi prime composite modulus. In: 2018 15th IEEE Annual Consumer Communications & Networking Conference (CCNC), pp. 1\u20137. IEEE (2018). https:\/\/doi.org\/10.1109\/CCNC.2018.8319159","key":"1554_CR8","DOI":"10.1109\/CCNC.2018.8319159"},{"doi-asserted-by":"publisher","unstructured":"Gueron, S., Krasnov, V.: Speed records for multi-prime RSA using AVX2 architectures. In: S.\u00a0Latifi (ed.) Information Technology: New Generations, pp. 237\u2013245. Springer International Publishing, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32467-8_22","key":"1554_CR9","DOI":"10.1007\/978-3-319-32467-8_22"},{"doi-asserted-by":"publisher","unstructured":"Han, L., Wei, W., Liu, M.: On the multiple fault attacks on RSA signatures with LSBs of messages unknown. In: M.\u00a0Kuty\u0142owski, M.\u00a0Yung (eds.) Information Security and Cryptology, pp. 1\u20139. Springer Berlin Heidelberg, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38519-3_1","key":"1554_CR10","DOI":"10.1007\/978-3-642-38519-3_1"},{"doi-asserted-by":"publisher","unstructured":"Hermawan, N.T.E., Winarko, E., Ashari, A.: Eight prime numbers of modified RSA algorithm method for more secure single board computer implementation. Int. J. Adv. Sci. Eng. Inform. Technol. 11(6): 2375\u20132384 (2021). https:\/\/doi.org\/10.18517\/ijaseit.11.6.13700","key":"1554_CR11","DOI":"10.18517\/ijaseit.11.6.13700"},{"issue":"2","key":"1554_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1515\/JMC.2008.006","volume":"2","author":"MJ Hinek","year":"2008","unstructured":"Hinek M.J.: On the security of multi-prime RSA. J. Math. Cryptol. 2(2), 117\u2013147 (2008). https:\/\/doi.org\/10.1515\/JMC.2008.006.","journal-title":"J. Math. Cryptol."},{"doi-asserted-by":"publisher","unstructured":"Howgrave-Graham, N.: Finding small roots of univariate modular equations revisited. In: M.\u00a0Darnell (ed.) Crytography and Coding, pp. 131\u2013142. Springer Berlin Heidelberg, Berlin, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0024458","key":"1554_CR13","DOI":"10.1007\/BFb0024458"},{"doi-asserted-by":"publisher","unstructured":"Jonsson, J., Kaliski, B.: RFC3447: Public-key cryptography standards (PKCS) #1: RSA cryptography specifications version 2.1 (2003). https:\/\/doi.org\/10.17487\/RFC3447","key":"1554_CR14","DOI":"10.17487\/RFC3447"},{"doi-asserted-by":"publisher","unstructured":"Kamardan, M.G., Aminudin, N., Che-Him, N., Sufahani, S., Khalid, K., Roslan, R.: Modified multi prime RSA cryptosystem. In: Journal of Physics: Conference Series, vol. 995, p. 012030. IOP Publishing (2018). https:\/\/doi.org\/10.1088\/1742-6596\/995\/1\/012030","key":"1554_CR15","DOI":"10.1088\/1742-6596\/995\/1\/012030"},{"doi-asserted-by":"publisher","unstructured":"Krishnamurthy, A., Tang, Y., Xu, C., Wang, Y.: An efficient implementation of multi-prime RSA on DSP processor. In: 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP \u201903)., vol.\u00a02, pp. II\u2013413 (2003). https:\/\/doi.org\/10.1109\/ICASSP.2003.1202387","key":"1554_CR16","DOI":"10.1109\/ICASSP.2003.1202387"},{"key":"1554_CR17","volume-title":"Memo on RSA Signature Generation in the Presence of Faults","author":"AK Lenstra","year":"1996","unstructured":"Lenstra A.K.: Memo on RSA Signature Generation in the Presence of Faults. Tech. rep, EPFL (1996)."},{"doi-asserted-by":"publisher","unstructured":"Lenstra, A.K.: Unbelievable security matching AES security using public key systems. In: C.\u00a0Boyd (ed.) Advances in Cryptology-ASIACRYPT 2001, pp. 67\u201386. Springer Berlin Heidelberg, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_5","key":"1554_CR18","DOI":"10.1007\/3-540-45682-1_5"},{"doi-asserted-by":"publisher","unstructured":"Factoring polynomials with rational coefficients: Lenstra H, W., Lenstra A, K., Lov\u00e1sz, L. Mathematische Annalen 261, 515\u2013534 (1982). https:\/\/doi.org\/10.1007\/BF01457454.","key":"1554_CR19","DOI":"10.1007\/BF01457454"},{"doi-asserted-by":"publisher","unstructured":"May, A.: Using LLL-reduction for solving RSA and factorization problems, pp. 315\u2013348. Springer, Berlin (2010). https:\/\/doi.org\/10.1007\/978-3-642-02295-1_10","key":"1554_CR20","DOI":"10.1007\/978-3-642-02295-1_10"},{"doi-asserted-by":"publisher","unstructured":"Moriarty, K., Kaliski, B., Jonsson, J., Rusch, A.: RFC 8017: PKCS #1: RSA cryptography specifications version 2.2 (2016). https:\/\/doi.org\/10.17487\/RFC8017","key":"1554_CR21","DOI":"10.17487\/RFC8017"},{"issue":"6","key":"1554_CR22","first-page":"649","volume":"7","author":"S Nalajala","year":"2019","unstructured":"Nalajala S., Ch P., Avutu M., Battu P.M.: Data security using multi prime RSA in cloud. Int. J. Recent Technol. Eng. (IJRTE) 7(6), 649\u2013654 (2019).","journal-title":"Int. J. Recent Technol. Eng. (IJRTE)"},{"doi-asserted-by":"publisher","unstructured":"Ngu\u00ean, P.Q., Stehl\u00e9, D.: Floating-point LLL revisited. In: R.\u00a0Cramer (ed.) Advances in Cryptology-EUROCRYPT 2005, pp. 215\u2013233. Springer, Berlin (2005). https:\/\/doi.org\/10.1007\/11426639_13","key":"1554_CR23","DOI":"10.1007\/11426639_13"},{"key":"1554_CR24","doi-asserted-by":"publisher","first-page":"159","DOI":"10.5753\/sbseg.2005.21521","volume":"2003","author":"CAM Paix\u00e3o","year":"2005","unstructured":"Paix\u00e3o C.A.M.: An efficient variant of the RSA cryptosystem. IACR Cryptol. ePrint Arch. 2003, 159 (2005). https:\/\/doi.org\/10.5753\/sbseg.2005.21521.","journal-title":"IACR Cryptol. ePrint Arch."},{"doi-asserted-by":"publisher","unstructured":"Pathirage, T., Wijewardana, H., Lakshan, L., Hydher, H., Yasakethu, L.: Multi-prime RSA verilog implementation using 4-primes. In: 2021 10th International Conference on Information and Automation for Sustainability (ICIAfS), pp. 60\u201365. IEEE (2021). https:\/\/doi.org\/10.1109\/ICIAfS52090.2021.9605975","key":"1554_CR25","DOI":"10.1109\/ICIAfS52090.2021.9605975"},{"doi-asserted-by":"publisher","unstructured":"R, N.K., Sulaiman, A., Galla, N., Mokkala, P.: An implementation of multi-prime RSA algorithm in data cloud using cloud SQL. In: National Conference on Data Mining and Its Applications, 2014. Proceedings. (NCDMA-2014)., vol.\u00a02, pp. 225\u2013227. IJERT (2014). https:\/\/doi.org\/10.13140\/2.1.3950.6888","key":"1554_CR26","DOI":"10.13140\/2.1.3950.6888"},{"issue":"2","key":"1554_CR27","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest R.L., Shamir A., Adleman L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978). https:\/\/doi.org\/10.1145\/359340.359342.","journal-title":"Commun. ACM"},{"doi-asserted-by":"publisher","unstructured":"Ryan, K., He, K., Sullivan, G.A., Heninger, N.: Passive SSH key compromise via lattices. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 2886\u20132900. Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3576915.3616629","key":"1554_CR28","DOI":"10.1145\/3576915.3616629"},{"doi-asserted-by":"publisher","unstructured":"Srivenkatesh, M., K., M.V.: Implementing multiprime RSA algorithm to enhance the data security in federated cloud computing. IJARCCE 4(4), 647\u2013650 (2015). https:\/\/doi.org\/10.17148\/ijarcce.2015.44149","key":"1554_CR29","DOI":"10.17148\/ijarcce.2015.44149"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01554-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01554-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01554-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T17:46:52Z","timestamp":1746640012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01554-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,27]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1554"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01554-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,12,27]]},"assertion":[{"value":"16 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declared that they have no conflict of interest to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}