[图书][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 …
A new modular exponentiation architecture for efficient design of RSA cryptosystem
MD Shieh, JH Chen, HH Wu… - IEEE Transactions on Very …, 2008 - ieeexplore.ieee.org
Modular exponentiation with a large modulus, which is usually accomplished by repeated
modular multiplications, has been widely used in public key cryptosystems for secured data …
modular multiplications, has been widely used in public key cryptosystems for secured data …
Architecture optimizations for the RSA public key cryptosystem: A tutorial
The Rivest Shamir Adleman (RSA) cryptosystem, named after its creators, is one of the most
popular public key cryptosystems. The RSA cryptosystem has been utilized for e-commerce …
popular public key cryptosystems. The RSA cryptosystem has been utilized for e-commerce …
Palmprint verification: an implementation of biometric technology
W Shu, D Zhang - … Conference on Pattern Recognition (Cat. No …, 1998 - ieeexplore.ieee.org
As the important implementation of biometric technology, palmprint verification is one of the
most reliable personal identification methods. In this paper, a new approach to palmprint …
most reliable personal identification methods. In this paper, a new approach to palmprint …
A new algorithm for high-speed modular multiplication design
MD Shieh, JH Chen, WC Lin… - IEEE Transactions on …, 2008 - ieeexplore.ieee.org
Modular exponentiation in public-key cryptosystems is usually achieved by repeated
modular multiplications on large integers. Designing high-speed modular multiplication is …
modular multiplications on large integers. Designing high-speed modular multiplication is …
Compact FPGA hardware architecture for public key encryption in embedded devices
L Rodríguez-Flores, M Morales-Sandoval, R Cumplido… - PloS one, 2018 - journals.plos.org
Security is a crucial requirement in the envisioned applications of the Internet of Things (IoT),
where most of the underlying computing platforms are embedded systems with reduced …
where most of the underlying computing platforms are embedded systems with reduced …
Synthesis-for-testability watermarking for field authentication of VLSI intellectual property
CH Chang, A Cui - IEEE Transactions on Circuits and Systems I …, 2010 - ieeexplore.ieee.org
Most VLSI watermarking techniques do not allow different authorships of multiple Intellectual
Property (IP) cores to be detected directly in the field after the IPs have been integrated …
Property (IP) cores to be detected directly in the field after the IPs have been integrated …
Fault and simple power attack resistant RSA using Montgomery modular multiplication
AP Fournaris - … of 2010 IEEE International Symposium on …, 2010 - ieeexplore.ieee.org
Side channel attacks and more specifically fault, simple power attacks, constitute a
pragmatic, potent mean of braking a cryptographic algorithm like RSA. For this reason, many …
pragmatic, potent mean of braking a cryptographic algorithm like RSA. For this reason, many …
Research in fast modular exponentiation algorithm based on FPGA
S Li, J Tian, H Zhu, Z Tian, H Qiao… - 2019 11th International …, 2019 - ieeexplore.ieee.org
Modular exponentiation of large number is widely applied in public-key cryptosystem, also
the bottleneck in the computation of public-key algorithm. Modular multiplication is the key …
the bottleneck in the computation of public-key algorithm. Modular multiplication is the key …
Massively parallel modular exponentiation method and its implementation in software and hardware for high-performance cryptographic systems
N Nedjah, LM Mourelle, M Santana, S Raposo - IET computers & digital …, 2012 - IET
Most cryptographic systems are based on modular exponentiation (ME). It is performed
using successive modular multiplications (MMs). In this case, there are many ways to …
using successive modular multiplications (MMs). In this case, there are many ways to …