GitHub

mjavadHasanzade/chinese-remainder-theorem

This project includes an implementation of the Chinese Remainder Theorem and related algorithms. These algorithms include the Extended Euclidean Algorithm and Modular Inverse calculation. This ...
GitHub

chinese_remainder_theorem.py

If GCD(a,b) = 1, then for any remainder ra modulo a and any remainder rb modulo b there exists integer n, such that n = ra (mod a) and n = ra(mod b). If n1 and n2 are ...
IEEE

Construction of reversible integer codes with large moduli via Chinese remainder theorem

Abstract: The codes over rational integer residue rings are called integer codes. In this paper, we give a necessary and sufficient condition concerning the generator matrices when integer codes are ...
IEEE

Masked Ciphertext Comparison without Masking Conversions using Register Rotation and Chinese Remainder Theorem

Abstract: In this paper, we propose a novel method for masked comparison using register rotation technique without masking conversions. In key encapsulation mechanisms (KEMs), ciphertext comparison is ...
JSTOR Daily

The Intimate Relationship Between the McNaughton and the Chinese Remainder Theorems for MV-algebras

We show the intimate relationship between McNaughton Theorem and the Chinese Remaindner Theorem for MV-algebras. We develop a very short and simple proof of McNaughton Theorem. The arguing is ...
JSTOR Daily

The Chinese Remainder Clock

https://doi.org/10.4169/college.math.j.48.2.82 https://www.jstor.org/stable/10.4169/college.math.j.48.2.82 We present an analog clock with five hands that illustrates ...