{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:27:55Z","timestamp":1725906475744},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319646466"},{"type":"electronic","value":"9783319646473"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-64647-3_8","type":"book-chapter","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T11:33:27Z","timestamp":1501241607000},"page":"120-137","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Conversion Method from Arithmetic to Boolean Masking in Constrained Devices"],"prefix":"10.1007","author":[{"given":"Yoo-Seung","family":"Won","sequence":"first","affiliation":[]},{"given":"Dong-Guk","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,29]]},"reference":[{"issue":"8","key":"8_CR1","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1109\/TC.1973.5009159","volume":"100","author":"PM Kogge","year":"1973","unstructured":"Kogge, P.M., Stone, H.S.: A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Trans. Comput. 100(8), 786\u2013793 (1973)","journal-title":"IEEE Trans. Comput."},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-44709-1_2","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2001","author":"L Goubin","year":"2001","unstructured":"Goubin, L.: A sound method for switching between Boolean and arithmetic masking. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 3\u201315. Springer, Heidelberg (2001). doi:\n10.1007\/3-540-44709-1_2"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-540-45238-6_8","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"J-S Coron","year":"2003","unstructured":"Coron, J.-S., Tchulkine, A.: A new algorithm for switching from arithmetic to Boolean masking. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol. 2779, pp. 89\u201397. Springer, Heidelberg (2003). doi:\n10.1007\/978-3-540-45238-6_8"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-540-28632-5_17","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"O Nei\u00dfe","year":"2004","unstructured":"Nei\u00dfe, O., Pulkus, J.: Switching blindings with a view towards IDEA. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 230\u2013239. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-28632-5_17"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-71039-4_8","volume-title":"Fast Software Encryption","author":"M Rivain","year":"2008","unstructured":"Rivain, M., Dottax, E., Prouff, E.: Block ciphers implementations provably secure against second order side channel analysis. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 127\u2013143. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-71039-4_8"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-33027-8_7","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"B Debraize","year":"2012","unstructured":"Debraize, B.: Efficient and provably secure methods for switching from arithmetic to Boolean masking. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 107\u2013121. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-33027-8_7"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-41224-0_8","volume-title":"Security, Privacy, and Applied Cryptography Engineering","author":"PK Vadnala","year":"2013","unstructured":"Vadnala, P.K., Gro\u00dfsch\u00e4dl, J.: Algorithms for switching between Boolean and arithmetic masking of second order. In: Gierlichs, B., Guilley, S., Mukhopadhyay, D. (eds.) SPACE 2013. LNCS, vol. 8204, pp. 95\u2013110. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-41224-0_8"},{"key":"8_CR8","unstructured":"Beaulieu, R., Shors, D., Smith, J., Treatman-Clark, S., Weeks, B., Wingers, L.: The SIMON and SPECK families of lightweight block ciphers. Cryptology ePrint Archive, Report 2013\/404 (2013)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-662-44709-3_11","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2014","author":"J-S Coron","year":"2014","unstructured":"Coron, J.-S., Gro\u00dfsch\u00e4dl, J., Vadnala, P.K.: Secure conversion between Boolean and arithmetic masking of any order. In: Batina, L., Robshaw, M. (eds.) CHES 2014. LNCS, vol. 8731, pp. 188\u2013205. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-662-44709-3_11"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-10175-0_4","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"M Karroumi","year":"2014","unstructured":"Karroumi, M., Richard, B., Joye, M.: Addition with blinded operands. In: Prouff, E. (ed.) COSADE 2014. LNCS, vol. 8622, pp. 41\u201355. Springer, Cham (2014). doi:\n10.1007\/978-3-319-10175-0_4"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-319-21476-4_14","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"PK Vadnala","year":"2015","unstructured":"Vadnala, P.K., Gro\u00dfsch\u00e4dl, J.: Faster mask conversion with lookup tables. In: Mangard, S., Poschmann, A.Y. (eds.) COSADE 2014. LNCS, vol. 9064, pp. 207\u2013221. Springer, Cham (2015). doi:\n10.1007\/978-3-319-21476-4_14"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-662-48116-5_7","volume-title":"Fast Software Encryption","author":"J-S Coron","year":"2015","unstructured":"Coron, J.-S., Gro\u00dfsch\u00e4dl, J., Tibouchi, M., Vadnala, P.K.: Conversion from arithmetic to Boolean masking with logarithmic complexity. In: Leander, G. (ed.) FSE 2015. LNCS, vol. 9054, pp. 130\u2013149. Springer, Heidelberg (2015). doi:\n10.1007\/978-3-662-48116-5_7"}],"container-title":["Lecture Notes in Computer Science","Constructive Side-Channel Analysis and Secure Design"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64647-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T11:35:57Z","timestamp":1501241757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64647-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319646466","9783319646473"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64647-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}