15 papers · ranked by Valyu relevance
Mario Mastriani
— A new binary (bit-level) lossless compression catalyst method based on a modular arithmetic, called Binary Allocation via Modular Arithmetic (BAMA), has been introduced in this paper. In other words, BAMA is for storage and transmission of binary sequences, digital signal, images and video, also streaming and all…
Wilke Trei
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 record for modular multiplications per second on a single desktop computer as well…
Guangwu Xu, Ye Tian, Bingxin Yang
for any integers a, n > 1 with gcd(a, n) = 1. The algorithm has a motivation from the schoolbook multiplication and achieves both efficiency and generality. The greater flexibility of our algorithm is explored by utilizing the built-in arithmetic of computer architecture, e.g., n = 2 64 , and experimental results show…
Mikhail Selianinau, Yuriy Povstenko, Jun Chen, Sadaf Salehkalaibar
In this paper, we consider one of the key problems in modular arithmetic. It is known that scaling in the residue number system (RNS) is a rather complicated non-modular procedure, which requires expensive and complex operations at each iteration. Hence, it is time consuming and needs too much hardware for…
Mikhail Selianinau, Yuriy Povstenko, Sergio Cruces, Rubén Martín-Clemente + 2 more
'Rubén Martín-Clemente' 'Andrzej Cichocki' 'Iván Durán-Díaz'] In this paper, we deal with the critical problems in residue arithmetic. The reverse conversion from a Residue Number System (RNS) to positional notation is a main non-modular operation, and it constitutes a basis of other non-modular procedures used to…
Hari Krishna Garg, Hanshen Xiao
In this paper, we derive new computational techniques for residue number systems (RNS) based Barrett algorithm (BA). The focus of the work is an algorithm that carries out the entire computation using only modular arithmetic without conversion to large integers via the Chinese Remainder Theorem (CRT). It also avoids…
Huang, Shao-Yuan, Wu, Hsiu-Yu
Let p1, p2, ..., p n be distinct primes and N n = p1p 2 · · · pn. We prove that, for any L > 0 divisible by lcm (p 1 − 1, p 2 − 1, ..., p n − 1) and a i ∈ N satisfying gcd(a i , Nn) = p i for 1 ≤ i ≤ n, the following congruence holds:
Anay Aggarwal, Manu Isaacs
We present a fast algorithm for modular exponentiation when the factorization of the modulus is known. Let a, n, m be positive integers and suppose m factors canonically as Qk i=1 p ei i . Choose integer parameters ti ∈ [1, ei ] for 1 ≤ i ≤ k. Then we can compute the modular exponentiation a n (mod m) in O(max(ei/ti) +…
W.H. Ko
Modular inverse is one of the basic operations in modular arithmetic, and it is applied extensively in computer science and telecommunications, particularly, in cryptography. However, it is also a time-consuming operation implemented in hardware or software compared with other modular arithmetic operations such as…
Deming Wang, Yuhang Lin, Jianguo Hu, Chong Zhang + 2 more
'José de Jesús Rangel Magdaleno'] 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 suitable for IoT security. This paper…
Utku Gulen, Abdelrahman Alkhodary, Selcuk Baktir
As wireless sensor networks (WSNs) become more widespread, potential attacks against them also increase and applying cryptography becomes inevitable to make secure WSN nodes. WSN nodes typically contain only a constrained microcontroller, such as MSP430, Atmega, etc., and running public key cryptography on these…
José de Jesús Morales Romero, Mario Alfredo Reyes Barranca, David Tinoco Varela, Luis Martin Flores Nava + 3 more
'David Tinoco Varela' 'Luis Martin Flores Nava' 'Emilio Rafael Espinosa Garcia' 'Juvenal Rodriguez-Resendiz' 'Arman Roohi'] Cryptographic algorithms (RSA, DSA, and ECC) use modular exponentiation as part of the principal operation. However, Non-profiled Side Channel Attacks such as Simple Power Analysis and…
Deepro Bonnerjee, Saswata Chakraborty, Sangram Bagh
One of the long-term goals of synthetic bioengineering is to create configurable and programmable biological systems by just mixing and matching “LEGO”-like bio-modules. Here, we introduce a configurable and modular multi-cellular system where, from a small library of nine discrete engineered bacterial cells, a full…
Tianchi Chen, M. Ali Al-Radhawi, Christopher A. Voigt, Eduardo D. Sontag
A design for genetically-encoded counters is proposed via repressor-based circuits. An N -bit counter reads sequences of input pulses and displays the total number of pulses, modulo 2^N^ . The design is based on distributed computation, with specialized cell types allocated to specific tasks. This allows scalability…
Authors not listed
Rapid and robust simulation of chemical processes is critical to conduct process design, optimization, techno-economic analysis, and sustainability analysis. Yet, efficiently solving simulation models remains a challenge due to the highly coupled and nonlinear nature of the underlying algebraic equations that capture…