Low-Complexity One-Dimensional Parallel Semi-Systolic Structure for Field Montgomery Multiplication Algorithm Perfect for Small IoT Edge Nodes

Simple item page
dc.contributor.authorIbrahim, Atef
dc.contributor.authorTariq, Usman
dc.contributor.authorAhanger, Tariq A.
dc.contributor.authorGebali, Fayez
dc.date.accessioned2023-10-14T23:55:28Z
dc.date.available2023-10-14T23:55:28Z
dc.date.copyright2022en_US
dc.date.issued2022
dc.description.abstractThe use of IoT technology in several applications is hampered by security and privacy concerns with IoT edge nodes. Security flaws can only be resolved by implementing cryptographic protocols on these nodes. The resource constraints of the edge nodes make it extremely difficult to implement these protocols. The majority of cryptographic protocols’ fundamental operation is finite-field multiplication, and their performance is significantly impacted by their effective implementation. Therefore, this work mainly focuses on implementing low-area with low-energy and high-speed one-dimensional bit-parallel semi-systolic multiplier for the Montgomery multiplication algorithm. The space and delay complexity analysis of the proposed multiplier structure reveals that the proposed design has a significant reduction in delay and a marginal reduction in the area when compared to the competitive one-dimensional multipliers. The obtained ASIC synthesis report demonstrates that the suggested multiplier architecture saves a marginal amount of space as well as a significant amount of time, area–delay product (ADP), and power–delay product (PDP) when compared to the competitive ones. The obtained results indicate that the proposed multiplier layout is very appropriate for use in devices with limited resources such as IoT edge nodes and tiny embedded devices.en_US
dc.description.reviewstatusRevieweden_US
dc.description.scholarlevelFacultyen_US
dc.description.sponsorshipDeputyship for Research & Innovation, Ministry of Education in Saudi Arabia, project number (IF2-PSAU-2022/01/21637).en_US
dc.identifier.citationIbrahim, A., Tariq, U., Ahanger, T. A., & Gebali, F. (2022). Low-Complexity One-Dimensional Parallel Semi-Systolic Structure for Field Montgomery Multiplication Algorithm Perfect for Small IoT Edge Nodes. Mathematics, 11(1), 111. https://doi.org/10.3390/math11010111en_US
dc.identifier.urihttps://doi.org/10.3390/math11010111
dc.identifier.urihttp://hdl.handle.net/1828/15505
dc.language.isoenen_US
dc.publisherMathematicsen_US
dc.subjectmodular arithmetic
dc.subjectcryptography
dc.subjectubiquitous computing
dc.subjectsecurity
dc.subjectIoT applications
dc.subjectsystolic and semi-systolic multipliers
dc.subjectcyber-physical systems
dc.subjectembedded systems
dc.subject.departmentDepartment of Electrical and Computer Engineering
dc.titleLow-Complexity One-Dimensional Parallel Semi-Systolic Structure for Field Montgomery Multiplication Algorithm Perfect for Small IoT Edge Nodesen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ibrahim_atef_mathematics_2022_FINAL.pdf
Size:
368.12 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Faculty and Staff Publications
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.