Low-complexity systolic array structure for field multiplication in resource-constrained IoT nodes-Reference-Cited by-同舟云学术

Low-complexity systolic array structure for field multiplication in resource-constrained IoT nodes

Published:2023-10 Issue:10 Volume:14 Page:102188
ISSN:2090-4479
Container-title:Ain Shams Engineering Journal
language:en
Short-container-title:Ain Shams Engineering Journal

Author:

Ibrahim Atef

Funder

Prince Sattam bin Abdulaziz University

Publisher

Elsevier BV

Subject

General Engineering

Reference39 articles.

1. Handbook of Applied Cryptography;Blahut,1996

2. Theory and Practice of Error Control Codes;Blahut,1983

3. A common-multiplicand method to the montgomery algorithm for speeding up exponentiation;Haa;Inform Process Lett,1998

4. Linear systolic multiplier/squarer for fast exponentiation;Lee;Inform Process Lett,2000

5. Song L, Parhi KK. Efficient finite field serial/parallel multiplication. In: Proceedings of the IEEE 1996 international conference on application-specific architectures and processors; 1996. p. 72–82.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Input–Output Scheduling and Control for Efficient FPGA Realization of Digit-Serial Multiplication Over Generic Binary Extension Fields;Circuits, Systems, and Signal Processing;2024-08-07

2. Exploration of the Role of Cryptoprocessors in Advancing IoT Security;2024 20th International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT);2024-04-29

3. Digit-Size Selection for FPGA Implementation of Generic Digit-Serial Multiplication Over GF(2m);2023 1st International Conference on Circuits, Power and Intelligent Systems (CCPIS);2023-09-01