Open AccessTHE GENERAL CHINESE REMAINDER THEOREM
Author(s) -
Sorin Iftene,
Florin Chelaru
Publication year - 2014
Publication title -
computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.184
H-Index - 11
eISSN - 2312-5381
pISSN - 1727-6209
DOI - 10.47839/ijc.6.1.423
Subject(s) - chinese remainder theorem , remainder , mathematics , pairwise comparison , secret sharing , coprime integers , modular design , algebra over a field , cryptography , computer science , discrete mathematics , pure mathematics , arithmetic , algorithm , statistics , operating system
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. Moreover, we point out some interesting applications of this variant in secret sharing and threshold cryptography.