{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T07:59:49Z","timestamp":1772697589044,"version":"3.50.1"},"reference-count":22,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T00:00:00Z","timestamp":1710720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Science and Technology, Taiwan","award":["MOST 111-2221-E-214-014"],"award-info":[{"award-number":["MOST 111-2221-E-214-014"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>This paper is aimed at using a lookup table method to improve the scalar multiplication performance of elliptic curve cryptography. The lookup table must be divided into two polynomials and requires two iterations of point doubling operation, for which negation operations are needed. It is well known that an inversion operation requires a lot of multiplication time. The advantage of this paper is that we are able to reduce one inverse element calculation for this problem and also improve the basic operations of finite fields through segmentation methods. If the normal basis method is used in the design of the inverse element operation, it must be converted to the normal basis through the standard basis. However, the conversion process requires a lot of matrix operations. Though the anti-element operation has good speed performance, it also increases the computational complexity. Using number theory and grouping methods will greatly improve the performance of inverse element operations. With application of the two-time point doubling operation in the hardware implementation, the developed approach reduces the computing time by 48% as compared with the conventional approach. The computational time of the scalar multiplication using the presented method is further improved by 67% over the traditional algorithm with only an area increase of 12%. Finally, the proposed lookup table-based technique can be utilized for software and hardware implementation, as the developed arithmetic operations are simple and are consistent in their execution.<\/jats:p>","DOI":"10.3390\/cryptography8010011","type":"journal-article","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T04:36:31Z","timestamp":1710822991000},"page":"11","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Lookup Table-Based Design of Scalar Multiplication for Elliptic Curve Cryptography"],"prefix":"10.3390","volume":"8","author":[{"given":"Yan-Duan","family":"Ning","sequence":"first","affiliation":[{"name":"Department of Electronic Engineering, National Kaohsiung University of Science and Technology, Kaohsiung 807618, Taiwan"}]},{"given":"Yan-Haw","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Information Engineering, I-Shou University, Kaohsiung 840301, Taiwan"}]},{"given":"Cheng-Sin","family":"Shih","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, National Kaohsiung University of Science and Technology, Kaohsiung 807618, Taiwan"}]},{"given":"Shao-I","family":"Chu","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, National Kaohsiung University of Science and Technology, Kaohsiung 807618, Taiwan"}]}],"member":"1968","published-online":{"date-parts":[[2024,3,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","article-title":"Elliptic curve crypto systems","volume":"48","author":"Koblitz","year":"1987","journal-title":"Math. Comput."},{"key":"ref_2","unstructured":"Miller, V. (1986). Advances in Cryptography-CRYPTO, Springer."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.29121\/ijetmr.v7.i6.2020.712","article-title":"Efficient Operations in Large Finite Fields for Elliptic Curve Cryptographic","volume":"7","author":"Chen","year":"2020","journal-title":"Int. J. Eng. Technol. Manag. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1051\/ita\/1990240605311","article-title":"Speeding Up the Computations on An Elliptic Curve Using Addition-Subtraction Chains","volume":"24","author":"Morain","year":"1990","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"ref_5","unstructured":"Solinas, J.A. (2001). Low-Weight Binary Representation for Pairs of Integers, Centre for Applied Cryptographic Research, University of Waterloo. Technical Report."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J. (1992). Advances in Cryptology-CRYPTO \u201891, Springer.","DOI":"10.1007\/3-540-46766-1"},{"key":"ref_7","first-page":"125","article-title":"Efficient Arithmetic on Koblitz Curves","volume":"Volume 19","author":"Koblitz","year":"2000","journal-title":"Towards a Quarter-Century of Public Key Cryptography: A Special Issue of Designs, Codes and Cryptography an International Journal"},{"key":"ref_8","unstructured":"Lange, T. (2004). A Note On L\u00f3pez-Dahab Coordinates, IACR Cryptology ePrint Archive, Paper 2004\/323."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1186\/s13638-021-01967-7","article-title":"Efficient Scalar Multiplication of ECC Using SMBR and Fast Septuple Formula for IoT","volume":"2021","author":"Guo","year":"2021","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"14819","DOI":"10.1007\/s11042-016-3272-y","article-title":"Faster Elliptic Curve Arithmetic for Triple-base Chain by Reordering Sequences of Field Operations","volume":"75","author":"Cho","year":"2016","journal-title":"Multimed. Tools Appl."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Di Matteo, S., Baldanzi, L., Crocetti, L., Nannipieri, P., Fanucci, L., and Saponara, S. (2021). Secure Elliptic Curve Crypto-Processor for Real-Time IoT Applications. Energies, 14.","DOI":"10.3390\/en14154676"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Imran, M., and Rashid, M. (2017, January 8\u20139). Architectural review of polynomial bases finite field multipliers over GF(2 m). Proceedings of the International Conference on Communication, Computing and Digital Systems (C-CODE), Islamabad, Pakistan.","DOI":"10.1109\/C-CODE.2017.7918952"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.micpro.2018.07.005","article-title":"High-speed FPGA implementation of full-word Montgomery multiplier for ECC applications","volume":"62","author":"Khan","year":"2018","journal-title":"Microprocess. Microsyst."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"SPillutla, R., and Boppana, L. (2019, January 17\u201320). A high-throughput fully digit-serial polynomial basis finite field GF(2 m) multiplier for IoT applications. Proceedings of the TENCON 2019\u20142019 IEEE Region 10 Conference (TENCON), Kochi, India.","DOI":"10.1109\/TENCON.2019.8929556"},{"key":"ref_15","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_16","doi-asserted-by":"crossref","first-page":"12405","DOI":"10.1109\/ACCESS.2021.3051282","article-title":"Innovative Dual-Binary-Field Architecture for Point Multiplication of Elliptic Curve Cryptography","volume":"9","author":"Li","year":"2021","journal-title":"IEEE Access"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1979","DOI":"10.1109\/TCSI.2021.3054781","article-title":"Radix-2w Arithmetic for Scalar Multiplication in Elliptic Curve Cryptography","volume":"68","author":"Oudjida","year":"2021","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"7926","DOI":"10.1109\/ACCESS.2022.3141104","article-title":"Efficient Hardware Implementation of Large Field-Size Elliptic Curve Cryptographic Processor","volume":"10","author":"Lee","year":"2022","journal-title":"IEEE Access"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1109\/TVLSI.2023.3321772","article-title":"High-Performance ECC Scalar Multiplication Architecture Based on Comb Method and Low-Latency Window Recoding Algorithm","volume":"32","author":"Zhang","year":"2024","journal-title":"IEEE Trans. Very Large Scale Integr. Syst."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1109\/TC.1985.1676616","article-title":"VLSI Architectures for Computing Multiplications and Inverses in GF(2 m)","volume":"100","author":"Wang","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"ref_21","unstructured":"National Institute of Standards and Technology (2023). Digital Signature Standard (DSS)."},{"key":"ref_22","unstructured":"National Institute of Standards and Technology (2013). Digital Signature Standard (DSS)."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/8\/1\/11\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:15:35Z","timestamp":1760105735000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/8\/1\/11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,18]]},"references-count":22,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,3]]}},"alternative-id":["cryptography8010011"],"URL":"https:\/\/doi.org\/10.3390\/cryptography8010011","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,18]]}}}