[图书][B] Residue Number Systems
PVA Mohan, PVA Mohan - 2016 - Springer
The design of algorithms and hardware implementation for signal processing systems has
received considerable attention over the last few decades. The primary area of application …
received considerable attention over the last few decades. The primary area of application …
FPGA implementation of high-speed area-efficient processor for elliptic curve point multiplication over prime field
Developing a high-speed elliptic curve cryptographic (ECC) processor that performs fast
point multiplication with low hardware utilization is a crucial demand in the fields of …
point multiplication with low hardware utilization is a crucial demand in the fields of …
Exploiting the power of GPUs for asymmetric cryptography
R Szerwinski, T Güneysu - … and Embedded Systems–CHES 2008: 10th …, 2008 - Springer
Abstract Modern Graphics Processing Units (GPU) have reached a dimension with respect
to performance and gate count exceeding conventional Central Processing Units (CPU) by …
to performance and gate count exceeding conventional Central Processing Units (CPU) by …
High-performance computing based on residue number system: a review
V Balajishanmugam - 2023 9th International Conference on …, 2023 - ieeexplore.ieee.org
The speed of arithmetic operation is associated with the quantity of the numbers involved.
Residue Number System (RNS) is used to characterize a more significant numeral using a …
Residue Number System (RNS) is used to characterize a more significant numeral using a …
An RNS Implementation of an Elliptic Curve Point Multiplier
DM Schinianakis, AP Fournaris… - … on Circuits and …, 2008 - ieeexplore.ieee.org
Elliptic curve point multiplication is considered to be the most significant operation in all
elliptic curve cryptography systems, as it forms the basis of the elliptic curve discrete …
elliptic curve cryptography systems, as it forms the basis of the elliptic curve discrete …
On the modulo 2n+ 1 addition and subtraction for weighted operands
In this paper, investigation is performed on the design of efficient modulo 2 n+ 1 adders,
subtractors and add/subtract units for weighted operands. The existing modulo 2 n+ 1 adder …
subtractors and add/subtract units for weighted operands. The existing modulo 2 n+ 1 adder …
RNS montgomery reduction algorithms using quadratic residuosity
S Kawamura, Y Komano, H Shimizu… - Journal of Cryptographic …, 2019 - Springer
The residue number system (RNS) is a method for representing an integer as an n-tuple of
its residues with respect to a given base. Since RNS has inherent parallelism, it is actively …
its residues with respect to a given base. Since RNS has inherent parallelism, it is actively …
New reverse converters for the moduli set {2n-3, 2n-1, 2n+ 1, 2n+ 3}
PVA Mohan - AEU-International Journal of Electronics and …, 2008 - Elsevier
In this paper, three reverse converters for a recently proposed balanced moduli set {2n-3,
2n+ 1, 2n-1, 2n+ 3} are presented. The first proposed converter is based on mixed radix …
2n+ 1, 2n-1, 2n+ 3} are presented. The first proposed converter is based on mixed radix …
Efficient modulo 2n+ 1 multiply and multiply-add units based on modified Booth encoding
C Efstathiou, N Moshopoulos, N Axelos, K Pekmestzi - Integration, 2014 - Elsevier
In this work a new efficient modulo 2 n+ 1 modified Booth multiplication algorithm for both
operands in the weighted representation is proposed. Furthermore, the same algorithm is …
operands in the weighted representation is proposed. Furthermore, the same algorithm is …
Optimized FPGA Implementation of Elliptic Curve Cryptosystem over Prime Fields
G Yang, F Kong, Q Xu - … on Trust, Security and Privacy in …, 2020 - ieeexplore.ieee.org
Elliptic curve cryptosystem has been widely applied in a lot of fields, such as finance, E-
commerce and E-government. In this paper, we propose an optimized FPGA implementation …
commerce and E-government. In this paper, we propose an optimized FPGA implementation …