Modular multiplication is a pivotal operation in public-key cryptosystems such as RSA, ElGamal, and ECC. Modular multiplication design is crucial for improving overall system performance due to the large-bit-width operation with high computational co...
Elliptic curve cryptography (ECC) over prime fields relies on scalar point multiplication realized by point addition and point doubling. Point addition and point doubling operations consist of many modular multiplications of large operands (256 bits...
Modular exponentiation is among the most demanding computational operations in cryptographic systems. Effective computation of modular exponentiation is most beneficial for public-key cryptography. The computational complexity and the growing number...
In the field of cryptography, many algorithms rely on the computation of modular multiplicative inverses to ensure the security of their systems. In this study, we build upon our previous research by introducing a novel sequence,
In literature, there are a number of cryptographic algorithms (RSA, ElGamal, NTRU, etc.) that require multiple computations of modulo multiplicative inverses. In this paper, we describe the modulo operation and we recollect the main approaches to com...
The global expansion of interconnected edge network components requires immediate strategies for securing low-power computing nodes. Cryptographic algorithms executing over binary extension fields yield considerable computational benefits because the...
If we look at the history of renewable energy sources (RESs), how it all began, and how rapidly they continue to develop, it can be argued that one of the main reasons is due to the rapid improvements in power electronics technology in interfacing th...
Aiming at the problems of low thermal analysis efficiency and high computational cost of traditional computational fluid dynamics (CFD) methods for modular fault-tolerant permanent magnet synchronous motors (MFT-PMSMs) under complex working condition...
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 cryptographic protocols on resource-constrained IoT edge nodes. However,...
Modular reduction of large values is a core operation in most common public-key cryptosystems that involves intensive computations in finite fields. Within such schemes, efficiency is a critical issue for the effectiveness of practical implementation...
The Number Theoretic Transform (NTT) has been widely used to speed up polynomial multiplication in lattice-based post-quantum algorithms. All NTT operands use modular arithmetic, especially modular multiplication, which significantly influences NTT h...
Polynomial multiplication is the main operation in lattice-based cryptography. Modular reduction is required to maintain the correctness within finite rings. In this study, the application of lazy reduction is chosen to reduce the frequency of modula...
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 Montgomery modular multiplication (MMM) algorithm and propose an interleave...
The SM2 public key cryptographic algorithm is widely utilized for secure communication and data protection due to its strong security and compact key size. However, the intensive large integer operations it requires pose significant computational cha...
The Montgomery modular multiplication is an integral operation unit in the public key cryptographic algorithm system. Previous work achieved good performance at low input widths by combining Redundant Binary Representation (RBR) with Montgomery modul...
Twisted Edwards curves have been at the center of attention since their introduction by Bernstein et al. in 2007. The curve ED25519, used for Edwards-curve Digital Signature Algorithm (EdDSA), provides faster digital signatures than existing schemes...
Elliptic Curve Factorization Method (ECM) is the general-purpose factoring method used in the digital computer era. It is based on the medium length of the modulus; ECM is an efficient algorithm when the length of modulus is between 40 and 50 digits....
Modular arithmetic over integers is required for many cryptography systems. Montgomery reduction is an efficient algorithm for the modulo reduction after a multiplication. Typically, Montgomery reduction is used for rings of ordinary integers. In con...
Toom–Cook-n multiplication is an efficient large-width multiplication algorithm based on a divide-and-conquer strategy, widely used in modular multiplication operations for cryptographic algorithms. Theoretically, as the degree n increases, Too...
Weigh-in-motion systems can measure the number of axles to obtain a vehicle’s type and upper limit of weight, which, combined with the weight measured by the system, can be used for highway toll collection and overload management. This paper pr...
Community detection is of great significance in understanding the structure of the network. Label propagation algorithm (LPA) is a classical and effective method, but it has the problems of randomness and instability. An improved label propagation al...
The development of quantum computers presents a great challenge for current cryptographic algorithms. Post-quantum cryptography has been proposed to secure against quantum computers in the near future. Modular polynomial multiplication is a frequent...
The Internet of Things requires greater attention to the security and privacy of the network. Compared to other public-key cryptosystems, elliptic curve cryptography can provide better security and lower latency with shorter keys, rendering it more s...
This article presents an area-aware unified hardware accelerator of Weierstrass, Edward, and Huff curves over
A common challenge for exoskeleton control is discerning operator intent to provide seamless actuation of the device with the operator. One way to accomplish this is with joint angle estimation algorithms and multiple sensors on the human–machi...
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 vast amounts of data necessitate robust measures to protect information in...
This paper presents a novel, scalable, and modular multiport power electronic topology for the integration of multiple resources. This converter is not only scalable in terms of the integration of multiple renewable energy resources (RES) and storage...
The Internet of Things (IoT) is an emerging technology that forms a huge network of different objects and intelligent devices. IoT Security is becoming more important due to the exchange of sensitive sensor data and the potential for incorporating th...
Privacy amplification is an indispensable procedure for key generation in the quantum key distribution system and the physical layer key distribution system. In this paper, we propose a high-speed privacy amplification algorithm that saves hardware m...
Cybersecurity is a critical issue for Real-Time IoT applications since high performance and low latencies are required, along with security requirements to protect the large number of attack surfaces to which IoT devices are exposed. Elliptic Curve C...
This paper presents a throughput/area-efficient hardware accelerator architecture for elliptic curve point multiplication (ECPM) computation over
The residue number system (RNS) is widely used in different areas due to the efficiency of modular addition and multiplication operations. However, non-modular operations, such as sign and division operations, are computationally complex. A fractiona...
Mobile networks management is increasingly critical due to heavy communications usage by customers and complex due to the multiple technologies and systems deployed. Thus, Mobile Network Operators (MNOs) are constantly looking for better software sol...
Mersenne prime numbers, expressed in the form (2n − 1), have long captivated researchers due to their unique properties. The presented work aims to develop a symmetric cryptographic algorithm using a novel technique based on the logical propert...
Hardware architecture optimized for implementing the elliptic-curve Diffie–Hellman ephemeral (ECDHE) on 256-bit Montgomery elliptic curves presents unique challenges, particularly for resource-constrained IoT and mobile devices. This work aims...
The practicality of post-quantum lattice-based schemes is crucial for their real-world applications. Integrating these schemes requires efficient implementations through hardware, software, and algorithmic optimisation to achieve the necessary speed...
In this paper, we present a high-speed, unified elliptic curve cryptography (ECC) processor for arbitrary Weierstrass curves over
In this paper, a low hardware consumption design of elliptic curve cryptography (ECC) over GF(p) in embedded applications is proposed. The adder-based architecture is explored to reduce the hardware consumption of performing scalar multiplication (SM...
Electronic stethoscopes address limitations of auscultation with analog stethoscopes, such as the dependency on the physicians’ hearing ability, their experience, and their subjective interpretation. However, electronic stethoscopes currently f...
Ensemble clustering is a promising approach that combines the results of multiple clustering algorithms to obtain a consensus partition by merging different partitions based upon well-defined rules. In this study, we use an ensemble clustering approa...
Addition is the most basic operation of computing based on a bit system. There are various addition algorithms considering multiple number systems and hardware, and studies for a more efficient addition are still ongoing. Quantum computing based on q...
The modular robotic arms can achieve desired performances in different scenarios through the combination of various modules, and concurrently hold the potential to exhibit geometric symmetry and uniform mass symmetry. Therefore, selecting the appropr...
This paper presents a fully original algorithm of graph SLAM developed for multiple environments—in particular, for tunnel applications where the paucity of features and the difficult distinction between different positions in the environment is a pr...
In this work, we present the highly optimized implementation of the HAETAE algorithm, submitted to the second round of the Korean Post-Quantum Cryptography (KpqC) competition and to the first round of NIST’s additional post-quantum standardizat...
We introduce the Convex Hull of Admissible Modularity Partitions (CHAMP) algorithm to prune and prioritize different network community structures identified across multiple runs of possibly various computational heuristics. Given a set of partitions,...
The functioning of complex systems relies on subsystems (modules) that in turn are composed of multiple units. In this paper, we focus on modular systems that might fail due to wear on their units or environmental conditions (shocks). The lifetimes o...
Small-to-medium sized systems able to perform multiple operations are a promising option for use in agricultural robotics. With this in mind, we present the conceptualization and implementation of a versatile and modular unmanned ground vehicle proto...
Spreader beams used in lifting operations undergo a purely compressive load to spread apart the ends of a sling which enables large payloads to be lifted from a single point, such as a crane hook, without damage. A modular spreader beam can be made u...
This research addresses the growing challenges of patient scheduling with limited medical resources, such as consultation and examination services. Based on the concept of a pipeline, multiple intelligent heuristic algorithms are considered to optimi...
Bipartite network community detection is of significant importance for understanding the underlying structure and functional organization of real-world complex systems. Although many mature community detection algorithms exist for unipartite networks...
of 4