Low-complexity bit-serial sequential polynomial basis finite field GF(2m) Montgomery multipliers-Reference-Cited by-同舟云学术

Low-complexity bit-serial sequential polynomial basis finite field GF(2m) Montgomery multipliers

Published:2021-07 Issue: Volume:84 Page:104053
ISSN:0141-9331
Container-title:Microprocessors and Microsystems
language:en
Short-container-title:Microprocessors and Microsystems

Author:

Pillutla Siva Ramakrishna^ORCID,Boppana Lakshmi

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Software

Reference39 articles.

1. Delay-aware concurrent data management method for IoT collaborative mobile edge computing environment;Kavitha;Microprocess. Microsyst.,2020

2. Security issues in the Internet of Things (IoT): a comprehensive study;Razzaq;Int. J. Adv. Comput. Sci. Appl.,2017

3. Network-level security and privacy control for smart-home IoT devices;Sivaraman,2015

4. Lightweight cryptography for the Internet of Things;Katagi;Sony Corp.,2008

5. An energy-efficient dual-field elliptic curve cryptography processor for internet of things applications;Yeh;IEEE Trans. Circ. Syst. II Express Briefs,2020

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

1. Image encryption algorithm based on optical chaos and quadrature amplitude modulation-like;Optical Engineering;2024-06-07

2. High-performance unified modular multiplication algorithm and hardware architecture over G(2m);Integration;2024-05

3. Pseudo-Chaotic Sequences Generated by the Discrete Arnold’s Map Over Z_2^m: Period Analysis and FPGA Implementation;IEEE Transactions on Instrumentation and Measurement;2022