Compact modular multiplier design for strong security capabilities in resource-limited Telehealth IoT devices
Authors:
- Atef IbrahimAIAtef Ibrahim
- Fayez GebaliFGFayez Gebali
Open Access
- 1 October 2022
- journal article
- research article
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 34 (9) , 6847-6854
Abstract
No abstract availableKeywords
Funding Information
- National Research Council Canada (51291–52200)
This publication has 30 references indexed in Scilit:
- Low space-complexity and low power semi-systolic multiplier architectures over GF(2m) based on irreducible trinomialMicroprocessors and Microsystems, 2016
- Low-Latency High-Throughput Systolic Multipliers Over $GF(2^{m})$ for NIST Recommended PentanomialsIEEE Transactions on Circuits and Systems I: Regular Papers, 2015
- Security for the Internet of Things: A Survey of Existing Protocols and Open Research IssuesIEEE Communications Surveys & Tutorials, 2015
- Efficient systolic modular multiplier/squarer for fast exponentiation over GF(2m)IEICE Electronics Express, 2015
- Efficient Scalable Serial Multiplier Over GF( $\textbf {2}^{\boldsymbol {m}}$ ) Based on TrinomialIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2014
- Polynomial Basis Multiplier Using Cellular Systolic ArchitectureIETE Journal of Research, 2014
- The Internet of Things: A surveyComputer Networks, 2010
- Low Complexity Digit Serial Systolic Montgomery Multipliers for Special Class of ${\rm GF}(2^{m})$IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2009
- Scalable and systolic Montgomery multiplier over GF(2
m
) generated by trinomialsIET Circuits, Devices & Systems, 2007
- Concurrent Error Detection in Montgomery Multiplication over GF(2m)IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006