{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T11:30:11Z","timestamp":1674905411280},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,9,23]],"date-time":"2014-09-23T00:00:00Z","timestamp":1411430400000},"content-version":"tdm","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":[[2015,3]]},"DOI":"10.1007\/s12095-014-0110-9","type":"journal-article","created":{"date-parts":[[2014,9,22]],"date-time":"2014-09-22T02:07:18Z","timestamp":1411351638000},"page":"71-90","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The distributions of individual bits in the output of multiplicative operations"],"prefix":"10.1007","volume":"7","author":[{"given":"Michael","family":"Tunstall","sequence":"first","affiliation":[]},{"given":"Marc","family":"Joye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,23]]},"reference":[{"key":"110_CR1","doi-asserted-by":"crossref","unstructured":"Akishita, T., Takagi, T.: Power analysis to ECC using differential power between multiplication and squaring. In: Domingo-Ferrer, J., Posegga, J., Schreckling D. (eds.) CARDIS 2006, LNCS, vol. 3928, pp. 151\u2013164. Springer (2006)","DOI":"10.1007\/11733447_11"},{"key":"110_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04159-4_22","volume-title":"Distinguishing multiplications from squaring operations. In: Youm, H., Yung, M. (eds.) SAC 2008, LNCS, vol. 5932, pp. 148\u2013162. Springer","author":"F Amiel","year":"2009","unstructured":"Amiel, F., Feix, B., Tunstall, M., Whelan, C., Marnane, W.P.: Distinguishing multiplications from squaring operations. In: Youm, H., Yung, M. (eds.) SAC 2008, LNCS, vol. 5932, pp. 148\u2013162. Springer (2009)"},{"key":"110_CR3","doi-asserted-by":"crossref","unstructured":"Bauer, A., Jaulmes, E., Prouff, E., Wild, J.: Horizontal and vertical side-channel analysis against secure RSA implementations. In: Dawson, E. (ed.) CT-RSA 2013, LNCS, vol. 7779, pp. 1\u201317. Springer (2013)","DOI":"10.1007\/978-3-642-36095-4_1"},{"key":"110_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption \u2014 how to encrypt with RSA. In: Santis, A.D. (ed.) EUROCRYPT \u201994, LNCS, vol. 950, pp. 92\u2013111. Springer (1994)","DOI":"10.1007\/BFb0053428"},{"key":"110_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures: How to sign with RSA and Rabin. In: Maurer, U. (ed.) EUROCRYPT \u201996, LNCS, vol. 1070, pp. 399\u2013416. Springer (1996)","DOI":"10.1007\/3-540-68339-9_34"},{"key":"110_CR6","doi-asserted-by":"crossref","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 (2004)","DOI":"10.1007\/978-3-540-28632-5_2"},{"key":"110_CR7","doi-asserted-by":"crossref","unstructured":"Chari, S., Rao, J.R., Rohatgi, P.: Template attacks. In: Kaliski, Jr., Ko\u00e7, C.K., Paar C. (eds.) CHES 2002, LNCS, vol. 2523, pp. 13\u201328. Springer (2002)","DOI":"10.1007\/3-540-36400-5_3"},{"key":"110_CR8","doi-asserted-by":"crossref","unstructured":"Clavier, C., Feix, B., Gagnerot, G., Giraud, C., Roussellet, M., Verneuil, V.: ROSETTA for single trace analysis. In: Galbratih, S., Nandi M. (eds.) INDOCRYPT 2012, LNCS, vol. 7668, pp. 140\u2013155. Springer (2012)","DOI":"10.1007\/978-3-642-34931-7_9"},{"key":"110_CR9","doi-asserted-by":"crossref","unstructured":"Clavier, C., Feix, B., Gagnerot, G., Roussellet, M., Verneuil, V.: Horizontal correlation analysis on exponentiation. In: Soriano, M., Qing, S., L\u00f3pez, J. (eds.) ICICS 2010, LNCS, vol. 6476, pp. 46\u201361. Springer (2010)","DOI":"10.1007\/978-3-642-17650-0_5"},{"key":"110_CR10","doi-asserted-by":"crossref","unstructured":"Clavier, C., Feix, B., Gagnerot, G., Roussellet, M., Verneuil, V.: Square always exponentiation. In: Bernstein, D.J., Chatterjee, S. (eds.) INDOCRYPT 2011, LNCS, vol. 7107, pp. 40\u201357. Springer (2011)","DOI":"10.1007\/978-3-642-25578-6_5"},{"key":"110_CR11","doi-asserted-by":"crossref","unstructured":"Coron, J.S.: Resistance against differential power analysis for elliptic curve cryptosystems. In: Ko\u00e7, C.K., Paar C. (eds.) CHES 1999, LNCS, vol. 1717, pp. 292\u2013302. Springer (1999)","DOI":"10.1007\/3-540-48059-5_25"},{"key":"110_CR12","doi-asserted-by":"crossref","unstructured":"Dupaquis, V., Venelli, A.: Redundant modular reduction algorithms. In: Prouff, E. (ed.) CARDIS 2011, LNCS, vol. 7079, pp. 102\u2013114. Springer (2011)","DOI":"10.1007\/978-3-642-27257-8_7"},{"key":"110_CR13","doi-asserted-by":"crossref","unstructured":"Gierlichs, B., Batina, L., Tuyls, P., Preneel, B.: Mutual information analysis. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008, LNCS, vol. 5154, pp. 426\u2013442. Springer (2008)","DOI":"10.1007\/978-3-540-85053-3_27"},{"issue":"4","key":"110_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10207-011-0135-4","volume":"10","author":"N Hanley","year":"2011","unstructured":"Hanley, N., Tunstall, M., Marnane, W.P.: Using templates to distinguish multiplications from squaring operations. Int. J. Inf. Secur. 10 (4), 255\u2013266 (2011)","journal-title":"Int. J. Inf. Secur."},{"key":"110_CR15","doi-asserted-by":"crossref","unstructured":"Joye, M.: Highly regular right-to-left algorithms for scalar multiplication. In: Paillier, P., Verbauwhede I. (eds.) CHES 2007, LNCS, vol. 4727, pp. 135\u2013147. Springer (2007)","DOI":"10.1007\/978-3-540-74735-2_10"},{"key":"110_CR16","doi-asserted-by":"crossref","unstructured":"Joye, M., Yen, S.M.: The Montgomery powering ladder. In: Kaliski, Jr., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002, LNCS, vol. 2523, pp. 291\u2013302. Springer (2003)","DOI":"10.1007\/3-540-36400-5_22"},{"key":"110_CR17","doi-asserted-by":"crossref","unstructured":"Kocher, P.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO \u201996, LNCS, vol. 1109, pp. 104\u2013113. Springer (1996)","DOI":"10.1007\/3-540-68697-5_9"},{"key":"110_CR18","doi-asserted-by":"crossref","unstructured":"Kocher, P., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M.J. (ed.) CRYPTO \u201999, LNCS, vol. 1666, pp. 388\u2013397. Springer (1999)","DOI":"10.1007\/3-540-48405-1_25"},{"key":"110_CR19","volume-title":"Power Analysis Attacks \u2014 Revealing the Secrets of Smart Cards","author":"S Mangard","year":"2007","unstructured":"Mangard, S., Oswald, E., Popp, T.: Power Analysis Attacks \u2014 Revealing the Secrets of Smart Cards. Springer, Berlin (2007)"},{"key":"110_CR20","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P Montgomery","year":"1985","unstructured":"Montgomery, P.: Modular multiplication without trial division. Math. Comput. 44, 519\u2013521 (1985)","journal-title":"Math. Comput."},{"issue":"177","key":"110_CR21","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"P Montgomery","year":"1987","unstructured":"Montgomery, P.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comput. 48 (177), 243\u2013264 (1987)","journal-title":"Math. Comput."},{"key":"110_CR22","unstructured":"National Institute of Standards and Technology (NIST): recommended elliptic curves for federal government use. In the appendix of FIPS 186-3, available from, http:\/\/csrc.nist.gov\/publications\/fips\/fips186-3\/fips_186-3.pdf (2009)"},{"key":"110_CR23","doi-asserted-by":"crossref","unstructured":"Oswald, E., Aigner, M.: Randomized addition-subtraction chains as a countermeasure against power attacks. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001, LNCS, vol. 2162, pp. 39\u201350. Springer (2001)","DOI":"10.1007\/3-540-44709-1_5"},{"key":"110_CR24","volume-title":"Computer Arithmetic","author":"B Parhami","year":"2000","unstructured":"Parhami, B.: Computer Arithmetic. Oxford University Press, London (2000)"},{"issue":"2","key":"110_CR25","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.M.: Method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21 (2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"2","key":"110_CR26","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1049\/iet-ifs:20070017","volume":"2","author":"N Smart","year":"2008","unstructured":"Smart, N., Oswald, E., Page, D.: Randomised representations. IET Proc. Inf. Secur. 2 (2), 19\u201327 (2008)","journal-title":"IET Proc. Inf. Secur."},{"issue":"237","key":"110_CR27","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1090\/S0025-5718-01-01310-2","volume":"71","author":"D Stinson","year":"2002","unstructured":"Stinson, D.: Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem. Math. Comput. 71 (237), 379\u2013391 (2002)","journal-title":"Math. Comput."},{"key":"110_CR28","unstructured":"Teske, E.: New algorithms for finite abelian groups. Ph.D. thesis, Technische Universit\u00e4t Darmstadt (1998)"},{"key":"110_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-27257-8_15","volume-title":"An exploration of the Kolmogorov-Smirnov test as a competitor to mutual information analysis. In: Prouff, E. (ed.) CARDIS 2011, LNCS, vol. 7079, pp. 234\u2013251. Springer","author":"C Whitnall","year":"2011","unstructured":"Whitnall, C., Oswald, E., Mather, L.: An exploration of the Kolmogorov-Smirnov test as a competitor to mutual information analysis. In: Prouff, E. (ed.) CARDIS 2011, LNCS, vol. 7079, pp. 234\u2013251. Springer (2011)"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-014-0110-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-014-0110-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-014-0110-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T03:09:55Z","timestamp":1565838595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-014-0110-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,23]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["110"],"URL":"https:\/\/doi.org\/10.1007\/s12095-014-0110-9","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,23]]}}}