Work

Modular Integer Arithmetic

Year: 2008
Type: article
Abstract: Modular Integer ArithmeticIn this article we show the correctness of integer arithmetic based on Chinese Remainder theorem as described e.g. in [11]: Integers are transformed to finite sequences of modular integers, on which the arithmetic operations are performed. Retransformation of the results to the integers is then accomplished by means of the Chinese Remainder theorem. The method presented is a typical example for computing in homomorphic images.
Language: English
Subfield: Software
Open Access status: diamond
OpenAlex ID: W1981636957
FWCI: 1.218
Cites: 9
Cited by: 10
Related to: 10