{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:15:17Z","timestamp":1758824117521,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,9,5]],"date-time":"2017-09-05T00:00:00Z","timestamp":1504569600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s12095-017-0254-5","type":"journal-article","created":{"date-parts":[[2017,9,5]],"date-time":"2017-09-05T06:54:13Z","timestamp":1504594453000},"page":"17-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Backtracking-assisted multiplication"],"prefix":"10.1007","volume":"10","author":[{"given":"Houda","family":"Ferradi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8719-1724","authenticated-orcid":false,"given":"R\u00e9mi","family":"G\u00e9raud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diana","family":"Maimu\u0163","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,5]]},"reference":[{"key":"254_CR1","doi-asserted-by":"publisher","unstructured":"Avi\u017eienis, A.: Signed-digit number representations for fast parallel arithmetic. IRE Trans. Electron. Comput. EC-10(3):389\u2013400. https:\/\/doi.org\/10.1109\/TEC.1961.5219227 (1961)","DOI":"10.1109\/TEC.1961.5219227"},{"key":"254_CR2","doi-asserted-by":"crossref","unstructured":"Barrett, P.: Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A M (ed.) Advances in Cryptology\u2014CRYPTO\u201986, volume 263 of Lecture Notes in Computer Science, Santa Barbara, CA, USA, August 1987, pp 311\u2013323. Springer, Heidelberg (1987)","DOI":"10.1007\/3-540-47721-7_24"},{"issue":"7","key":"254_CR3","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1002\/spe.4380160704","volume":"16","author":"R Bernstein","year":"1986","unstructured":"Bernstein, R.: Multiplication by integer constants. Softw. Pract. Exp. 16(7), 641\u2013652 (1986)","journal-title":"Softw. Pract. Exp."},{"issue":"5","key":"254_CR4","doi-asserted-by":"crossref","first-page":"1037","DOI":"10.1109\/TASSP.1984.1164433","volume":"32","author":"PR Cappello","year":"1984","unstructured":"Cappello, P.R., Steiglitz, K.: Some complexity issues in digital signal processing. IEEE Trans. Acoust. Speech Signal Process. 32(5), 1037\u20131041 (1984)","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"254_CR5","unstructured":"Certivox. The MIRACL big number library. See https:\/\/www.certivox.com\/miracl"},{"key":"254_CR6","unstructured":"Cook, S.A.: On the minimum computation time of functions. PhD thesis (1966)"},{"issue":"5","key":"254_CR7","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1049\/ip-cds:19941191","volume":"141","author":"AG Dempster","year":"1994","unstructured":"Dempster, A.G., Macleod, M.D.: Constant integer multiplication using minimum adders. IEE Proc.\u2014Circ. Dev. Syst. 141(5), 407\u2013413 (1994)","journal-title":"IEE Proc.\u2014Circ. Dev. Syst."},{"key":"254_CR8","doi-asserted-by":"publisher","unstructured":"Dempster, A.G., Macleod, M.D.: Use of Multiplier Blocks to Reduce Filter Complexity. In: 1994 IEEE International Symposium on Circuits and Systems, ISCAS, 1994, pp. 263-266. London, England (1994). https:\/\/doi.org\/10.1109\/ISCAS.1994.409247","DOI":"10.1109\/ISCAS.1994.409247"},{"issue":"6","key":"254_CR9","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"254_CR10","doi-asserted-by":"crossref","unstructured":"ElGamal, T.: On computing logarithms over finite fields. In: Williams, H.C. (ed.) Advances in Cryptology\u2014CRYPTO\u201985, volume 218 of Lecture Notes in Computer Science, Santa Barbara, CA, USA, August 18\u201322, 1986, pp 396\u2013402. Springer, Heidelberg (1986)","DOI":"10.1007\/3-540-39799-X_28"},{"key":"254_CR11","doi-asserted-by":"crossref","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero knowledge proofs of identity. In: Aho, A. (ed.) 19th Annual ACM Symposium on Theory of Computing, pp. 210\u2013217, New York City, NY, USA, May 25\u201327, 1987. ACM Press (1987)","DOI":"10.1145\/28395.28419"},{"issue":"2","key":"254_CR12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U Feige","year":"1988","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. J. Cryptol. 1(2), 77\u201394 (1988)","journal-title":"J. Cryptol."},{"issue":"3","key":"254_CR13","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1137\/070711761","volume":"39","author":"M F\u00fcrer","year":"2009","unstructured":"F\u00fcrer, M.: Faster integer multiplication. SIAM J. Comput. 39(3), 979\u20131005 (2009)","journal-title":"SIAM J. Comput."},{"key":"254_CR14","doi-asserted-by":"crossref","unstructured":"Harvey, D., Van Der Hoeven, J., Lecerf, G.: Even faster integer multiplication. arXiv preprint arXiv: 1407.3360 (2014)","DOI":"10.1145\/2608628.2608657"},{"key":"254_CR15","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of many-digital numbers by automatic computers. Doklady Akad. Nauk SSSR 145, 293\u2013294 (1962)"},{"key":"254_CR16","unstructured":"Knuth, D.: The Art of Computer Programming (1968)"},{"issue":"170","key":"254_CR17","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985)","journal-title":"Math. Comput."},{"issue":"3\u20134","key":"254_CR18","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle Multiplikation grosser Zahlen. Computing 7(3\u20134), 281\u2013292 (1971)","journal-title":"Computing"},{"key":"254_CR19","first-page":"714","volume":"3","author":"AL Toom","year":"1963","unstructured":"Toom, A.L.: The complexity of a scheme of functional elements realizing the multiplication of integers. Soviet Math. Dokl. 3, 714\u2013716 (1963)","journal-title":"Soviet Math. Dokl."},{"issue":"8","key":"254_CR20","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1109\/12.795126","volume":"48","author":"H Wu","year":"1999","unstructured":"Wu, H., Hasan, M.A.: Closed-form expression for the average weight of signed-digit representations. IEEE Trans. Comput. 48(8), 848\u2013851 (1999)","journal-title":"IEEE Trans. Comput."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-017-0254-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0254-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0254-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T05:30:35Z","timestamp":1659418235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-017-0254-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,5]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["254"],"URL":"https:\/\/doi.org\/10.1007\/s12095-017-0254-5","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2017,9,5]]}}}