{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T18:23:24Z","timestamp":1740162204720,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T00:00:00Z","timestamp":1555459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T00:00:00Z","timestamp":1555459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s13389-019-00210-w","type":"journal-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T16:10:26Z","timestamp":1555517426000},"page":"197-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Polynomial multiplication over binary finite fields: new upper bounds"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6399-3164","authenticated-orcid":false,"given":"Alessandro","family":"De Piccoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5689-8575","authenticated-orcid":false,"given":"Andrea","family":"Visconti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ottavio Giulio","family":"Rizzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,17]]},"reference":[{"issue":"6","key":"210_CR1","doi-asserted-by":"publisher","first-page":"1734","DOI":"10.1109\/TC.2015.2456023","volume":"65","author":"EAH Abdulrahman","year":"2016","unstructured":"Abdulrahman, E.A.H., Reyhani-Masoleh, A.: High-speed hybrid-double multiplication architectures using new serial-out bit-level mastrovito multipliers. IEEE Trans. Comput. 65(6), 1734\u20131747 (2016)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"210_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02620228","volume":"6","author":"GB Agnew","year":"1993","unstructured":"Agnew, G.B., Beth, T., Mullin, R.C., Vanstone, S.A.: Arithmetic operations in $$GF(2^m)$$. J. Cryptol. 6(1), 3\u201313 (1993)","journal-title":"J. Cryptol."},{"key":"210_CR3","volume-title":"Algebraic Coding Theory","author":"ER Berlekamp","year":"1968","unstructured":"Berlekamp, E.R.: Algebraic Coding Theory, vol. 111. McGraw-Hill, New York (1968)"},{"key":"210_CR4","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: Curve25519: new diffie-hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) Public Key Cryptography\u2014PKC 2006: 9th International Conference on Theory and Practice in Public-Key Cryptography, New York, NY, USA, April 24\u201326, 2006. Proceedings, pp. 207\u2013228. Springer Berlin Heidelberg, Berlin, Heidelberg (2006)","DOI":"10.1007\/11745853_14"},{"key":"210_CR5","unstructured":"Bernstein, D.J.: Batch binary edwards. In: Halevi, S. (ed.) Advances in Cryptology\u2014CRYPTO 2009: 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16\u201320, 2009. Proceedings, pp. 317\u2013336. Springer Berlin Heidelberg, Berlin, Heidelberg (2009)"},{"key":"210_CR6","unstructured":"Bernstein, D.J.: High-speed cryptography in characteristic 2: minimum number of bit operations for multiplication (2009). http:\/\/binary.cr.yp.to\/m.html"},{"issue":"2","key":"210_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s13389-012-0027-1","volume":"2","author":"DJ Bernstein","year":"2012","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.Y.: High-speed high-security signatures. J. Cryptogr. Eng. 2(2), 77\u201389 (2012)","journal-title":"J. Cryptogr. Eng."},{"key":"210_CR8","volume-title":"Theory and Practice of Error Control Codes","author":"RE Blahut","year":"1983","unstructured":"Blahut, R.E.: Theory and Practice of Error Control Codes, vol. 126. Addison-Wesley, Reading (1983)"},{"key":"210_CR9","volume-title":"Fast Algorithms for Digital Signal Processing","author":"RE Blahut","year":"1985","unstructured":"Blahut, R.E.: Fast Algorithms for Digital Signal Processing. Addison-Wesley Longman Publishing Co., Inc., Reading (1985)"},{"key":"210_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107360211","volume-title":"Elliptic Curves in Cryptography","author":"I Blake","year":"1999","unstructured":"Blake, I., Seroussi, G., Smart, N.: Elliptic Curves in Cryptography, vol. 265. Cambridge University Press, Cambridge (1999)"},{"key":"210_CR11","unstructured":"Boyar, J., Peralta, R.: A new combinational logic minimization technique with applications to cryptology. In: Festa, P. (ed.) Experimental Algorithms: 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20\u201322, 2010. Proceedings, pp. 178\u2013189. Springer Berlin Heidelberg, Berlin, Heidelberg (2010)"},{"issue":"4","key":"210_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s13389-015-0101-6","volume":"5","author":"M Cenk","year":"2015","unstructured":"Cenk, M., Hasan, M.A.: Some new results on binary polynomial multiplication. J. Cryptogr. Eng. 5(4), 289\u2013303 (2015)","journal-title":"J. Cryptogr. Eng."},{"key":"210_CR13","doi-asserted-by":"crossref","unstructured":"Cenk, M., Negre, C., Hasan, M.A.: Improved three-way split formulas for binary polynomial multiplication. In: Selected Areas in cryptography, pp. 384\u2013398. Springer (2011)","DOI":"10.1007\/978-3-642-28496-0_23"},{"issue":"7","key":"210_CR14","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1109\/TC.2012.96","volume":"62","author":"M Cenk","year":"2013","unstructured":"Cenk, M., Negre, C., Hasan, M.A.: Improved three-way split formulas for binary polynomial and toeplitz matrix vector products. IEEE Trans. Comput. 62(7), 1345\u20131361 (2013)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"210_CR15","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/TC.2011.227","volume":"62","author":"D Chakraborty","year":"2013","unstructured":"Chakraborty, D., Mancillas-L\u00f3pez, C., Rodriguez-Henriquez, F., Sarkar, P.: Efficient hardware implementations of brw polynomials and tweakable enciphering schemes. IEEE Trans. Comput. 62(2), 279\u2013294 (2013)","journal-title":"IEEE Trans. Comput."},{"key":"210_CR16","doi-asserted-by":"crossref","unstructured":"Chang, N.S., Kim, C.H., Park, Y.H., Lim, J.: A non-redundant and efficient architecture for Karatsuba-Ofman algorithm. In: Information Security, 8th International Conference, ISC 2005, Singapore, pp. 288\u2013299, Springer (2005)","DOI":"10.1007\/11556992_21"},{"key":"210_CR17","unstructured":"Chou, T.: Accelerating pre-and post-quantum cryptography. Ph.D. thesis, Technische Universiteit Eindhoven (2016)"},{"key":"210_CR18","unstructured":"CMT: Circuit minimization work. http:\/\/www.cs.yale.edu\/homes\/peralta\/CircuitStuff\/CMT.html"},{"key":"210_CR19","unstructured":"Cook, S.A.: On the minimum computation time of functions. Ph.D. thesis, Harvard University (1966)"},{"key":"210_CR20","unstructured":"D\u2019angella, D., Schiavo, C.V., Visconti, A.: Tight upper bounds for polynomial multiplication. In: Applied Computing Conference, 2013. ACC\u201913. WEAS. pp. 31\u201337. WEAS (2013)"},{"issue":"1","key":"210_CR21","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1049\/iet-ifs.2009.0039","volume":"4","author":"H Fan","year":"2010","unstructured":"Fan, H., Sun, J., Gu, M., Lam, K.Y.: Overlap-free Karatsuba-Ofman polynomial multiplication algorithms. IET Inf. Secur. 4(1), 8\u201314 (2010)","journal-title":"IET Inf. Secur."},{"issue":"4","key":"210_CR22","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1109\/TC.2018.2874662","volume":"68","author":"MG Find","year":"2019","unstructured":"Find, M.G., Peralta, R.: Better circuits for binary polynomial multiplication. IEEE Trans. Comput. 68(4), 624\u2013630 (2019)","journal-title":"IEEE Trans. Comput."},{"key":"210_CR23","unstructured":"von\u00a0zur Gathen, J., Shokrollahi, J.: Fast arithmetic for polynomials over $$F_2$$ in hardware. In: Information Theory Workshop, 2006. ITW\u201906 Punta del Este. IEEE. pp. 107\u2013111. IEEE (2006)"},{"issue":"10","key":"210_CR24","doi-asserted-by":"publisher","first-page":"2604","DOI":"10.1109\/TC.2013.131","volume":"63","author":"N Homma","year":"2014","unstructured":"Homma, N., Saito, K., Aoki, T.: Toward formal design of practical cryptographic hardware based on galois field arithmetic. IEEE Trans. Comput. 63(10), 2604\u20132613 (2014)","journal-title":"IEEE Trans. Comput."},{"key":"210_CR25","unstructured":"Imana, J.L.: Fast bit-parallel binary multipliers based on type-i pentanomials. IEEE Trans. Comput. PP(99), 1\u20131 (2017)"},{"key":"210_CR26","first-page":"595","volume":"7","author":"A Karatsuba","year":"1963","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. Soviet Phys. Doklady 7, 595\u2013596 (1963)","journal-title":"Soviet Phys. Doklady"},{"issue":"9","key":"210_CR27","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1109\/TC.2017.2677913","volume":"66","author":"Y Li","year":"2017","unstructured":"Li, Y., Ma, X., Zhang, Y., Qi, C.: Mastrovito form of non-recursive Karatsuba multiplier for all trinomials. IEEE Trans. Comput. 66(9), 1573\u20131584 (2017)","journal-title":"IEEE Trans. Comput."},{"key":"210_CR28","volume-title":"Number Theory in Digital Signal Processing","author":"JH McClellen","year":"1979","unstructured":"McClellen, J.H., Rader, C.M.: Number Theory in Digital Signal Processing. Prentice Hall Professional Technical Reference, Englewood Cliffs (1979)"},{"key":"210_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1983-2","volume-title":"Finite Fields for Computer Scientists and Engineers","author":"RJ McEliece","year":"1987","unstructured":"McEliece, R.J.: Finite Fields for Computer Scientists and Engineers, vol. 23. Kluwer Academic Publishers Boston, Boston (1987)"},{"key":"210_CR30","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"1997","unstructured":"Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)"},{"key":"210_CR31","unstructured":"Orellana, R.: Course notes in discrete mathematics in computer science. https:\/\/math.dartmouth.edu\/archive\/m19w03\/public_html\/book.html"},{"key":"210_CR32","unstructured":"Paar, C.: Optimized arithmetic for Reed-Solomon encoders. In: Proceedings of IEEE International Symposium on Information Theory, p. 250 (1997)"},{"key":"210_CR33","unstructured":"Peter, S., Langendorfer, P.: An efficient polynomial multiplier in $$GF(2^m)$$ and its application to ECC designs. In: Design, Automation & Test in Europe Conference & Exhibition, 2007. DATE\u201907. pp. 1\u20136. IEEE (2007)"},{"key":"210_CR34","unstructured":"Rodr\u0131guez-Henr\u0131quez, F., Ko\u00e7, \u00c7.: On fully parallel Karatsuba multipliers for $$GF(2^m)$$. In: International Conference on Computer Science and Technology (CST 2003), Cancun, Mexico, pp. 405\u2013410 (2003)"},{"key":"210_CR35","volume-title":"An Introduction to the Theory of Groups","author":"JJ Rotman","year":"2012","unstructured":"Rotman, J.J.: An Introduction to the Theory of Groups, vol. 148. Springer, New York (2012)"},{"issue":"3\u20134","key":"210_CR36","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"DDA Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, D.D.A., Strassen, V.: Schnelle Multiplikation grosser Zahlen. Computing 7(3\u20134), 281\u2013292 (1971)","journal-title":"Computing"},{"key":"210_CR37","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. Doklady 3, 714\u2013716 (1963)","journal-title":"Soviet Math. Doklady"},{"key":"210_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2018.04.010","volume":"137","author":"A Visconti","year":"2018","unstructured":"Visconti, A., Schiavo, C.V., Peralta, R.: Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2). Inf. Process. Lett. 137, 1\u20135 (2018)","journal-title":"Inf. Process. Lett."}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-019-00210-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-019-00210-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-019-00210-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T04:56:01Z","timestamp":1663304161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-019-00210-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,17]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["210"],"URL":"https:\/\/doi.org\/10.1007\/s13389-019-00210-w","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"type":"print","value":"2190-8508"},{"type":"electronic","value":"2190-8516"}],"subject":[],"published":{"date-parts":[[2019,4,17]]},"assertion":[{"value":"27 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}