{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T23:47:14Z","timestamp":1771890434439,"version":"3.50.1"},"reference-count":49,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2020,12,31]],"date-time":"2020-12-31T00:00:00Z","timestamp":1609372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior (FAPESC)","award":["- Finance Code 001"],"award-info":[{"award-number":["- Finance Code 001"]}]},{"name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico (CNPq)","award":["- Grant 315287\/2018-7  - Grant 436982\/2018-8"],"award-info":[{"award-number":["- Grant 315287\/2018-7  - Grant 436982\/2018-8"]}]},{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Santa Catarina (FAPESC)","award":["- Grant 2019TR169"],"award-info":[{"award-number":["- Grant 2019TR169"]}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["- Project UIDB\/04111\/2020  - Project foRESTER PCIF\/SSI\/0102\/2017."],"award-info":[{"award-number":["- Project UIDB\/04111\/2020  - Project foRESTER PCIF\/SSI\/0102\/2017."]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JSAN"],"abstract":"<jats:p>Cryptography is considered indispensable among security measures applied to data concerning insecure means of transmission. Among various existent algorithms on asymmetric cryptography, we may cite Elliptic Curve Cryptography (ECC), which has been widely used due to its security level and reduced key sizes. When compared to Rivest, Shamir and Adleman (RSA), for example, ECC can maintain security levels with a shorter key. Elliptic Curve Point Multiplication (ECPM) is the main function in ECC, and is the component with the highest hardware cost. Lots of ECPM implementations have been applied on hardware targeting the acceleration of its calculus. This article presents a systematic review of literature on ECPM implementations on both Field-Programmable Gate Array (FPGA) and Application-Specific Integrated Circuit (ASIC). The obtained results show which methods and technologies have been used to implement ECPM on hardware and present some findings of the choices available to the hardware designers.<\/jats:p>","DOI":"10.3390\/jsan10010003","type":"journal-article","created":{"date-parts":[[2020,12,31]],"date-time":"2020-12-31T14:31:49Z","timestamp":1609425109000},"page":"3","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":45,"title":["A Review of Techniques for Implementing Elliptic Curve Point Multiplication on Hardware"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5854-2521","authenticated-orcid":false,"given":"Arielle","family":"Verri Lucca","sequence":"first","affiliation":[{"name":"Laboratory of Embedded and Distributed Systems, University of Vale do Itajai, Itajai, Santa Catarina 88302-901, Brazil"}]},{"given":"Guilherme","family":"Mariano Sborz","sequence":"additional","affiliation":[{"name":"Laboratory of Embedded and Distributed Systems, University of Vale do Itajai, Itajai, Santa Catarina 88302-901, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0446-9271","authenticated-orcid":false,"given":"Valderi","family":"Leithardt","sequence":"additional","affiliation":[{"name":"COPELABS, Universidade Lus\u00f3fona de Humanidades e Tecnologias, Campo Grande 376, 1749-024 Lisboa, Portugal"},{"name":"VALORIZA, Research Center for Endogenous Resources Valorization, Instituto Polit\u00e9cnico de Portalegre, 7300-555 Portalegre, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7315-8739","authenticated-orcid":false,"given":"Marko","family":"Beko","sequence":"additional","affiliation":[{"name":"COPELABS, Universidade Lus\u00f3fona de Humanidades e Tecnologias, Campo Grande 376, 1749-024 Lisboa, Portugal"},{"name":"Instituto de Telecomunica\u00e7\u00f5es, Instituto Superior T\u00e9cnico, Universidade de Lisboa, 1049-001 Lisbon, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3039-4410","authenticated-orcid":false,"given":"Cesar","family":"Albenes Zeferino","sequence":"additional","affiliation":[{"name":"Laboratory of Embedded and Distributed Systems, University of Vale do Itajai, Itajai, Santa Catarina 88302-901, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1896-0520","authenticated-orcid":false,"given":"Wemerson","family":"Parreira","sequence":"additional","affiliation":[{"name":"Laboratory of Embedded and Distributed Systems, University of Vale do Itajai, Itajai, Santa Catarina 88302-901, Brazil"}]}],"member":"1968","published-online":{"date-parts":[[2020,12,31]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","article-title":"Elliptic curve cryptosystems","volume":"48","author":"Koblitz","year":"1987","journal-title":"Math. Comput."},{"key":"ref_2","unstructured":"Miller, V.S. (1985, January 9\u201311). Use of elliptic curves in cryptography. Proceedings of the Conference on the Theory and Application of Cryptographic Techniques, Linz, Austria."},{"key":"ref_3","unstructured":"Cheung, D., Maslov, D., Mathew, J., and Pradhan, D.K. (February, January 30). On the design and optimization of a quantum polynomial-time attack on elliptic curve cryptography. Proceedings of the Workshop on Quantum Computation, Communication, and Cryptography, Tokyo, Japan."},{"key":"ref_4","first-page":"135","article-title":"Elliptic curve digital signatures and their application in the bitcoin crypto-currency transactions","volume":"7","author":"Kikwai","year":"2017","journal-title":"Int. J. Sci. Res. Publ."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"K\u00e4sper, E. (March, January 28). Fast Elliptic Curve Cryptography in OpenSSL. Proceedings of the 2011 International Conference on Financial Cryptography and Data Security, Gros Islet, St. Lucia.","DOI":"10.1007\/978-3-642-29889-9_4"},{"key":"ref_6","first-page":"102361","article-title":"When an attacker meets a cipher-image in 2018: A year in review","volume":"48","author":"Li","year":"2019","journal-title":"J. Inf. Secur. Appl."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.ijleo.2018.04.068","article-title":"Cryptanalysis of multimedia encryption using elliptic curve cryptography","volume":"168","author":"Khoirom","year":"2018","journal-title":"Optik"},{"key":"ref_8","first-page":"10241","article-title":"An elliptic curve key management scheme for Internet of Things","volume":"11","author":"Dahshan","year":"2016","journal-title":"Int. J. Appl. Eng. Res."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.procs.2015.10.078","article-title":"Secure Medical Data Transmission by Using ECC with Mutual Authentication in WSNs","volume":"70","author":"Shankar","year":"2015","journal-title":"Procedia Comput. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.procs.2018.08.176","article-title":"Text Encryption in Android Chat Applications using Elliptical Curve Cryptography (ECC)","volume":"135","author":"Natanael","year":"2018","journal-title":"Procedia Comput. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"22778","DOI":"10.1109\/ACCESS.2018.2828319","article-title":"ACryp-Proc: Flexible asymmetric crypto processor for point multiplication","volume":"6","author":"Imran","year":"2018","journal-title":"IEEE Access"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Pateriya, R., and Vasudevan, S. (2011, January 3\u20135). Elliptic Curve Cryptography in Constrained Environments: A Review. Proceedings of the 2011 International Conference on Communication Systems and Network Technologies, Jammu, India.","DOI":"10.1109\/CSNT.2011.32"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Hossain, M.S., Saeedi, E., and Kong, Y. (2017). Parallel point-multiplication architecture using combined group operations for high-speed cryptographic applications. PLoS ONE, 12.","DOI":"10.1371\/journal.pone.0176214"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1668","DOI":"10.1109\/TPDS.2014.2323062","article-title":"Parallel and high-speed computations of elliptic curve cryptography using hybrid-double multipliers","volume":"26","author":"Azarderakhsh","year":"2015","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Dhillon, P.K., and Kalra, S. (2016, January 14\u201316). Elliptic curve cryptography for real time embedded systems in IoT networks. Proceedings of the 2016 5th International Conference on Wireless Networks and Embedded Systems (WECON), Rajpura, India.","DOI":"10.1109\/WECON.2016.7993462"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2353","DOI":"10.1109\/TIE.2016.2625241","article-title":"An efficient and flexible hardware implementation of the dual-field elliptic curve cryptographic processor","volume":"64","author":"Liu","year":"2017","journal-title":"IEEE Trans. Ind. Electron."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2869","DOI":"10.1109\/TCSI.2018.2801118","article-title":"A low-latency and low-complexity point-multiplication in ECC","volume":"65","author":"Salarifard","year":"2018","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"ref_18","first-page":"13","article-title":"Guide to elliptic curve cryptography","volume":"46","author":"Hankerson","year":"2005","journal-title":"Comput. Rev."},{"key":"ref_19","unstructured":"Marwedel, P. (2006). Embedded System Design, Springer."},{"key":"ref_20","unstructured":"Vahid, F., and Givargis, T. (1999). Embedded System Design: A Unified Hardware\/Software Approach, Department of Computer Science and Engineering University of California."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/j.micpro.2018.09.003","article-title":"Flexible elliptic curve cryptography coprocessor using scalable finite field arithmetic blocks on FPGAs","volume":"63","author":"Loi","year":"2018","journal-title":"Microprocess. Microsyst."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10623-003-1160-8","article-title":"Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults","volume":"36","author":"Ciet","year":"2005","journal-title":"Des. Codes Cryptogr."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01933667","article-title":"A monte carlo method for factorization","volume":"15","author":"Pollard","year":"1975","journal-title":"BIT Numer. Math."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Silverman, J.H. (1994). Advanced Topics in the Arithmetic of Elliptic Curves, Springer Science & Business Media.","DOI":"10.1007\/978-1-4612-0851-8"},{"key":"ref_25","unstructured":"San, C.V. (2020, June 20). A Survey of Elliptic Curve Cryptosystems, Part I: Introductory; Technical Report, NAS Technical Report-NAS-03-012, Available online: https:\/\/nas.nasa.gov\/assets\/pdf\/techreports\/2003\/nas-03-012.pdf."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Qing, S., Okamoto, T., and Zhou, J. (2001). Efficient Software Implementation for Finite Field Multiplication in Normal Basis. Information and Communications Security, Springer.","DOI":"10.1007\/3-540-45600-7_21"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0166-218X(88)90090-X","article-title":"Optimal normal bases in GF (pn)","volume":"22","author":"Mullin","year":"1988","journal-title":"Discret. Appl. Math."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Li, L., and Li, S. (2017). High-performance pipelined architecture of point multiplication on Koblitz curves. IEEE Trans. Circuits Syst. II Express Briefs.","DOI":"10.1109\/TCSII.2017.2785382"},{"key":"ref_29","unstructured":"Brown, D. (2009). Standards for efficient cryptography, SEC 1: Elliptic curve cryptography. Released Stand. Version, 1, Available online: https:\/\/www.secg.org\/SEC1-Ver-1.0.pdf."},{"key":"ref_30","first-page":"43","article-title":"Efficient Algorithm in Projective Coordinates for EEC Over","volume":"15","author":"Jebrila","year":"2007","journal-title":"Int. J. Comput. Internet Manag."},{"key":"ref_31","first-page":"462","article-title":"Improved Arithmetic on Elliptic Curves over Prime Field","volume":"2","author":"Saffar","year":"2014","journal-title":"Int. J. Comput. Netw. Commun. Secur."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Fan, J., Guo, X., De Mulder, E., Schaumont, P., Preneel, B., and Verbauwhede, I. (2010, January 13\u201314). State-of-the-art of secure ECC implementations: A survey on known side-channel attacks and countermeasures. Proceedings of the 2010 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST), Anaheim, CA, USA.","DOI":"10.1109\/HST.2010.5513110"},{"key":"ref_33","unstructured":"Kitchenham, B., and Charters, S. (2020, June 20). Guidelines for Performing Systematic Literature Reviews in Software Engineering; Technical Report EBSE 2007-001, Keele University and Durham University Joint Report. Available online: https:\/\/www.elsevier.com\/__data\/promis_misc\/525444systematicreviewsguide.pdf."},{"key":"ref_34","unstructured":"Scimago (2020, November 10). Scimago Journal and Country Rank. Available online: www.scimagojr.com."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.mejo.2016.03.006","article-title":"High-speed hardware architecture of scalar multiplication for binary elliptic curve cryptosystems","volume":"52","author":"Rashidi","year":"2016","journal-title":"Microelectron. J."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/TVLSI.2016.2574620","article-title":"High-Speed and Low-Latency ECC Processor Implementation Over GF (2m) on FPGA","volume":"25","author":"Khan","year":"2017","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"ref_37","first-page":"1078","article-title":"Throughput\/area-efficient ECC processor using Montgomery point multiplication on FPGA","volume":"62","author":"Benaissa","year":"2015","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s13369-016-2272-6","article-title":"High-performance generic-point parallel scalar multiplication","volume":"42","year":"2017","journal-title":"Arab. J. Sci. Eng."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"32048","DOI":"10.1109\/ACCESS.2019.2903170","article-title":"Speed-Oriented Architecture for Binary Field Point Multiplication on Elliptic Curves","volume":"7","author":"Li","year":"2019","journal-title":"IEEE Access"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Harb, S., and Jarrah, M. (2019). FPGA implementation of the ECC over GF(2m) for small embedded applications. ACM Trans. Embed. Comput. Syst., 18.","DOI":"10.1145\/3310354"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Kumar, N., and Shirisha, C. (2020). An area-efficient ECC architecture over GF(2m) for resource-constrained applications. AEU Int. J. Electron. Commun., 125.","DOI":"10.1016\/j.aeue.2020.153383"},{"key":"ref_42","unstructured":"National Institute of Standards and Technology (2000). FIPS PUB 186-2: Digital Signature Standard (DSS)."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Farashahi, R.R., and Joye, M. (2010, January 26\u201328). Efficient arithmetic on Hessian curves. Proceedings of the International Workshop on Public Key Cryptography, Paris, France.","DOI":"10.1007\/978-3-642-13013-7_15"},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Kocaba\u015f, \u00dc., Fan, J., and Verbauwhede, I. (2010, January 7\u20139). Implementation of binary Edwards curves for very-constrained devices. Proceedings of the ASAP 2010-21st IEEE International Conference on Application-specific Systems, Architectures and Processors, Rennes, France.","DOI":"10.1109\/ASAP.2010.5541003"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Devigne, J., and Joye, M. (2011, January 14\u201318). Binary Huff curves. Proceedings of the Cryptographers Track at the RSA Conference, San Francisco, CA, USA.","DOI":"10.1007\/978-3-642-19074-2_22"},{"key":"ref_46","unstructured":"Choi, Y.J., Kim, M.S., Lee, H.R., and Kim, H.W. (2005). Implementation and Analysis of Elliptic Curve Cryptosystems over Polynomial Basis and Onb, World Academy of Science, Engineering and Technology."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","article-title":"A Fast Algorithm for Computing Multiplicative Inverses in GF(2M) Using Normal Bases","volume":"78","author":"Itoh","year":"1988","journal-title":"Inf. Comput."},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Patil, S., Manjunatha, D.V., and Kiran, D. (2014, January 10\u201311). Design of speed and power efficient multipliers using vedic mathematics with VLSI implementation. Proceedings of the 2014 International Conference on Advances in Electronics Computers and Communications, Bangalore, India.","DOI":"10.1109\/ICAECC.2014.7002484"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF00203817","article-title":"Elliptic curve cryptosystems and their implementation","volume":"6","author":"Menezes","year":"1993","journal-title":"J. Cryptol."}],"container-title":["Journal of Sensor and Actuator Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2224-2708\/10\/1\/3\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:48:30Z","timestamp":1760179710000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2224-2708\/10\/1\/3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,31]]},"references-count":49,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,3]]}},"alternative-id":["jsan10010003"],"URL":"https:\/\/doi.org\/10.3390\/jsan10010003","relation":{},"ISSN":["2224-2708"],"issn-type":[{"value":"2224-2708","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12,31]]}}}