乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T04:39:37Z","timestamp":1740112777387,"version":"3.37.3"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1016\/j.ins.2020.05.075","type":"journal-article","created":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T00:42:22Z","timestamp":1591836142000},"page":"54-68","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices"],"prefix":"10.1016","volume":"538","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5043-5550","authenticated-orcid":false,"given":"Majid","family":"Mumtaz","sequence":"first","affiliation":[]},{"given":"Luo","family":"Ping","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ins.2020.05.075_b0005","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public-key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/j.ins.2020.05.075_b0010","doi-asserted-by":"crossref","unstructured":"T. Takagi, Fast rsa-type cryptosystem modulo pkq, vol. 1462, Springer, 1998, pp. 318\u2013326.https:\/\/doi.org\/10.1007\/BFb0055738.","DOI":"10.1007\/BFb0055738"},{"issue":"2","key":"10.1016\/j.ins.2020.05.075_b0015","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s001459900021","article-title":"Batch rsa","volume":"10","author":"Fiat","year":"1997","journal-title":"J. Cryptol."},{"issue":"21","key":"10.1016\/j.ins.2020.05.075_b0020","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1049\/el:19820617","article-title":"Fast decipherment algorithm for rsa public-key cryptosystem","volume":"18","author":"Quisquater","year":"1982","journal-title":"Electron. Lett."},{"issue":"1","key":"10.1016\/j.ins.2020.05.075_b0025","first-page":"1","article-title":"Fast variants of rsa","volume":"5","author":"Boneh","year":"2002","journal-title":"CryptoBytes"},{"key":"10.1016\/j.ins.2020.05.075_b0030","doi-asserted-by":"crossref","unstructured":"K. Balasubramanian, Variants of rsa and their cryptanalysis, in: 2014 International Conference on Communication and Network Technologies, IEEE, 2014, pp. 145\u2013149.","DOI":"10.1109\/CNT.2014.7062742"},{"key":"10.1016\/j.ins.2020.05.075_b0035","first-page":"242","volume":"vol. 2442","author":"May","year":"2002"},{"issue":"3","key":"10.1016\/j.ins.2020.05.075_b0040","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/18.54902","article-title":"Cryptanalysis of short RSA secret exponents","volume":"36","author":"Wiener","year":"1990","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.ins.2020.05.075_b0045","first-page":"82","volume":"vol. 3860","author":"Hinek","year":"2006"},{"issue":"4","key":"10.1016\/j.ins.2020.05.075_b0050","doi-asserted-by":"crossref","first-page":"363","DOI":"10.4064\/aa-58-4-363-385","article-title":"Carmichael\u2019s lambda function","volume":"58","author":"Erdos","year":"1991","journal-title":"Acta Arith"},{"issue":"4","key":"10.1016\/j.ins.2020.05.075_b0055","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1109\/18.850673","article-title":"Cryptanalysis of RSA with private key d less than n0.292","volume":"46","author":"Boneh","year":"2000","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/j.ins.2020.05.075_b0060","doi-asserted-by":"crossref","unstructured":"D. Coppersmith, Finding a small root of a univariate modular equation, vol. 1070, Springer, 1996, pp. 155\u2013165.https:\/\/doi.org\/10.1007\/3-540-68339-9_14.","DOI":"10.1007\/3-540-68339-9_14"},{"key":"10.1016\/j.ins.2020.05.075_b0065","doi-asserted-by":"crossref","unstructured":"N. Howgrave-Graham, Finding small roots of univariate modular equations revisited, vol. 1355, Springer, 1997, pp. 131\u2013142,https:\/\/doi.org\/10.1007\/BFb0024458.","DOI":"10.1007\/BFb0024458"},{"key":"10.1016\/j.ins.2020.05.075_b0070","first-page":"492","volume":"vol. 3027","author":"Coron","year":"2004"},{"key":"10.1016\/j.ins.2020.05.075_b0075","first-page":"379","volume":"vol. 4622","author":"Coron","year":"2007"},{"year":"2009","series-title":"Cryptanalysis of RSA and its variants","author":"Hinek","key":"10.1016\/j.ins.2020.05.075_b0080"},{"key":"10.1016\/j.ins.2020.05.075_b0085","unstructured":"M. Joye, Security analysis of rsa-type cryptosystems (Ph.D. thesis), Citeseer, 1997."},{"key":"10.1016\/j.ins.2020.05.075_b0090","first-page":"267","volume":"Vol. 4284","author":"Jochemsz","year":"2006"},{"issue":"1\u20133","key":"10.1016\/j.ins.2020.05.075_b0095","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s10623-012-9675-5","article-title":"Cryptanalytic results on \u2019dual crt\u2019 and \u2019common prime\u2019 RSA","volume":"66","author":"Sarkar","year":"2013","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.ins.2020.05.075_b0100","doi-asserted-by":"crossref","unstructured":"Y. Lu, R. Zhang, L. Peng, D. Lin, Solving linear equations modulo unknown divisors: Revisited, vol. 9452, Springer, 2015, pp. 189\u2013213.https:\/\/doi.org\/10.1007\/978-3-662-48797-6_9.","DOI":"10.1007\/978-3-662-48797-6_9"},{"issue":"4","key":"10.1016\/j.ins.2020.05.075_b0105","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra","year":"1982","journal-title":"Math. Ann."},{"key":"10.1016\/j.ins.2020.05.075_b0110","doi-asserted-by":"crossref","unstructured":"M. Nemec, M. S\u00fds, P. Svenda, D. Klinec, V. Matyas, The return of coppersmith\u2019s attack: Practical factorization of widely used RSA moduli, ACM, 2017, pp. 1631\u20131648.https:\/\/doi.org\/10.1145\/3133956.3133969.","DOI":"10.1145\/3133956.3133969"},{"key":"10.1016\/j.ins.2020.05.075_b0115","first-page":"455","volume":"vol. 10946","author":"Li","year":"2018"},{"key":"10.1016\/j.ins.2020.05.075_b0120","series-title":"theoretical and practical aspects","first-page":"179","author":"Stehl\u00e9","year":"2010"},{"article-title":"On efficiently calculating small solutions of systems of polynomial equations: lattice-based methods and applications to cryptography","year":"2010","author":"Ritzenhofen","key":"10.1016\/j.ins.2020.05.075_b0125"},{"key":"10.1016\/j.ins.2020.05.075_b0130","first-page":"3","volume":"vol. 10946","author":"Peng","year":"2018"},{"key":"10.1016\/j.ins.2020.05.075_b0135","first-page":"813","volume":"vol. 10946","author":"Lu","year":"2018"},{"key":"10.1016\/j.ins.2020.05.075_b0140","series-title":"Using lll-reduction for solving RSA and factorization problems","first-page":"315","author":"May","year":"2010"},{"key":"10.1016\/j.ins.2020.05.075_b0145","unstructured":"J. McKee, R. Pinch, Further attacks on server-aided rsa cryptosystemsAvailable athttp:\/\/citeseer.ist.psu.edu\/388295.html, 1998."},{"key":"10.1016\/j.ins.2020.05.075_b0150","unstructured":"R. P. Brent, Some integer factorization algorithms using elliptic curves, CoRR abs\/1004.3366,http:\/\/arxiv.org\/abs\/1004.3366. arXiv:1004.3366."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025520305004?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025520305004?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T07:40:00Z","timestamp":1655970000000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025520305004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":30,"alternative-id":["S0020025520305004"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2020.05.075","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[2020,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2020.05.075","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}