{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T03:44:39Z","timestamp":1780544679425,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662456071","type":"print"},{"value":"9783662456088","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45608-8_17","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T10:46:39Z","timestamp":1415961999000},"page":"306-325","source":"Crossref","is-referenced-by-count":25,"title":["Side-Channel Analysis of Multiplications in GF(2128)"],"prefix":"10.1007","author":[{"given":"Sonia","family":"Bela\u00efd","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre-Alain","family":"Fouque","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Beno\u00eet","family":"G\u00e9rard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Rix, A.W., Beerends, J.G., Hollier, M.P., Hekstra, A.P.: Perceptual evaluation of speech quality (PESQ) \u2013 a new method for speech quality assessment of telephone networks and codecs. In: Proceedings ICASSP, pp. 749\u2013752 (2001)","DOI":"10.1109\/ICASSP.2001.941023"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Baign\u00e8res, T., Junod, P., Vaudenay, S.: How Far Can We Go Beyond Linear Cryptanalysis? In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 432\u2013450. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-30539-2_31"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding Random Binary Linear Codes in 2 n \/20: How 1 + 1 = 0 Improves Information Set Decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 520\u2013536. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"17_CR4","unstructured":"Bela\u00efd, S., Grosso, V., Standaert, F.-X.: Masking and leakage-resilient primitives: One, the other(s) or both? Cryptology ePrint Archive, Report 2014\/053 (2014), http:\/\/eprint.iacr.org\/2014\/053"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: Bernstein. Faster binary-field multiplication and faster binary-field macs. In: SAC. LNCS, Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-319-13051-4_6"},{"key":"17_CR6","unstructured":"Bettale, L.: Magma Package: Hybrid Approach for Solving Multivariate Polynomial Systems over Finite Fields, http:\/\/www-polsys.lip6.fr\/~bettale\/hybrid\/"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM\u00a050(4), 506\u2013519 (2003)","DOI":"10.1145\/792538.792543"},{"key":"17_CR8","doi-asserted-by":"crossref","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.\u00a01666, pp. 398\u2013412. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-48405-1_26"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Coron, J.-S.: Higher Order Masking of Look-Up Tables. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol.\u00a08441, pp. 441\u2013458. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-642-55220-5_25"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Information theory. Wiley series in communications. Wiley (1991)","DOI":"10.1002\/0471200611"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Durvaux, F., Renauld, M., Standaert, F.-X., van Oldeneel tot Oldenzeel, L., Veyrat-Charvillon, N.: Efficient Removal of Random Delays from Embedded Software Implementations Using Hidden Markov Models. In: Mangard, S. (ed.) CARDIS 2012. LNCS, vol.\u00a07771, pp. 123\u2013140. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-37288-9_9"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Durvaux, F., Standaert, F.-X., Veyrat-Charvillon, N., Mairy, J.-B., Deville, Y.: Efficient selection of time samples for higher-order DPA with projection pursuits. IACR Cryptology ePrint Archive, 2014:412 (2014)","DOI":"10.1007\/978-3-319-21476-4_3"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero F5. In: International Symposium on Symbolic and Algebraic Computation Symposium - ISSAC (2002)","DOI":"10.1145\/780506.780516"},{"key":"17_CR14","unstructured":"Ferguson, N.: Authentication weaknesses in GCM (2005), http:\/\/csrc.nist.gov\/groups\/ST\/toolkit\/BCM\/"},{"key":"17_CR15","doi-asserted-by":"crossref","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.\u00a08469, pp. 251\u2013266. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-319-06734-6_16"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Handschuh, H., Preneel, B.: Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 144\u2013161. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-85174-5_9"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Jaffe, J.: A first-order DPA attack against AES in counter mode with unknown initial counter. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol.\u00a04727, pp. 1\u201313. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-74735-2_1"},{"key":"17_CR18","unstructured":"Joux, A.: Authentication Failures in NIST version of GCM (2006), http:\/\/csrc.nist.gov\/CryptoToolkit\/modes\/"},{"key":"17_CR19","unstructured":"Katashita, T., Satoh, A., Kikuchi, K., Nakagawa, H., Aoyagi, M.: Evaluation of DPA Characteristics of SASEBO for Board Level Simulation (2010)"},{"key":"17_CR20","unstructured":"Kirchner, P.: Improved generalized birthday attack. Cryptology ePrint Archive, Report 2011\/377 (2011), http:\/\/eprint.iacr.org\/2011\/377"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Levieil, \u00c9., Fouque, P.-A.: An Improved LPN Algorithm. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 348\u2013359. Springer, Heidelberg (2006)","DOI":"10.1007\/11832072_24"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V.: The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol.\u00a03624, pp. 378\u2013389. Springer, Heidelberg (2005)","DOI":"10.1007\/11538462_32"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Mangard, S.: Hardware Countermeasures against DPA \u2013 A Statistical Analysis of Their Effectiveness. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 222\u2013235. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24660-2_18"},{"key":"17_CR24","unstructured":"Mangard, S., Oswald, E., Popp, T.: Power analysis attacks - revealing the secrets of smart cards. Springer (2007)"},{"key":"17_CR25","unstructured":"McGrew, D.A., Viega, J.: The Galois\/Counter Mode of Operation, GCM (Day 2005)"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Medwed, M., Standaert, F.-X., Gro\u00dfsch\u00e4dl, J., Regazzoni, F.: Fresh Re-keying: Security against Side-Channel and Fault Attacks for Low-Cost Devices. In: Bernstein, D.J., Lange, T. (eds.) AFRICACRYPT 2010. LNCS, vol.\u00a06055, pp. 279\u2013296. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-12678-9_17"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Micali, S., Reyzin, L.: Physically Observable Cryptography. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 278\u2013296. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24638-1_16"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Procter, G., Cid, C.: On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes. In: Moriai, S. (ed.) FSE 2013. LNCS, vol.\u00a08424, pp. 287\u2013304. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-662-43933-3_15"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Rivain, M., Prouff, E.: Provably Secure Higher-Order Masking of AES. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol.\u00a06225, pp. 413\u2013427. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-15031-9_28"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Saarinen, M.-J.O.: Cycling Attacks on GCM, GHASH and Other Polynomial MACs and Hashes. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol.\u00a07549, pp. 216\u2013225. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-34047-5_13"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Veyrat-Charvillon, N., G\u00e9rard, B., Renauld, M., Standaert, F.-X.: An Optimal Key Enumeration Algorithm and Its Application to Side-Channel Attacks. In: Knudsen, L.R., Wu, H. (eds.) SAC 2012. LNCS, vol.\u00a07707, pp. 390\u2013406. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-35999-6_25"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Veyrat-Charvillon, N., G\u00e9rard, B., Standaert, F.-X.: Security Evaluations beyond Computing Power. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 126\u2013141. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-38348-9_8"},{"key":"17_CR33","unstructured":"Yang, B., Mishra, S., Karri, R.: A high speed architecture for galois\/counter mode of operation (GCM). Cryptology ePrint Archive, Report 2005\/146 (2005), http:\/\/eprint.iacr.org\/2005\/146"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45608-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T09:53:23Z","timestamp":1566035603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45608-8_17"}},"subtitle":["Application to AES-GCM"],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662456071","9783662456088"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45608-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}