Results 11 to 20 of about 1,311 (253)
A Chinese Remainder Theorem for partitions
The Ramanujan Journal, 2023 AbstractLet s, t be natural numbers and fix an s-core partition $$\sigma $$ σ and a t-core partition $$\tau $$ τ . Put $$d=\gcd (s,t)$$ d = gcd ( s
Kayanattath Seethalakshmi +1 more
openaire +3 more sources
Journal of the Franklin Institute, 1992 Taking a problem from a Chinese mathematical classic, the authors give a slightly generalised algorithm corresponding to what is known as the ``Chinese remainder theorem''. There are many historical inaccuracies in the paper, and no mathematical innovations.
Ku, Y. H., Sun, Xiaoguang
openaire +1 more source
Efficient Batch Fully Homomorphic Encryption with a Shorter Key from Ring-LWE
Applied Sciences, 2022 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
RESEARCH OF EFFECTIVE METHODS OF CONVERSION FROM RNS TO POSITIONAL NOTATION ON FPGA
Современная наука и инновации, 2022 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]
Serbian Journal of Electrical Engineering, 2014 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
JISR on Computing, 2016 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
CoRR, 2017 12 ...
Hanshen Xiao +3 more
openaire +2 more sources
THE GENERAL CHINESE REMAINDER THEOREM
International Journal of Computing, 2014 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
ITM Web of Conferences, 2018 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
IET Information Security, 2023 To ensure private message exchange among the group members, it is desirable to construct secure and efficient group key management schemes. Moreover, these schemes are more versatile if they could support dynamic join or leave of group members.
Zhe Xia, Yu Yang, Fuyou Miao
doaj +1 more source