{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:53:42Z","timestamp":1742932422571,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":65,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662493007"},{"type":"electronic","value":"9783662493014"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49301-4_20","type":"book-chapter","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T11:15:43Z","timestamp":1458299743000},"page":"315-341","source":"Crossref","is-referenced-by-count":4,"title":["Polynomial Evaluation and Side Channel Analysis"],"prefix":"10.1007","author":[{"given":"Claude","family":"Carlet","sequence":"first","affiliation":[]},{"given":"Emmanuel","family":"Prouff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,18]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-39887-5_15","volume-title":"Fast Software Encryption","author":"M-L Akkar","year":"2003","unstructured":"Akkar, M.-L., Goubin, L.: A generic protection against high-order differential power analysis. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 192\u2013205. Springer, Heidelberg (2003)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/978-3-642-34961-4_45","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"J Balasch","year":"2012","unstructured":"Balasch, J., Faust, S., Gierlichs, B., Verbauwhede, I.: Theory and practice of a leakage resilient masking scheme. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 758\u2013775. Springer, Heidelberg (2012)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BFb0052242","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"M Bellare","year":"1997","unstructured":"Bellare, M., Goldwasser, S., Micciancio, D.: \u201cPseudo-random\u201d number generation within cryptographic algorithms: the DSS case. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 277\u2013291. Springer, Heidelberg (1997)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation. In: STOC 1988: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 1\u201310. ACM, New York (1988)","DOI":"10.1145\/62212.62213"},{"key":"20_CR5","unstructured":"Blakely, G.: Safeguarding cryptographic keys. In: National Computer Conference, vol. 48, pp. 313\u2013317. AFIPS Press, New York, June 1979"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Knudsen, L.R., Leander, G., Paar, C., Poschmann, A., Robshaw, M.J.B., Seurin, Y., Vikkelsoe, C.: PRESENT: an ultra-lightweight block cipher. In: Paillier and Verbauwhede [48], pp. 450\u2013466","DOI":"10.1007\/978-3-540-74735-2_31"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1090\/S0002-9904-1939-07068-7","volume":"45","author":"A Brauer","year":"1939","unstructured":"Brauer, A.: On addtion chains. Bull. Amer. MAth. Soc. 45, 736\u2013739 (1939)","journal-title":"Bull. Amer. MAth. Soc."},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-28632-5_2","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"E Brier","year":"2004","unstructured":"Brier, E., Clavier, C., Olivier, F.: Correlation power analysis with a leakage model. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 16\u201329. Springer, Heidelberg (2004)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-34047-5_21","volume-title":"Fast Software Encryption","author":"C Carlet","year":"2012","unstructured":"Carlet, C., Goubin, L., Prouff, E., Quisquater, M., Rivain, M.: Higher-order masking schemes for s-boxes. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 366\u2013384. Springer, Heidelberg (2012)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/978-3-662-47989-6_36","volume-title":"Advances in Cryptology\u2013CRYPTO 2015","author":"C Carlet","year":"2015","unstructured":"Carlet, C., Prouff, E., Rivain, M., Roche, T.: Algebraic decomposition for probing security. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, pp. 742\u2013763. Springer, Heidelberg (2015)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/3-540-48405-1_26","volume-title":"Advances in Cryptology - CRYPTO 1999","author":"S Chari","year":"1999","unstructured":"Chari, S., Jutla, C.S., Rao, J.R., Rohatgi, P.: Towards sound approaches to counteract power-analysis attacks. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, p. 398. Springer, Heidelberg (1999)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-72540-4_17","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"H Chen","year":"2007","unstructured":"Chen, H., Cramer, R., Goldwasser, S., de Haan, R., Vaikuntanathan, V.: Secure computation from random error correcting codes. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 291\u2013310. Springer, Heidelberg (2007)"},{"key":"20_CR13","unstructured":"Cook, S.A.: On the minimum computation time of functions. Ph.D. thesis, Harvard University, Cambridge, MA, USA (1966). \n                      http:\/\/cr.yp.to\/bib\/entries.html#1966\/cook"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/978-3-662-43933-3_21","volume-title":"Fast Software Encryption","author":"J-S Coron","year":"2014","unstructured":"Coron, J.-S., Prouff, E., Rivain, M., Roche, T.: Higher-order side channel security and mask refreshing. In: Moriai, S. (ed.) FSE 2013. LNCS, vol. 8424, pp. 410\u2013424. Springer, Heidelberg (2014)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-662-44709-3_10","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2014","author":"J-S Coron","year":"2014","unstructured":"Coron, J.-S., Roy, A., Vivek, S.: Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures. In: Batina, L., Robshaw, M. (eds.) CHES 2014. LNCS, vol. 8731, pp. 170\u2013187. Springer, Heidelberg (2014)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-85855-3_19","volume-title":"Security and Cryptography for Networks","author":"J-S Coron","year":"2008","unstructured":"Coron, J.-S.: A new DPA countermeasure based on permutation tables. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 278\u2013292. Springer, Heidelberg (2008)"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-55220-5_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"J-S Coron","year":"2014","unstructured":"Coron, J.-S.: Higher order masking of look-up tables. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 441\u2013458. Springer, Heidelberg (2014)"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-29912-4_6","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"J-S Coron","year":"2012","unstructured":"Coron, J.-S., Giraud, C., Prouff, E., Renner, S., Rivain, M., Vadnala, P.K.: Conversion of security proofs from one leakage model to another: a new issue. In: Schindler, W., Huss, S.A. (eds.) COSADE 2012. LNCS, vol. 7275, pp. 69\u201381. Springer, Heidelberg (2012)"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-540-31815-6_33","volume-title":"Information Security Applications","author":"HS Yoo","year":"2005","unstructured":"Yoo, H.S., Kim, C.K., Ha, J.C., Moon, S.-J., Park, I.H.: Side channel cryptanalysis on SEED. In: Lim, C.H., Yung, M. (eds.) WISA 2004. LNCS, vol. 3325, pp. 411\u2013424. Springer, Heidelberg (2005)"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-37288-9_6","volume-title":"Smart Card Research and Advanced Applications","author":"J-S Coron","year":"2013","unstructured":"Coron, J.-S., Prouff, E., Roche, T.: On the use of shamir\u2019s secret sharing against side-channel analysis. In: Mangard, S. (ed.) CARDIS 2012. LNCS, vol. 7771, pp. 77\u201390. Springer, Heidelberg (2013)"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/11734727_18","volume-title":"Information Security and Cryptology - ICISC 2005","author":"NT Courtois","year":"2006","unstructured":"Courtois, N.T., Goubin, L.: An algebraic masking method to protect AES against power attacks. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol. 3935, pp. 199\u2013209. Springer, Heidelberg (2006)"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-85174-5_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"I Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M., Nielsen, J.B., Smith, A.: Scalable multiparty computation with nearly optimal work and resilience. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 241\u2013261. Springer, Heidelberg (2008)"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-55220-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Duc","year":"2014","unstructured":"Duc, A., Dziembowski, S., Faust, S.: Unifying leakage models: from probing attacks to noisy leakage. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 423\u2013440. Springer, Heidelberg (2014)"},{"issue":"1","key":"20_CR24","first-page":"17","volume":"6","author":"J Eve","year":"1964","unstructured":"Eve, J.: The evaluation of polynomials. Comm. ACM 6(1), 17\u201321 (1964)","journal-title":"Comm. ACM"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-13190-5_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S Faust","year":"2010","unstructured":"Faust, S., Rabin, T., Reyzin, L., Tromer, E., Vaikuntanathan, V.: Protecting circuits from leakage: the computationally-bounded and noisy cases. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 135\u2013156. Springer, Heidelberg (2010)"},{"key":"20_CR26","first-page":"699","volume-title":"STOC","author":"MK Franklin","year":"1992","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: Kosaraju, S.R., Fellows, M., Wigderson, A., Ellis, J.A. (eds.) STOC, pp. 699\u2013710. ACM, New York (1992)"},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-23951-9_16","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"L Genelle","year":"2011","unstructured":"Genelle, L., Prouff, E., Quisquater, M.: Thwarting higher-order side channel analysis with additive and multiplicative maskings. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 240\u2013255. Springer, Heidelberg (2011)"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified vss and fact-track multiparty computations with applications to threshold cryptography. In: PODC, pp. 101\u2013111 (1998)","DOI":"10.1145\/277697.277716"},{"key":"20_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-23951-9_6","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"L Goubin","year":"2011","unstructured":"Goubin, L., Martinelli, A.: Protecting AES with shamir\u2019s secret sharing scheme. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 79\u201394. Springer, Heidelberg (2011)"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-06734-6_16","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2014","author":"V Grosso","year":"2014","unstructured":"Grosso, V., Prouff, E., Standaert, F.-X.: Efficient masked s-boxes processing \u2013 a step forward \u2013. In: Pointcheval, D., Vergnaud, D. (eds.) AFRICACRYPT. LNCS, vol. 8469, pp. 251\u2013266. Springer, Heidelberg (2014)"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-40349-1_23","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"V Grosso","year":"2013","unstructured":"Grosso, V., Standaert, F.-X., Faust, S.: Masking vs. multiparty computation: how large is the gap for AES? In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol. 8086, pp. 400\u2013416. Springer, Heidelberg (2013)"},{"issue":"1","key":"20_CR32","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s13389-014-0073-y","volume":"4","author":"V Grosso","year":"2014","unstructured":"Grosso, V., Standaert, F.-X., Faust, S.: Masking vs. multiparty computation: how large is the gap for aes? J. Cryptographic Eng. 4(1), 47\u201357 (2014)","journal-title":"J. Cryptographic Eng."},{"key":"20_CR33","first-page":"213","volume-title":"Embedded Cryptographic Hardware: Methodologies and Architectures","author":"S Gueron","year":"2004","unstructured":"Gueron, S., Parzanchevsky, O., Zuk, O.: Masked inversion in GF(\n                      \n                        \n                      \n                      $$2^{n}$$\n                    ) usingmixed field representations and its efficient implementation for AES. In: Nedjah, N., Mourelle, L.M. (eds.) Embedded Cryptographic Hardware: Methodologies and Architectures, pp. 213\u2013228. Nova Science Publishers, New York (2004)"},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-45146-4_27","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: securing hardware against probing attacks. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 463\u2013481. Springer, Heidelberg (2003)"},{"key":"20_CR35","first-page":"595","volume":"7","author":"A Karatsuba","year":"1963","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of many-digital numbers by automatic computers. Transl. Acad. J. Phys. Dokl. 7, 595\u2013596 (1963). Proceedings of the USSR Academy of Sciences, 145, pp. 293\u2013294 (1962)","journal-title":"Transl. Acad. J. Phys. Dokl."},{"key":"20_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-23951-9_7","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"HS Kim","year":"2011","unstructured":"Kim, H.S., Hong, S., Lim, J.: A fast and provably secure higher-order masking of AES S-Box. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 95\u2013107. Springer, Heidelberg (2011)"},{"key":"20_CR37","volume-title":"The Art of Computer Programming","author":"D Knuth","year":"1988","unstructured":"Knuth, D.: The Art of Computer Programming, vol. 2, 3rd edn. Addison Wesley, USA (1988)","edition":"3"},{"issue":"12","key":"20_CR38","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/355580.369074","volume":"5","author":"DE Knuth","year":"1962","unstructured":"Knuth, D.E.: Evaluation of polynomials by computers. Comm. ACM 5(12), 137\u2013138 (1962)","journal-title":"Comm. ACM"},{"key":"20_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology - CRYPTO 1999","author":"PC Kocher","year":"1999","unstructured":"Kocher, P.C., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, p. 388. Springer, Heidelberg (1999)"},{"key":"20_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-30574-3_24","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"S Mangard","year":"2005","unstructured":"Mangard, S., Popp, T., Gammel, B.M.: Side-channel leakage of masked CMOS gates. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 351\u2013365. Springer, Heidelberg (2005)"},{"key":"20_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/11545262_12","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"S Mangard","year":"2005","unstructured":"Mangard, S., Pramstaller, N., Oswald, E.: Successfully attacking masked AES hardware implementations. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 157\u2013171. Springer, Heidelberg (2005)"},{"key":"20_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/11894063_7","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"S Mangard","year":"2006","unstructured":"Mangard, S., Schramm, K.: Pinpointing the side-channel leakage of masked AES hardware implementations. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 76\u201390. Springer, Heidelberg (2006)"},{"key":"20_CR43","unstructured":"Massey, J.: Minimal codewords and secret sharings. In: Sixth Joint Sweedish-Russian Workshop on Information Theory, pp. 246\u2013249 (1993)"},{"key":"20_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-44499-8_19","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2000","author":"TS Messerges","year":"2000","unstructured":"Messerges, T.S.: Using second-order power analysis to attack DPA resistant software. In: Paar, C., Ko\u00e7, \u00c7.K. (eds.) CHES 2000. LNCS, vol. 1965, pp. 238\u2013251. Springer, Heidelberg (2000)"},{"key":"20_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-33027-8_6","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"A Moradi","year":"2012","unstructured":"Moradi, A., Mischke, O.: How far should theory be from practice? In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 92\u2013106. Springer, Heidelberg (2012)"},{"key":"20_CR46","unstructured":"Omura, J., Massey, J.: Computational method and apparatus for finite fieldarithmetic. Technical report, Omnet Associates. Patent Number 4,587,627, May 1986"},{"issue":"1","key":"20_CR47","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/0202007","volume":"2","author":"M Paterson","year":"1973","unstructured":"Paterson, M., Stockmeyer, L.J.: On the number of nonscalar multiplications necessary to evaluate polynomials. SIAM J. Comput. 2(1), 60\u201366 (1973)","journal-title":"SIAM J. Comput."},{"key":"20_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-04138-9_7","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2009","author":"E Prouff","year":"2009","unstructured":"Prouff, E., McEvoy, R.: First-order side-channel attacks on the permutation tables countermeasure. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 81\u201396. Springer, Heidelberg (2009)"},{"key":"20_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-38348-9_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"E Prouff","year":"2013","unstructured":"Prouff, E., Rivain, M.: Masking against side-channel attacks: a formal security proof. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 142\u2013159. Springer, Heidelberg (2013)"},{"key":"20_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-04852-9_9","volume-title":"Topics in Cryptology \u2013 CT-RSA 2014","author":"E Prouff","year":"2014","unstructured":"Prouff, E., Rivain, M., Roche, T.: On the practical security of a leakage resilient masking scheme. In: Benaloh, J. (ed.) CT-RSA 2014. LNCS, vol. 8366, pp. 169\u2013182. Springer, Heidelberg (2014)"},{"key":"20_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-17401-8_19","volume-title":"Progress in Cryptology - INDOCRYPT 2010","author":"E Prouff","year":"2010","unstructured":"Prouff, E., Roche, T.: Attack on a higher-order masking of the aes based on homographic functions. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol. 6498, pp. 262\u2013281. Springer, Heidelberg (2010)"},{"key":"20_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-642-23951-9_5","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"E Prouff","year":"2011","unstructured":"Prouff, E., Roche, T.: Higher-order glitches free implementation of the AES using secure multi-party computation protocols. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 63\u201378. Springer, Heidelberg (2011)"},{"key":"20_CR53","unstructured":"Renner, S.: Protection des Algorithmes Cryptographiques Embarqu\u00e9s. Ph.D. thesis, University of Bordeaux (2014). \n                      http:\/\/www.math.u-bordeaux1.fr\/~srenner\/Thesis_Soline_Renner.pdf"},{"key":"20_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-15031-9_28","volume-title":"Cryptographic Hardware and Embedded Systems, CHES 2010","author":"M Rivain","year":"2010","unstructured":"Rivain, M., Prouff, E.: Provably Secure higher-order masking of AES. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 413\u2013427. Springer, Heidelberg (2010)"},{"issue":"2","key":"20_CR55","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s13389-012-0033-3","volume":"2","author":"T Roche","year":"2012","unstructured":"Roche, T., Prouff, E.: Higher-order glitch free implementation of the AES using secure multi-party computation protocols - extended version. J. Cryptographic Eng. 2(2), 111\u2013127 (2012)","journal-title":"J. Cryptographic Eng."},{"key":"20_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-642-40349-1_24","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"J-S Coron","year":"2013","unstructured":"Coron, J.-S., Kizhvatov, I., Roy, A., Vivek, S.: Analysis and improvement of the generic higher-order masking scheme of FSE 2012. In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol. 8086, pp. 417\u2013434. Springer, Heidelberg (2013)"},{"key":"20_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-44709-1_16","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"A Rudra","year":"2001","unstructured":"Rudra, A., Dubey, P.K., Jutla, C.S., Kumar, V., Rao, J.R., Rohatgi, P.: Efficient rijndael encryption implementation with composite field arithmetic. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 171\u2013184. Springer, Heidelberg (2001)"},{"key":"20_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/11605805_14","volume-title":"Topics in Cryptology \u2013 CT-RSA 2006","author":"K Schramm","year":"2006","unstructured":"Schramm, K., Paar, C.: Higher order masking of the AES. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol. 3860, pp. 208\u2013225. Springer, Heidelberg (2006)"},{"issue":"11","key":"20_CR59","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"20_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-74619-5_12","volume-title":"Fast Software Encryption","author":"T Shirai","year":"2007","unstructured":"Shirai, T., Shibutani, K., Akishita, T., Moriai, S., Iwata, T.: The 128-bit blockcipher CLEFIA (Extended Abstract). In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 181\u2013195. Springer, Heidelberg (2007)"},{"issue":"1","key":"20_CR61","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/12.902754","volume":"50","author":"B Sunar","year":"2001","unstructured":"Sunar, B., Ko\u00e7, C.K.: An efficient optimal normal basis type II multiplier. IEEE Trans. Comput. 50(1), 83\u201387 (2001)","journal-title":"IEEE Trans. Comput."},{"key":"20_CR62","unstructured":"Toom, A.L.: The complexity of a scheme of functional elements realizing the multiplication of integers. Sov. Math. Dokl., 3, 714\u2013716 (1963). \n                      http:\/\/www.de.ufpe.br\/toom\/articles\/engmat\/MULT-E.PDF"},{"key":"20_CR63","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/BF01212964","volume":"1","author":"J Gathen von zur","year":"1991","unstructured":"von zur Gathen, J.: Efficient and optimal exponentiation in finite fields. Comput. Complex. 1, 360\u2013394 (1991)","journal-title":"Comput. Complex."},{"key":"20_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-73074-3_6","volume-title":"Arithmetic of Finite Fields","author":"J zur Gathen von","year":"2007","unstructured":"von zur Gathen, J., Shokrollahi, M.A., Shokrollahi, J.: Efficient multiplication using type 2 optimal normal bases. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 55\u201368. Springer, Heidelberg (2007)"},{"issue":"3","key":"20_CR65","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1109\/49.1926","volume":"6","author":"Y Wang","year":"1988","unstructured":"Wang, Y., Zhu, X.: A fast algorithm for the Fourier transform over finite fields and its VLSI implementation. IEEE J. Sel. Areas Commun. 6(3), 572\u2013577 (1988)","journal-title":"IEEE J. Sel. Areas Commun."}],"container-title":["Lecture Notes in Computer Science","The New Codebreakers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49301-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:29:53Z","timestamp":1559402993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49301-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662493007","9783662493014"],"references-count":65,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49301-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}