English
Related papers

Related papers: Area Efficient Modular Reduction in Hardware for A…

200 papers

Montgomery modular multiplication is widely-used in public key cryptosystems (PKC) and affects the efficiency of upper systems directly. However, modulus is getting larger due to the increasing demand of security, which results in a heavy…

Cryptography and Security · Computer Science 2026-03-17 Yuxuan Zhang , Hua Guo , Chen Chen , Yewei Guan , Xiyong Zhang , Zhenyu Guan

Securing communication channels is especially needed in wireless environments. But applying cipher mechanisms in software is limited by the calculation and energy resources of the mobile devices. If hardware is applied to realize…

Cryptography and Security · Computer Science 2011-11-09 Zoya Dyka , Peter Langendoerfer

Modular arithmetic, particularly modular reduction, is widely used in cryptographic applications such as homomorphic encryption (HE) and zero-knowledge proofs (ZKP). High-bit-width operations are crucial for enhancing security; however,…

Cryptography and Security · Computer Science 2025-05-28 Fangxin Liu , Haomin Li , Zongwu Wang , Bo Zhang , Mingzhe Zhang , Shoumeng Yan , Li Jiang , Haibing Guan

Barrett's algorithm is one of the most widely used methods for performing modular multiplication, a critical nonlinear operation in modern privacy computing techniques such as homomorphic encryption (HE) and zero-knowledge proofs (ZKP).…

Cryptography and Security · Computer Science 2025-11-06 Haomin Li , Fangxin Liu , Chenyang Guan , Zongwu Wang , Li Jiang , Haibing Guan

We describe the design and implementation of efficient signature and key-exchange schemes for the AVR ATmega and ARM Cortex M0 microcontrollers, targeting the 128-bit security level. Our algorithms are based on an efficient Montgomery…

Cryptography and Security · Computer Science 2016-04-21 Joost Renes , Peter Schwabe , Benjamin Smith , Lejla Batina

This paper presents a novel algorithm for the modulus operation for FPGA implementation. The proposed algorithm use only addition, subtraction, logical, and bit shift operations, avoiding the complexities and hardware costs associated with…

Cryptography and Security · Computer Science 2025-01-10 W. A. Susantha Wijesinghe

We present a novel set of reversible modular multipliers applicable to quantum computing, derived from three classical techniques: 1) traditional integer division, 2) Montgomery residue arithmetic, and 3) Barrett reduction. Each multiplier…

Quantum Physics · Physics 2018-01-04 Rich Rines , Isaac Chuang

CRYSTAL-Kyber (Kyber) is one of the post-quantum cryptography (PQC) key-encapsulation mechanism (KEM) schemes selected during the standardization process. This paper addresses optimization for Kyber architecture with respect to latency and…

Cryptography and Security · Computer Science 2023-12-05 Weihang Tan , Yingjie Lao , Keshab K. Parhi

Engineers manually optimizing a structure using Finite Element based simulation software often employ an iterative approach where in each iteration they change the structure slightly and resimulate. Standard Finite Element based simulation…

Numerical Analysis · Mathematics 2018-03-09 Andreas Buhr , Christian Engwer , Mario Ohlberger , Stephan Rave

Today every circuit has to face the power consumption issue for both portable device aiming at large battery life and high end circuits avoiding cooling packages and reliability issues that are too complex. It is generally accepted that…

Hardware Architecture · Computer Science 2010-07-15 C. N. Marimuthu , P. Thangaraj , Aswathy Ramesan

This paper describes several new improvements of modular arithmetic and how to exploit them in order to gain more efficient implementations of commonly used algorithms, especially in cryptographic applications. We further present a new…

Cryptography and Security · Computer Science 2013-10-15 Wilke Trei

Safe memory reclamation (SMR) algorithms are crucial for preventing use-after-free errors in optimistic data structures. SMR algorithms typically delay reclamation for safety and reclaim objects in batches for efficiency. It is difficult to…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-02-28 Ajay Singh , Trevor Brown , Michael Spear

In high-dynamic range (HDR) analog-to-digital converters (ADCs), having many quantization bits minimizes quantization errors but results in high bit rates, limiting their application scope. A strategy combining modulo-folding with a low-DR…

Signal Processing · Electrical Eng. & Systems 2023-11-23 Satish Mulleti , Resham Yashwanth Kumar , Laxmeesha Somappa

In this paper, we investigate the communication overhead of the Kyber, which has recently been standardized by the National Institute of Standards and Technology (NIST). Given the same decryption failure rate (DFR) and security argument, we…

Cryptography and Security · Computer Science 2024-07-26 Shuiyin Liu , Amin Sakzad

We propose a new method for defragmenting the module layout of a reconfigurable device, enabled by a novel approach for dealing with communication needs between relocated modules and with inhomogeneities found in commonly used FPGAs. Our…

Data Structures and Algorithms · Computer Science 2011-11-14 Sandor Fekete , Tom Kamphans , Nils Schweer , Christopher Tessars , Jan C. van der Veen , Josef Angermeier , Dirk Koch , Juergen Teich

This paper presents another improved version of Plantard arithmetic that could speed up Kyber implementations on two low-end 32-bit IoT platforms (ARM Cortex-M3 and RISC-V) without SIMD extensions. Specifically, we further enlarge the input…

Computers and Society · Computer Science 2024-02-20 Junhao Huang , Haosong Zhao , Jipeng Zhang , Wangchen Dai , Lu Zhou , Ray C. C. Cheung , Cetin Kaya Koc , Donglong Chen

The capability of discretization of matrix elements in the problem of quadratic functional minimization with linear member built on matrix in N-dimensional configuration space with discrete coordinates is researched. It is shown, that…

Neural and Evolutionary Computing · Computer Science 2012-05-04 Boris Kryzhanovsky , Mikhail Kryzhanovsky , Magomed Malsagov

In this paper, we propose a methodology for partitioning and mapping computational intensive applications in reconfigurable hardware blocks of different granularity. A generic hybrid reconfigurable architecture is considered so as the…

Hardware Architecture · Computer Science 2011-11-09 M. D. Galanis , A. Milidonis , G. Theodoridis , D. Soudris , C. E. Goutis

Finite element based simulation of phenomena governed by partial differential equations is a standard tool in many engineering workflows today. However, the simulation of complex geometries is computationally expensive. Many engineering…

Numerical Analysis · Mathematics 2019-08-07 Andreas Buhr

Dilithium is a lattice-based digital signature scheme standardized by the NIST post-quantum cryptography (PQC) project. In this study, we focus on developing efficient sparse polynomial multiplication implementations of Dilithium for ARM…

Cryptography and Security · Computer Science 2024-04-22 Jieyu Zheng , Hong Zhang , Le Tian , Zhuo Zhang , Hanyu Wei , Zhiwei Chu , Yafang Yang , Yunlei Zhao
‹ Prev 1 2 3 10 Next ›