Results 21 to 30 of about 2,320 (298)
Cryptographic Attack on Lucas Based Cryptosystems Using Chinese Remainder Theorem [PDF]
Lenstra’s attack uses Chinese remainder theorem as a tool and requires a faulty signature to be successful. This paper reports on the security responses of fourth and sixth order Lucas based (LUC4,6) cryptosystem under the Lenstra’s attack as compared to
Lee Feng Koo +5 more
core +1 more source
Chinese remainder theorem secret sharing in multivariate polynomials
This paper deals with a generalization of the secret sharing using Chinese remainder theorem over the integers to multivariate polynomials over a finite field. We work with the ideals and their Gröbner bases instead of integer moduli.
Gennadii V. Matveev
doaj +1 more source
Efficient Batch Fully Homomorphic Encryption with a Shorter Key from Ring-LWE
Fully homomorphic encryption allows users to use the computing resources of cloud servers for the computation of encrypted data without worrying about data leakage.
Yuyue Chen, Ruwei Huang, Bo Yang
doaj +1 more source
The new fifth-generation (5G) cellular networks dramatically improve the speed of message transmissions. Most existing authentication schemes that secure 5G communication rely heavily on the vehicle’s tamper-proof device (TPD) and roadside units (RSUs ...
Mahmood A. Al-Shareeda +3 more
doaj +1 more source
RESEARCH OF EFFECTIVE METHODS OF CONVERSION FROM RNS TO POSITIONAL NOTATION ON FPGA
In the article different methods of conversion numbers from the residue number system to the binary number system was investigated. The simulation on the FPGA is performed, which implies that the approximate method based on the Chinese remainder theorem ...
N. N. Chervyakov +3 more
doaj
Scaling function based on Chinese remainder theorem applied to a recursive filter design [PDF]
Implementation of IIR filters in residue number system (RNS) architecture is more complex in comparison to FIR filters, due to introduction of the scaling function.
Stamenković Negovan +2 more
doaj +1 more source
Analytical Comparison Of RSA And RSA With Chinese Remainder Theorem
RSA encryption algorithm is one of the most powerful public key encryption algorithm. The problem with RSA algorithm is that RSA decryption is relatively slow in comparison to RSA encryption.
Ankur Mantri +4 more
doaj +1 more source
Robustness in Chinese Remainder Theorem
12 ...
Hanshen Xiao +3 more
openaire +2 more sources
THE GENERAL CHINESE REMAINDER THEOREM
The Chinese remainder theorem deals with systems of modular equations. The classical variant requires the modules to be pairwise coprime. In this paper we discuss the general variant, which does not require this restriction on modules. We have selected and implemented several algorithms for the general Chinese remainder theorem.
Sorin Iftene, Florin Chelaru
openaire +2 more sources
In this study, digital signature application was performed on FPGA with classical RSA and Chinese Remainder Theorem (CRT). The power consumption of the system was observed when the digital signature process was performed on the FPGA.
Sönmez Burcu, Özer Ahmet Bedri
doaj +1 more source

