[PDF][PDF] An Overflow Detection Scheme with a Reverse Converter for the Moduli set

MI Daabo, KA Gbolagade - Journal of Emerging Trends in Computing and …, 2014 - Citeseer
The quest to make Residue Number System (RNS) based processors a reality, has made
researchers to continue seeking solutions to some of the limiting factors of RNS based …

An efficient residue-to-binary converter for the new moduli set {2n/2 ± 1, 22n+1,2n + 1}

H Siewobr, KA Gbolagade… - … Symposium on Integrated …, 2014 - ieeexplore.ieee.org
In this paper, a new four moduli set {2 n/2±1, 2 2n+ 1, 2 n+ 1} is proposed together with a two
level Chinese Remainder Theorem (CRT) based reverse converter for efficient residue …

[PDF][PDF] Modulo Operation Free Reverse Conversion in the {2 (2n+ 1)-1, 2n, 22n-1} Moduli Set

H Siewobr, KA Gbolagade - International Journal of Computer …, 2014 - researchgate.net
This paper proposes a fast Mixed Radix Conversion based reverse converter for the recently
proposed moduli set. It shows that the computation of multiplicative inverses could be …

[PDF][PDF] Multiple approaches to Convert RNS to Decimal Numbers

NH Jawad, S Abdulhadi - Journal of Al-Qadisiyah for computer science and …, 2023 - iasj.net
Improving the performance and speed of encryption algorithms is an important issue in
cryptography. One of these improvements is the use of the RNS system. In the research, the …

An area efficient RNS-to-binary converter for the {2n, 22n+1 −1, 2n −1} moduli set

H Siewobr, KA Gbolagade - 2012 IEEE 4th International …, 2012 - ieeexplore.ieee.org
In this paper, we propose an area efficient reverse converter for the moduli set {2 n, 2 2n+ 1-
1, 2 n-1}. We show that the required multiplicative inverses are either unity or powers of two …

Effective Rivest Shamir Adleman Cryptosystem Based on Chinese Remainder Theorem

KY Saheed - 2018 - search.proquest.com
This thesis proposed several schemes for improving the speed and security of Rivest Shamir
Adleman (RSA) cryptosystem. RSA is known to be the most popular and widely used public …

Методи побудови високопродуктивних спецпроцесорів на основі теоретико-числового базису Крестенсона

ОІ Волинський - 2013 - dspace.wunu.edu.ua
АНОТАЦІЯ Волинський ОІ Методи побудови високопродуктивних спецпроцесорів на
основі теоретико-числового базису Крестенсона.–Рукопис. Дисертація на здобуття …

[PDF][PDF] Optimising the New Chinese Remainder Theorem 1 for the Moduli Set

JBAK Ansuura, IR Fadulilahi - International Journal of Computer … - researchgate.net
This paper seeks to improve the performance of the New Chinese Remainder Theorem
(CRT) using the new moduli set {22𝑛+ 2+ 3, 22𝑛+ 1+ 1, 22𝑛+ 1, 2}. This optimization is very …

Процесори спектрального косинусного перетворення Фур'є на основі різних кореляційних функцій та теорнтико-числових базисів

ВЯ Піх - 2016 - dspace.wunu.edu.ua
АНОТАЦІЇ Піх ВЯ Процесори спектрального косинусного перетворення фур'є на основі
різних кореляційних функцій та теоретико-числових базисів.–На правах рукопису …

[PDF][PDF] Year of Publication: 2016

JBAK Ansuura, IR Fadulilahi - 2016 - academia.edu
This paper seeks to improve the performance of the New Chinese Remainder Theorem
(CRT) using the new moduli set {2^(2n+ 2)+ 3, 2^(2n+ 1)+ 1, 2^ 2n+ 1, 2}. This optimization …