Bit-serial and bit-parallel montgomery multiplication and squaring over GF (2^ m)
Multiplication and squaring are main finite field operations in cryptographic computations
and designing efficient multipliers and squarers affect the performance of cryptosystems. In …
and designing efficient multipliers and squarers affect the performance of cryptosystems. In …
Efficient utilization of elliptic curve cryptosystem for hierarchical access control
The elliptic curve cryptosystem (ECC) has recently received significant attention by
researchers due to its high performance, low computational cost, and small key size. In this …
researchers due to its high performance, low computational cost, and small key size. In this …
Low-power and high-speed design of a versatile bit-serial multiplier in finite fields GF (2m)
In this paper, a novel architecture for a versatile polynomial basis multiplier over GF (2m) is
presented. The proposed architecture provides an efficient execution of the Most Significant …
presented. The proposed architecture provides an efficient execution of the Most Significant …
A scalable digit-parallel polynomial multiplier architecture for NIST-standardized binary elliptic curves
This work presents a scalable digit-parallel finite field polynomial multiplier architecture with
a digit size of 32 bits for NIST-standardized binary elliptic fields. First, a dedicated digit …
a digit size of 32 bits for NIST-standardized binary elliptic fields. First, a dedicated digit …
[PDF][PDF] Design and Implementation of a Sequential Polynomial Basis Multiplier over GF(2m)
Finite field arithmetic over GF ($2^ m $) is used in a variety of applications such as
cryptography, coding theory, computer algebra. It is mainly used in various cryptographic …
cryptography, coding theory, computer algebra. It is mainly used in various cryptographic …
Improved throughput bit-serial multiplier for GF (2m) fields
High throughput is a crucial factor in bit-serial GF (2m) fields multiplication for a variety of
different applications including cryptography, error coding detection and computer algebra …
different applications including cryptography, error coding detection and computer algebra …
[HTML][HTML] Low-complexity systolic array structure for field multiplication in resource-constrained IoT nodes
A Ibrahim - Ain Shams Engineering Journal, 2023 - Elsevier
Security and privacy issues with Internet of Things (IoT) network make it difficult to use IoT
technology. Cryptographic protocols can be put in place on IoT edge nodes to address …
technology. Cryptographic protocols can be put in place on IoT edge nodes to address …
Symmetry-Enabled Resource-Efficient Systolic Array Design for Montgomery Multiplication in Resource-Constrained MIoT Endpoints
In today's TEST interconnected world, the security of 5G Medical IoT networks is of
paramount concern. The increasing number of connected devices and the transmission of …
paramount concern. The increasing number of connected devices and the transmission of …
Enhancing Field Multiplication in IoT Nodes with Limited Resources: A Low-Complexity Systolic Array Solution
Security and privacy concerns pose significant obstacles to the widespread adoption of IoT
technology. One potential solution to address these concerns is the implementation of …
technology. One potential solution to address these concerns is the implementation of …
[HTML][HTML] Low complexity design of bit parallel polynomial basis systolic multiplier using irreducible polynomials
S Devi, R Mahajan, D Bagai - Egyptian Informatics Journal, 2022 - Elsevier
Encryption schemes like AES require finite field modular multiplication. The encryption
speed is highly dependent on the performance of the finite field multiplier. Several high …
speed is highly dependent on the performance of the finite field multiplier. Several high …