{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:02:33Z","timestamp":1773615753751,"version":"3.50.1"},"reference-count":12,"publisher":"Allerton Press","issue":"8","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.3103\/s0146411621080289","type":"journal-article","created":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T03:03:08Z","timestamp":1646103788000},"page":"1029-1038","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["New Regular Sliding Window Algorithms for Elliptic Curve Scalar Point Multiplication"],"prefix":"10.3103","volume":"55","author":[{"given":"N. N.","family":"Shenets","sequence":"first","affiliation":[]},{"given":"A. S.","family":"Petushkov","sequence":"additional","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2022,3,1]]},"reference":[{"key":"7432_CR1","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A.I., and Vanstone, S., Guide to Elliptic Curve Cryptography, New York: Springer-Verlag, 2004."},{"key":"7432_CR2","series-title":"Defeating countermeasures based on randomized BSD representations","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28632-5_23","volume-title":"Crtypographic Hardware and Embedded Systems \u2013 CHES 2004","author":"P.-A. Fouque","year":"2004","unstructured":"Fouque, P.-A., Muller, F., Poupard, G., and Valette, F., Defeating countermeasures based on randomized BSD representations, Crtypographic Hardware and Embedded Systems \u2013 CHES 2004, Joye, M. and Quisquater, J.J., Eds., Lecture Notes in Computer Science, vol. 3156, Berlin: Springer, 2004, pp. 312\u2013327.\u00a0https:\/\/doi.org\/10.1007\/978-3-540-28632-5_23"},{"key":"7432_CR3","series-title":"Securing elliptic curve point multiplication against side-channel attacks","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45439-X_22","volume-title":"Information Security. ISC 2001","author":"B. M\u00f6ller","year":"2001","unstructured":"M\u00f6ller, B., Securing elliptic curve point multiplication against side-channel attacks, Information Security. ISC 2001, Davida, G.I. and Frankel, Y., Eds., Lecture Notes in Computer Science, vol. 2200, Berlin: Springer, 2001, pp. 324\u2013334. \u00a0https:\/\/doi.org\/10.1007\/3-540-45439-X_22"},{"key":"7432_CR4","series-title":"Parallelizable elliptic curve point multiplication method with resistance against side-channel attacks","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45811-5_31","volume-title":"Information Security. ISC 2002","author":"B. M\u00f6ller","year":"2002","unstructured":"M\u00f6ller, B., Parallelizable elliptic curve point multiplication method with resistance against side-channel attacks, Information Security. ISC 2002, Chan, A.H. and Gligor, V., Eds., Lecture Notes in Computer Science, vol. 2433, Berlin: Springer, 2002, pp. 402\u2013441. \u00a0https:\/\/doi.org\/10.1007\/3-540-45811-5_31"},{"key":"7432_CR5","doi-asserted-by":"publisher","unstructured":"Shenets, N.N., Bystrye vychislitel\u2019nye algoritmy v kriptografii. Uchebnoe posobie (Fast Computing Algorithms in Cryptography: Handbook), St. Petersburg: Izd. Politekhn. Univ., 2017. \u00a0https:\/\/doi.org\/10.18720\/SPBPU\/2\/i17-396","DOI":"10.18720\/SPBPU\/2\/i17-396"},{"key":"7432_CR6","series-title":"The width-w NAF method provides small memory and fast elliptic scalar multiplications secure against side channel attacks","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36563-X_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2003","author":"K. Okeya","year":"2003","unstructured":"Okeya, K. and Takagi, T., The width-w NAF method provides small memory and fast elliptic scalar multiplications secure against side channel attacks, Topics in Cryptology \u2013 CT-RSA 2003, Joye, M., Ed., Lecture Notes in Computer Science, vol. 2612, Berlin: Springer, 2003, pp.\u00a0328\u2013343. \u00a0https:\/\/doi.org\/10.1007\/3-540-36563-X_23"},{"key":"7432_CR7","series-title":"A more flexible countermeasure against side channel attacks using window method","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45238-6_31","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2003","author":"K. Okeya","year":"2003","unstructured":"Okeya, K. and Takagi, T., A more flexible countermeasure against side channel attacks using window method,  Cryptographic Hardware and Embedded Systems \u2013 CHES 2003, Walter, C.D., Ko\u00e7, \u00c7.K., and Paar, C., Eds., Lecture Notes in Computer Science, vol. 2779, Berlin: Springer, 2003, pp. 397\u2013410. \u00a0https:\/\/doi.org\/10.1007\/978-3-540-45238-6_31"},{"key":"7432_CR8","doi-asserted-by":"publisher","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. Comp., 1987, vol. 48, pp. 243\u2013264. \u00a0https:\/\/doi.org\/10.1090\/S0025-5718-1987-0866113-7","journal-title":"Math. Comp."},{"key":"7432_CR9","doi-asserted-by":"publisher","unstructured":"Hamburg, M., Faster Montgomery and double-add ladders for short weierstrass curves IACR Trans. Cryptographic Hardware Embedded Syst., 2020, vol. 4, pp. 189\u2013208.https:\/\/doi.org\/10.13154\/tches.v2020.i4.189-208","DOI":"10.13154\/tches.v2020.i4.189-208"},{"key":"7432_CR10","series-title":"Highly regular right-to-left algorithms for scalar multiplication","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74735-2_10","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"M. Joye","year":"2007","unstructured":"Joye, M., Highly regular right-to-left algorithms for scalar multiplication,  Cryptographic Hardware and Embedded Systems - CHES 2007, Paillier, P. and Verbauwhede, I., Eds., Lecture Notes in Computer Science, vol. 4727, Berlin: Springer, 2007, pp. 135\u2013147. \u00a0https:\/\/doi.org\/10.1007\/978-3-540-74735-2_10"},{"key":"7432_CR11","series-title":"More flexible exponentiation with precomputation","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48658-5_11","volume-title":"Advances in Cryptology \u2013 CRYPTO \u201994","author":"C.H. Lim","year":"1994","unstructured":"Lim, C.H. and Lee, P.J., More flexible exponentiation with precomputation,   Advances in Cryptology \u2013 CRYPTO \u201994, Desmedt, Y.G., Ed., Lecture Notes in Computer Science, vol. 839, Berlin: Springer, 1994, pp.\u00a095\u2013107. \u00a0https:\/\/doi.org\/10.1007\/3-540-48658-5_11"},{"key":"7432_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(95)00153-P","volume":"30","author":"C.K. Ko\u00e7","year":"1995","unstructured":"Ko\u00e7, C.K., Analysis of sliding window techniques for exponentiation, Comput. Math. Appl., 1995, vol. 30, no.\u00a010, pp. 17\u201324. \u00a0https:\/\/doi.org\/10.1016\/0898-1221(95)00153-P","journal-title":"Comput. Math. Appl."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411621080289.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411621080289","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411621080289.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:04:08Z","timestamp":1773612248000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411621080289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":12,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["7432"],"URL":"https:\/\/doi.org\/10.3103\/s0146411621080289","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"15 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}