Blockchain technology entered the enterprise domain under the name of permissioned
blockchains and hybrid or verifiable database systems, as they provide a distributed solution …

Modular multiplication is a crucial operation in public-key cryptography systems such as
RSA and ECC. In this study, we analyze and improve the iteration steps of the classic …

Fully homomorphic encryption (FHE) promises data protection by computation on encrypted
data, but demands resource-intensive computation. The most fundamental resource of FHE …

Modular multiplication (MM) is a fundamental operation in many cryptographic and
arithmetic applications. In this article, we present an improved Barrett modular multiplication …

High-radix Montgomery Modular Multiplication (MMM) is flexible and consumes fewer
cycles, but turns inefficient especially when it comes to low-bit calculation. In this brief, we …

This paper presents a highly efficient iterative Montgomery modular multiplication algorithm,
wherein the computations of quotient and intermediate result in each iteration are done in …

As security and privacy continue to grow in importance, new techniques, including fully
homomorphic encryption (FHE) and post-quantum cryptography (PQC), have emerged to …

This paper presents an FPGA-based Montgomery modular multiplier for implementing high-
throughput RSA cryptosystems. First, we propose a variable segmentation Montgomery …

This work presents an analysis of the power con-sumption of different radix implementations
of Montgomery multiplication (MM). Different MM architectures are discussed and a new …

Modular multiplication is the most critical and time-consuming operation in numerous public-
key cryptosystems used to establish secure networks. Especially in Internet of Things (IoT) …