{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T22:10:08Z","timestamp":1751407808961,"version":"3.41.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,2,16]],"date-time":"2018-02-16T00:00:00Z","timestamp":1518739200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"FWO, Research Foundation of Flanders","award":["FWO Pegasus Marie Curie Fellowship"],"award-info":[{"award-number":["FWO Pegasus Marie Curie Fellowship"]}]},{"name":"Erasmus Mundus","award":["PhD Scholarship"],"award-info":[{"award-number":["PhD Scholarship"]}]},{"DOI":"10.13039\/501100004040","name":"KU Leuven","doi-asserted-by":"publisher","award":["GOA TENSE (GOA\/11\/007)","F+ Fellowship (F+\/13\/039)"],"award-info":[{"award-number":["GOA TENSE (GOA\/11\/007)","F+ Fellowship (F+\/13\/039)"]}],"id":[{"id":"10.13039\/501100004040","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hercules Foundation","award":["AKUL\/11\/19"],"award-info":[{"award-number":["AKUL\/11\/19"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s13389-018-0182-0","type":"journal-article","created":{"date-parts":[[2018,2,16]],"date-time":"2018-02-16T05:18:18Z","timestamp":1518758298000},"page":"285-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Arithmetic of $$\\tau $$ \u03c4 -adic expansions for lightweight Koblitz curve cryptography"],"prefix":"10.1007","volume":"8","author":[{"given":"Kimmo","family":"J\u00e4rvinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sujoy","family":"Sinha Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingrid","family":"Verbauwhede","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,16]]},"reference":[{"issue":"5","key":"182_CR1","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1109\/TC.2011.87","volume":"61","author":"J Adikari","year":"2012","unstructured":"Adikari, J., Dimitrov, V., J\u00e4rvinen, K.: A fast hardware architecture for integer to $$\\tau $$ \u03c4 NAF conversion for Koblitz curves. IEEE Trans. Comput. 61(5), 732\u2013737 (2012)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"182_CR2","first-page":"481","volume":"14","author":"O Ahmadi","year":"2008","unstructured":"Ahmadi, O., Hankerson, D., Rodr\u00edguez-Henr\u00edquez, F.: Parallel formulations of scalar multiplication on Koblitz curves. J. Univ. Comput. Sci. 14(3), 481\u2013504 (2008)","journal-title":"J. Univ. Comput. Sci."},{"key":"182_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-33481-8_10","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2012","author":"Diego F. Aranha","year":"2012","unstructured":"Aranha, D.F., Faz-Hern\u00e1ndez, A., L\u00f3pez, J., Rodr\u00edguez-Henr\u00edquez, F.: Faster implementation of scalar multiplication on Koblitz curves. In: Progress in Cryptology (LATINCRYPT 2012), LNCS, vol. 7533, pp. 177\u2013193. Springer, Berlin (2012)"},{"issue":"4","key":"182_CR4","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1109\/TCSI.2013.2283691","volume":"61","author":"R Azarderakhsh","year":"2014","unstructured":"Azarderakhsh, R., J\u00e4rvinen, K.U., Mozaffari-Kermani, M.: Efficient algorithm and architecture for elliptic curve cryptography for extremely constrained secure applications. IEEE Trans. Circuits Syst. I Reg. Pap. 61(4), 1144\u20131155 (2014)","journal-title":"IEEE Trans. Circuits Syst. I Reg. Pap."},{"issue":"1","key":"182_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/TCSII.2012.2234916","volume":"60","author":"R Azarderakhsh","year":"2013","unstructured":"Azarderakhsh, R., Reyhani-Masoleh, A.: High-performance implementation of point multiplication on Koblitz curves. IEEE Trans. Circuits Syst. II 60(1), 41\u201345 (2013)","journal-title":"IEEE Trans. Circuits Syst. II"},{"key":"182_CR6","first-page":"6","volume-title":"Lecture Notes in Computer Science","author":"Lejla Batina","year":"2006","unstructured":"Batina, L., Mentens, N., Sakiyama, K., Preneel, B., Verbauwhede, I.: Low-cost elliptic curve cryptography for wireless sensor networks. In: Proceedings of 3rd European Workshop on Security and Privacy in Ad-Hoc and Sensor Networks (ESAS 2006). LNCS, vol. 4357, pp. 6\u201317 (2006)"},{"issue":"1","key":"182_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s12095-014-0111-8","volume":"7","author":"A Bauer","year":"2015","unstructured":"Bauer, A., Jaulmes, E., Prouff, E., Reinhard, J.R., Wild, J.: Horizontal collision correlation attack on elliptic curves. Cryptogr. Commun. 7(1), 91\u2013119 (2015)","journal-title":"Cryptogr. Commun."},{"key":"182_CR8","doi-asserted-by":"crossref","unstructured":"Benits, Jr., W.D., Galbraith, S.D.: The GPS identification scheme using Frobenius expansions. In: Western European Workshop Research in Cryptology (WEWoRC\u201907). LNCS, vol. 4945, pp. 13\u201327 (2008)","DOI":"10.1007\/978-3-540-88353-1_2"},{"key":"182_CR9","doi-asserted-by":"crossref","unstructured":"Brumley, B.B., J\u00e4rvinen, K.: Koblitz curves and integer equivalents of Frobenius expansions. In: Selected Areas in Cryptography (SAC 2007). LNCS, vol. 4876, pp. 126\u2013137 (2007)","DOI":"10.1007\/978-3-540-77360-3_9"},{"issue":"1","key":"182_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/TC.2009.132","volume":"59","author":"BB Brumley","year":"2010","unstructured":"Brumley, B.B., J\u00e4rvinen, K.U.: Conversion algorithms and implementations for Koblitz curve cryptography. IEEE Trans. Comput. 59(1), 81\u201392 (2010)","journal-title":"IEEE Trans. Comput."},{"key":"182_CR11","doi-asserted-by":"crossref","unstructured":"Cinnati\u00a0Loi, K.C., An, S., Ko, S.B.: FPGA implementation of low latency scalable elliptic curve cryptosystem processor in $$GF(2^m)$$ G F ( 2 m ) . In: IEEE International Symposium on Circuits and Systems (ISCAS 2014), pp. 822\u2013825. IEEE (2014)","DOI":"10.1109\/ISCAS.2014.6865262"},{"issue":"4","key":"182_CR12","first-page":"394","volume":"37","author":"KC Cinnati Loi","year":"2013","unstructured":"Cinnati Loi, K.C., Ko, S.B.: High performance scalable elliptic curve cryptosystem processor for Koblitz curves. Microproc. Microsyst. 37(4), 394\u2013406 (2013)","journal-title":"Microproc. Microsyst."},{"key":"182_CR13","doi-asserted-by":"crossref","unstructured":"De\u00a0Clercq, R., Uhsadel, L., Van\u00a0Herrewege, A., Verbauwhede, I.: Ultra low-power implementation of ECC on the ARM Cortex-M0+. In: Design Automation Conference (DAC 2014), pp. 1\u20136. ACM, New York (2014)","DOI":"10.1145\/2593069.2593238"},{"key":"182_CR14","doi-asserted-by":"crossref","unstructured":"Hankerson, D., Hernandez, J.L., Menezes, A.: Software implementation of elliptic curve cryptography over binary fields. In: Cryptographic Hardware and Embedded Systems (CHES 2000). LNCS, vol. 1965, pp. 1\u201324. Springer (2000)","DOI":"10.1007\/3-540-44499-8_1"},{"key":"182_CR15","first-page":"431","volume-title":"Lecture Notes in Computer Science","author":"Neil Hanley","year":"2015","unstructured":"Hanley, N., Kim, H., Tunstall, M.: Exploiting collisions in addition chain-based exponentiation algorithms using a single trace. In: Topics in Cryptology\u2014CT-RSA 2015. Lecture Notes in Computer Science, vol. 9048, pp. 431\u2013448. Springer, Berlin (2015)"},{"key":"182_CR16","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-40588-4_12","volume-title":"Security Engineering and Intelligence Informatics","author":"Christian Hanser","year":"2013","unstructured":"Hanser, C., Wagner, C.: Speeding up the fixed-base comb method for faster scalar multiplication on Koblitz curves. In: Modern Cryptography and Security Engineering (MoCrySEn 2013), LNCS, vol. 8128, pp. 168\u2013179. Springer, Berlin (2013)"},{"key":"182_CR17","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-642-04159-4_26","volume-title":"Selected Areas in Cryptography","author":"Daniel Hein","year":"2009","unstructured":"Hein, D.M., Wolkerstorfer, J., Felber, N.: ECC is ready for RFID: a proof in silicon. In: Selected Areas in Cryptography (SAC 2008). LNCS, vol. 5381, pp. 401\u2013413 (2009)"},{"issue":"4","key":"182_CR18","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.vlsi.2010.08.001","volume":"44","author":"K J\u00e4rvinen","year":"2011","unstructured":"J\u00e4rvinen, K.: Optimized FPGA-based elliptic curve cryptography processor for high-speed applications. Integration 44(4), 270\u2013279 (2011)","journal-title":"Integration"},{"key":"182_CR19","doi-asserted-by":"crossref","unstructured":"J\u00e4rvinen, K., Forsten, J., Skytt\u00e4, J.: Efficient circuitry for computing $$\\tau $$ \u03c4 -adic non-adjacent form. In: Proceedings of 13th IEEE International Conference on Electronics, Circuits and Systems (ICECS 2006), pp. 232\u2013235 (2006)","DOI":"10.1109\/ICECS.2006.379768"},{"key":"182_CR20","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/978-3-319-16763-3_10","volume-title":"Smart Card Research and Advanced Applications","author":"Kimmo J\u00e4rvinen","year":"2015","unstructured":"J\u00e4rvinen, K., Verbauwhede, I.: How to use Koblitz curves on small devices? In: Smart Card Research and Advanced Application Conference (CARDIS\u00a02014). LNCS, vol. 8968, pp. 154\u2013170 (2015)"},{"key":"182_CR21","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/3-540-44586-2_26","volume-title":"Public Key Cryptography","author":"Marc Joye","year":"2001","unstructured":"Joye, M., Tymen, C.: Compact encoding of non-adjacent forms with applications to elliptic curve cryptography. In: Public Key Cryptography (PKC 2001). LNCS, vol. 1992, pp. 353\u2013364 (2001)"},{"issue":"177","key":"182_CR22","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"182_CR23","unstructured":"Koblitz, N.: CM-curves with good cryptographic properties. In: CRYPTO\u00a0\u201991. LNCS, vol. 576, pp. 279\u2013287 (1991)"},{"key":"182_CR24","doi-asserted-by":"crossref","unstructured":"Ko\u00e7abas, \u00dc., Fan, J., Verbauwhede, I.: Implementation of binary Edwards curves for very-constrained devices. In: Proceedings of 21st IEEE International Conference on Application-Specific Systems Architectures and Processors (ASAP 2010), pp. 185\u2013191 (2010)","DOI":"10.1109\/ASAP.2010.5541003"},{"key":"182_CR25","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.ffa.2004.07.001","volume":"11","author":"T Lange","year":"2005","unstructured":"Lange, T.: Koblitz curve cryptosystems. Finite Fields Appl. 11, 200\u2013229 (2005)","journal-title":"Finite Fields Appl."},{"issue":"11","key":"182_CR26","doi-asserted-by":"publisher","first-page":"1514","DOI":"10.1109\/TC.2008.148","volume":"57","author":"YK Lee","year":"2008","unstructured":"Lee, Y.K., Sakiyama, K., Batina, L., Verbauwhede, I.: Elliptic-curve-based security processor for RFID. IEEE Trans. Comput. 57(11), 1514\u20131527 (2008)","journal-title":"IEEE Trans. Comput."},{"key":"182_CR27","doi-asserted-by":"crossref","unstructured":"Lutz, J., Hasan, A.: High performance FPGA based elliptic curve cryptographic co-processor. In: International Conference on Information Technology: Coding and Computing (ITCC 2004), vol.\u00a02, pp. 486\u2013492. IEEE (2004)","DOI":"10.1109\/ITCC.2004.1286701"},{"key":"182_CR28","doi-asserted-by":"crossref","unstructured":"Meier, W., Staffelbach, O.: Efficient multiplication on certain nonsupersingular elliptic curves. In: CRYPTO\u00a0\u201992. LNCS, vol. 740, pp. 333\u2013344 (1993)","DOI":"10.1007\/3-540-48071-4_24"},{"key":"182_CR29","doi-asserted-by":"crossref","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: CRYPTO\u00a0\u201985. LNCS, vol. 218, pp. 417\u2013426 (1986)","DOI":"10.1007\/3-540-39799-X_31"},{"key":"182_CR30","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comput. 48, 243\u2013264 (1987)","journal-title":"Math. Comput."},{"key":"182_CR31","doi-asserted-by":"crossref","unstructured":"Naccache, D., M\u2019Ra\u00efhi, D., Vaudenay, S., Raphaeli, D.: Can D.S.A. be improved? Complexity trade-offs with the digital signature algorithm. In: EUROCRYPT\u00a0\u201994. LNCS, vol. 950, pp. 77\u201385 (1994)","DOI":"10.1007\/BFb0053426"},{"key":"182_CR32","unstructured":"National Institute of Standards and Technology (NIST): Digital signature standard (DSS). FIPS PUB 186-4 (2013)"},{"key":"182_CR33","doi-asserted-by":"crossref","unstructured":"Okada, S., Torii, N., Itoh, K., Takenaka, M.: Implementation of elliptic curve cryptographic coprocessor over $$GF(2^m)$$ G F ( 2 m ) on an FPGA. In: Cryptographic Hardware and Embedded Systems (CHES 2000), LNCS, vol. 1965, pp. 25\u201340. Springer, Berlin (2000)","DOI":"10.1007\/3-540-44499-8_2"},{"key":"182_CR34","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11506157_19","volume-title":"Information Security and Privacy","author":"Katsuyuki Okeya","year":"2005","unstructured":"Okeya, K., Takagi, T., Vuillaume, C.: Efficient representations on Koblitz curves with resistance to side channel attacks. In: Proceedings of 10th Australasian Conference on Information Security and Privacy (ACISP 2005). LNCS, vol. 3574, pp. 218\u2013229 (2005)"},{"key":"182_CR35","doi-asserted-by":"crossref","unstructured":"Oren, Y., Feldhofer, M.: A low-resource public-key identification scheme for RFID tags and sensor nodes. In: ACM Conference on Wireless Network Security (WiSec\u201909), pp. 59\u201368. ACM (2009)","DOI":"10.1145\/1514274.1514283"},{"key":"182_CR36","unstructured":"Secunet Security Networks AG: Elliptic curve cryptography \u201cMade in Germany\u201d. Press release (2014). https:\/\/www.secunet.com\/fileadmin\/user_upload\/Presse\/Pressemitteilungen\/Pressemitteilungen_EN\/Pressemitteilungen_2014_EN\/140625_PI_ECC_EN.pdf . Retrieved 21 Feb 2017"},{"issue":"5","key":"182_CR37","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1109\/TVLSI.2014.2321282","volume":"23","author":"S Sinha Roy","year":"2015","unstructured":"Sinha Roy, S., Fan, J., Verbauwhede, I.: Accelerating scalar conversion for Koblitz curve cryptoprocessors on hardware platforms. IEEE Trans. VLSI Syst. 23(5), 810\u2013818 (2015)","journal-title":"IEEE Trans. VLSI Syst."},{"key":"182_CR38","doi-asserted-by":"crossref","unstructured":"Sinha Roy, S., J\u00e4rvinen, K., Verbauwhede, I.: Lightweight coprocessor for Koblitz curves: 283-bit ECC including scalar conversion with only 4.3\u00a0kGE. In: Cryptographic Hardware and Embedded Systems (CHES\u00a02015). LNCS, vol. 9293, pp. 102\u2013122 (2015)","DOI":"10.1007\/978-3-662-48324-4_6"},{"issue":"2\u20133","key":"182_CR39","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1008306223194","volume":"19","author":"JA Solinas","year":"2000","unstructured":"Solinas, J.A.: Efficient arithmetic on Koblitz curves. Des. Code Cryptogr. 19(2\u20133), 195\u2013249 (2000)","journal-title":"Des. Code Cryptogr."},{"issue":"3","key":"182_CR40","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s13389-011-0017-8","volume":"1","author":"J Taverne","year":"2011","unstructured":"Taverne, J., Faz-Hern\u00e1ndez, A., Aranha, D.F., Rodr\u00edguez-Henr\u00edquez, F., Hankerson, D., L\u00f3pez, J.: Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction. J. Cryptogr. Eng. 1(3), 187\u2013199 (2011)","journal-title":"J. Cryptogr. Eng."},{"issue":"5","key":"182_CR41","doi-asserted-by":"publisher","first-page":"1362","DOI":"10.1093\/ietfec\/e89-a.5.1362","volume":"E89\u2013A","author":"C Vuillaume","year":"2006","unstructured":"Vuillaume, C., Okeya, K., Takagi, T.: Defeating simple power analysis on Koblitz curves. IEICE Trans. Fund. Elect. E89\u2013A(5), 1362\u20131369 (2006)","journal-title":"IEICE Trans. Fund. Elect."},{"key":"182_CR42","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-45067-X_8","volume-title":"Information Security and Privacy","author":"Andr\u00e9 Weimerskirch","year":"2003","unstructured":"Weimerskirch, A., Stebila, D., Shantz, S.C.: Generic $$GF(2^m)$$ G F ( 2 m ) arithmetic in software and its application to ECC. In: Australasian Conference on Information Security and Privacy (ACISP 2003). LNCS, vol. 2727, pp. 79\u201392. Springer, Berlin (2003)"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-018-0182-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-018-0182-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-018-0182-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T21:45:37Z","timestamp":1751406337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-018-0182-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,16]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["182"],"URL":"https:\/\/doi.org\/10.1007\/s13389-018-0182-0","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"type":"print","value":"2190-8508"},{"type":"electronic","value":"2190-8516"}],"subject":[],"published":{"date-parts":[[2018,2,16]]},"assertion":[{"value":"22 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}