{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:05:44Z","timestamp":1767704744555,"version":"build-2065373602"},"reference-count":59,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T00:00:00Z","timestamp":1743897600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100019345","name":"King Salman Center for Disability Research","doi-asserted-by":"publisher","award":["KSRG-2024-207"],"award-info":[{"award-number":["KSRG-2024-207"]}],"id":[{"id":"10.13039\/501100019345","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>Radio Frequency Identification (RFID) assistive systems, which integrate RFID devices with IoT technologies, are vital for enhancing the independence, mobility, and safety of individuals with disabilities. These systems enable applications such as RFID navigation for blind users and RFID-enabled canes that provide real-time location data. Central to these systems are resource-constrained RFID devices that rely on RFID tags to collect and transmit data, but their limited computational capabilities make them vulnerable to cyberattacks, jeopardizing user safety and privacy. Implementing the Elliptic Curve Cryptography (ECC) algorithm is essential to mitigate these risks; however, its high computational complexity exceeds the capabilities of these devices. The fundamental operation of ECC is finite field multiplication, which is crucial for securing data. Optimizing this operation allows ECC computations to be executed without overloading the devices\u2019 limited resources. Traditional multiplication designs are often unsuitable for such devices due to their excessive area and energy requirements. Therefore, this work tackles these challenges by proposing an efficient and compact field multiplier design optimized for the Montgomery multiplication algorithm, a widely used method in cryptographic applications. The proposed design significantly reduces both space and energy consumption while maintaining computational performance, making it well-suited for resource-constrained environments. ASIC synthesis results demonstrate substantial improvements in key metrics, including area, power consumption, Power-Delay Product (PDP), and Area-Delay Product (ADP), highlighting the multiplier\u2019s efficiency and practicality. This innovation enables the implementation of ECC on RFID assistive devices, enhancing their security and reliability, thereby allowing individuals with disabilities to engage with assistive technologies more safely and confidently.<\/jats:p>","DOI":"10.3390\/computers14040135","type":"journal-article","created":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T03:23:07Z","timestamp":1743996187000},"page":"135","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Enhancing Cryptographic Solutions for Resource-Constrained RFID Assistive Devices: Implementing a Resource-Efficient Field Montgomery Multiplier"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1115-4051","authenticated-orcid":false,"given":"Atef","family":"Ibrahim","sequence":"first","affiliation":[{"name":"Computer Engineering Department, College of Computer Engineering and Sciences, Prince Sattam Bin Abdulaziz University, Al-Kharj 16278, Saudi Arabia"},{"name":"King Salman Center for Disability Research, Riyadh 11614, Saudi Arabia"}]},{"given":"Fayez","family":"Gebali","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering Department, University of Victroia, Victoria, BC V8P 5C2, Canada"}]}],"member":"1968","published-online":{"date-parts":[[2025,4,6]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"20240012","DOI":"10.57197\/JDR-2024-0012","article-title":"A Review on Internet of Things (IoT)-Related Disabilities and Their Implications","volume":"3","author":"Semary","year":"2024","journal-title":"J. Disabil. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1080\/19393555.2022.2100297","article-title":"Blending cybersecurity education with IoT devices: A u-Learning scenario for introducing the man-in-the-middle attack","volume":"32","author":"Giannakas","year":"2023","journal-title":"Inf. Secur. J. A Glob. Perspect."},{"key":"ref_3","first-page":"20240093","article-title":"SecuTwin for All: Enhancing Disability-focused Healthcare Through Secure Digital Twin Technology and Connected Health Monitoring","volume":"3","author":"Almogren","year":"2024","journal-title":"J. Disabil. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"6338","DOI":"10.1109\/JSEN.2023.3242132","article-title":"Lightweight cloud computing-based RFID authentication protocols using PUF for e-healthcare systems","volume":"23","author":"Lee","year":"2023","journal-title":"IEEE Sens. J."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"18486","DOI":"10.1109\/JIOT.2023.3283347","article-title":"Securing iot-based smart healthcare systems by using advanced lightweight privacy-preserving authentication scheme","volume":"10","author":"Das","year":"2023","journal-title":"IEEE Internet Things J."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/JIOT.2014.2360121","article-title":"An analysis of RFID authentication schemes for internet of things in healthcare environment using elliptic curve cryptography","volume":"2","author":"He","year":"2014","journal-title":"IEEE Internet Things J."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1656","DOI":"10.1109\/TII.2018.2794996","article-title":"Lightweight RFID protocol for medical privacy protection in IoT","volume":"14","author":"Fan","year":"2018","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"7452","DOI":"10.1109\/ACCESS.2017.2780124","article-title":"A robust mutual authentication scheme based on elliptic curve cryptography for telecare medical information systems","volume":"6","author":"Qiu","year":"2017","journal-title":"IEEE Access"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Peri\u0161a, M., Teskera, P., Cviti\u0107, I., and Grgurevi\u0107, I. (2025). Empowering People with Disabilities in Smart Homes Using Predictive Informing. Sensors, 25.","DOI":"10.3390\/s25010284"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.3390\/smartcities7040062","article-title":"The role of smart homes in providing care for older adults: A systematic literature review from 2010 to 2023","volume":"7","author":"Zadravec","year":"2024","journal-title":"Smart Cities"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"17666","DOI":"10.1109\/JIOT.2023.3278411","article-title":"IoT-QWatch: A novel framework to support the development of quality-aware autonomic IoT applications","volume":"10","author":"Fizza","year":"2023","journal-title":"IEEE Internet Things J."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"15714","DOI":"10.1109\/JIOT.2022.3151364","article-title":"Physical-layer detection and security of printed chipless RFID tag for internet of things applications","volume":"9","author":"Khadka","year":"2022","journal-title":"IEEE Internet Things J."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1007\/s12083-023-01620-8","article-title":"Secret sharing based RFID protocol using ECC for TMIS","volume":"17","author":"Ghosh","year":"2024","journal-title":"Peer-to-Peer Netw. Appl."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"37703","DOI":"10.1109\/ACCESS.2025.3546147","article-title":"A Review of Lightweight IoT Authentication Protocols from the Perspective of Security Requirements, Computation, Communication, and Hardware Costs","volume":"13","author":"Cetintav","year":"2025","journal-title":"IEEE Access"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Kumar, S., Banka, H., and Kaushik, B. (2024). Lightweight group authentication protocol for secure RFID system. Multimedia Tools and Applications, Springer.","DOI":"10.1007\/s11042-024-19013-1"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/JRFID.2024.3359705","article-title":"Novel Light Weight Hardware Authentication Protocol for Resource Constrained IOT Based Devices","volume":"8","author":"Vijaykumar","year":"2024","journal-title":"IEEE J. Radio Freq. Identif."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"18140","DOI":"10.1109\/JIOT.2023.3279035","article-title":"Lightweight authentication scheme for healthcare with robustness to desynchronization attacks","volume":"10","author":"Shihab","year":"2023","journal-title":"IEEE Internet Things J."},{"key":"ref_18","unstructured":"Wang, Y., Liu, R., Gao, T., Shu, F., Lei, X., Wu, Y., Gui, G., and Wang, J. (2024). A novel RFID authentication protocol based on a block-order-modulus variable matrix encryption algorithm. arXiv."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s00145-021-09398-9","article-title":"Ascon v1. 2: Lightweight authenticated encryption and hashing","volume":"34","author":"Dobraunig","year":"2021","journal-title":"J. Cryptol."},{"key":"ref_20","unstructured":"Banik, S., Chakraborti, A., Inoue, A., Iwata, T., Minematsu, K., Nandi, M., Peyrin, T., Sasaki, Y., Sim, S.M., and Todo, Y. (2020). Gift-cofb. Cryptology, ePrint Archive."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1763","DOI":"10.1093\/ietfec\/e91-a.7.1763","article-title":"Scalable and Systolic Montgomery Multipliers Over GF(2m)","volume":"E91-A","author":"Chen","year":"2008","journal-title":"IEICE Trans. Fundam."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1093\/ietfec\/e89-a.2.566","article-title":"Concurrent error detection in Montgomery multiplication over GF(2m)","volume":"89","author":"Chiou","year":"2006","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1049\/iet-ifs.2009.0160","article-title":"Concurrent error detection and correction in a polynomial basis multiplier over GF(2m)","volume":"4","author":"Huang","year":"2010","journal-title":"IET Inf. Secur."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1080\/03772063.2014.914699","article-title":"Polynomial Basis Multiplier Using Cellular Systolic Architecture","volume":"60","author":"Kim","year":"2014","journal-title":"IETE J. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"20150222","DOI":"10.1587\/elex.12.20150222","article-title":"Efficient systolic modular multiplier\/squarer for fast exponentiation over GF(2m)","volume":"12","author":"Choi","year":"2015","journal-title":"IEICE Electron. Express"},{"key":"ref_26","unstructured":"Reyhani-Masoleh, A. (2008, January 10\u201313). A new bit-serial architecture for field multiplication using polynomial bases. Proceedings of the 7th International Workshop Cryptographic Hardware Embedded Systems (CHES 2008), Washington, DC, USA."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1734","DOI":"10.1109\/TC.2015.2456023","article-title":"High-Speed Hybrid-Double Multiplication Architectures Using New Serial-Out Bit-Level Mastrovito Multipliers","volume":"65","author":"Abdulrahman","year":"2016","journal-title":"IEEE Trans. Comput."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"20150769","DOI":"10.1587\/elex.12.20150769","article-title":"A semi-systolic Montgomery multiplier over GF(2m)","volume":"12","author":"Kim","year":"2015","journal-title":"IEICE Electron. Express"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"20190600","DOI":"10.1587\/elex.16.20190600","article-title":"Novel Bit-Serial Semi-Systolic Array Structure for Simultaneously Computing Field Multiplication and Squaring","volume":"16","author":"Ibrahim","year":"2019","journal-title":"IEICE Electron. Express"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"20170458","DOI":"10.1587\/elex.14.20170458","article-title":"Efficient unified semi-systolic arrays for multiplication and squaring over GF(2m)","volume":"14","author":"Kim","year":"2017","journal-title":"Electron. Express"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1587\/elex.14.20171195","article-title":"Efficient bit-parallel systolic architecture for multiplication and squaring over GF(2m)","volume":"15","author":"Kim","year":"2018","journal-title":"IEICE Electron. Express"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1109\/CJECE.2019.2900087","article-title":"Efficient Parallel and Serial Systolic Structures for Multiplication and Squaring Over GF (2m)","volume":"42","author":"Ibrahim","year":"2019","journal-title":"Can. J. Electr. Comput. Eng."},{"key":"ref_33","unstructured":"Roman, S. (1983). Field Theory, Springer. [2nd ed.]."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"104709","DOI":"10.1016\/j.mejo.2020.104709","article-title":"Area-efficient low-latency polynomial basis finite field GF(2m) systolic multiplier for a class of trinomials","volume":"97","author":"Pillutla","year":"2020","journal-title":"Microelectron. J."},{"key":"ref_35","first-page":"156","article-title":"LFSR-Based Bit-Serial GF(2m) Multipliers Using Irreducible Trinomials","volume":"70","author":"Imana","year":"2020","journal-title":"IEEE Trans. Comput."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"105275","DOI":"10.1016\/j.mejo.2021.105275","article-title":"Low-latency area-efficient systolic bit-parallel GF(2m) multiplier for a narrow class of trinomials","volume":"117","author":"Pillutla","year":"2021","journal-title":"Microelectron. J."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1109\/TC.2021.3058346","article-title":"An Efficient CRT-based Bit-parallel Multiplier for Special Pentanomials","volume":"71","author":"Li","year":"2021","journal-title":"IEEE Trans. Comput."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"2459","DOI":"10.1109\/TVLSI.2020.3021195","article-title":"Fast hybrid Karatsuba multiplier for type II pentanomials","volume":"28","author":"Li","year":"2020","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/TCSI.2016.2614309","article-title":"Low-Latency, Low-Area, and Scalable Systolic-Like Modular Multipliers for GF(2m) Based on Irreducible All-One Polynomials","volume":"64","author":"Meher","year":"2016","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Mohaghegh, S., Yemiscoglu, G., and Muhtaroglu, A. (2020, January 10\u201321). Low-Power and Area-Efficient Finite Field Multiplier Architecture Based on Irreducible All-One Polynomials. Proceedings of the 2020 IEEE International Symposium on Circuits and Systems (ISCAS), Sevilla, Spain.","DOI":"10.1109\/ISCAS45731.2020.9181179"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1587\/transfun.2020EAL2074","article-title":"Efficient Hybrid GF(2m) Multiplier for All-One Polynomial Using Varied Karatsuba Algorithm","volume":"104","author":"Zhang","year":"2021","journal-title":"IEICE Trans. Fundam. Electron. Comput. Sci."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1109\/12.2216","article-title":"A New Bit Serial Systolic Multiplier over GF(2m)","volume":"37","author":"Zhou","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-9260(95)00007-3","article-title":"A Dual Basis Bit Serial Systolic Multiplier for GF(2m)","volume":"18","author":"Fenn","year":"1995","journal-title":"Integr. VLSI J"},{"key":"ref_44","first-page":"358","article-title":"Bit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally-Spaced Polynomials","volume":"50","author":"Lee","year":"2001","journal-title":"IEEE Trans. Comput."},{"key":"ref_45","first-page":"519","article-title":"Low-Complexity Bit-Parallel Systolic Architecture for Computing AB2+C in a Class of Finite Field GF(2m)","volume":"50","author":"Lee","year":"2001","journal-title":"IEEE Trans. Circuits Syst. II"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"3169","DOI":"10.1093\/ietfec\/e88-a.11.3169","article-title":"Efficient Design of Low-Complexity Bit-Parallel Systolic Hankel Multipliers to Implement Multiplication in Normal and Dual Bases of GF(2m)","volume":"E88-A","author":"Lee","year":"2005","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"ref_47","first-page":"828","article-title":"Low-latency bit-pararallel systolic multiplier for irreducible xm+xn+1 with GCD(m, n) = 1","volume":"55","author":"Lee","year":"2008","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"ref_48","first-page":"377","article-title":"High-Throughput Low-Complexity Systolic Montgomery Multiplication Over GF(2m) Based on Trinomials","volume":"62","author":"Farmani","year":"2015","journal-title":"IEEE Trans. Circ. Sys.-II"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1049\/iet-cds.2017.0426","article-title":"Bit-parallel systolic multiplier over GF(2m) for irreducible trinomials with ASIC and FPGA implementations","volume":"12","author":"Mathe","year":"2018","journal-title":"IET Circuits Desvices Syst."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10836-006-7446-9","article-title":"Concurrent error detection in a polynomial basis multiplier over GF (2m)","volume":"22","author":"Lee","year":"2006","journal-title":"J. Electron. Test."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1049\/iet-cdt.2017.0209","article-title":"High-throughput Dickson basis multiplier with a trinomial for lightweight cryptosystems","volume":"12","author":"Chiou","year":"2018","journal-title":"IET Comput. Digit. Tech."},{"key":"ref_52","first-page":"1","article-title":"Resource and Delay Efficient Polynomial Multiplier over Finite Fields GF(2m)","volume":"16","author":"Lee","year":"2020","journal-title":"J. Korea Soc. Digit. Ind.Inf. Manag."},{"key":"ref_53","first-page":"1","article-title":"Low Complexity Systolic Montgomery Multiplication over Finite Fields GF(2m)","volume":"18","author":"Lee","year":"2022","journal-title":"J. Korea Soc. Digit. Ind. Inf. Manag."},{"key":"ref_54","first-page":"2680","article-title":"Design and Implementation of a Sequential Polynomial Basis Multiplier over GF(2m)","volume":"11","author":"Mathe","year":"2017","journal-title":"KSII Trans. Internet Inf. Syst."},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Gebali, F. (2011). Algorithms and Parallel Computers, John Wiley.","DOI":"10.1002\/9780470932025"},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"2894","DOI":"10.1109\/TCSI.2017.2691353","article-title":"Scalable and Unified Digit-Serial Processor Array Architecture for Multiplication and Inversion over GF(2m)","volume":"22","author":"Ibrahim","year":"2017","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/CJECE.2016.2638962","article-title":"New Systolic Array Architecture for Finite Field Inversion","volume":"40","author":"Ibrahim","year":"2017","journal-title":"IEEE Can. J. Electr. Comput. Eng."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Chiou, C.W., Lin, J.M., Lee, C.Y., and Ma, C.T. (September, January 29). Novel Mastrovito Multiplier over GF(2m) Using Trinomial. Proceedings of the 2011 5th International Conference on Genetic and Evolutionary Computing (ICGEC), Kitakyushu, Japan.","DOI":"10.1109\/ICGEC.2011.63"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1109\/ICJECE.2020.3035182","article-title":"Compact Bit-Parallel Systolic Multiplier Over GF(2m)","volume":"44","author":"Ibrahim","year":"2021","journal-title":"IEEE Can. J. Electr. Comput. Eng."}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/14\/4\/135\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:11:05Z","timestamp":1760029865000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/14\/4\/135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,6]]},"references-count":59,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,4]]}},"alternative-id":["computers14040135"],"URL":"https:\/\/doi.org\/10.3390\/computers14040135","relation":{},"ISSN":["2073-431X"],"issn-type":[{"type":"electronic","value":"2073-431X"}],"subject":[],"published":{"date-parts":[[2025,4,6]]}}}