Chinese remainder theorem


Also found in: Acronyms, Wikipedia.

Chinese remainder theorem

[¦chī‚nēz ri′mān·der ‚thir·əm]
(mathematics)
The theorem that if the integers m1, m2, …, mn are relatively prime in pairs and if b1, b2, …, bn are integers, then there exists an integer that is congruent to bi modulo mi for i =1,2, …, n.
References in periodicals archive ?
As noted in the introduction, the Chinese Remainder Theorem isomorphism (1) identifies elements of Z/nZ with the (d - 1)-dimensional simplices of [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].
At the end, only one multilength computation is required to construct the global solution (the exact answer) by means of the Chinese Remainder Theorem.
The Secturion security processing cards deliver 4400 RSA key decrypts per second (1024-bit modulus with Chinese Remainder Theorem -- CRT) which equates to initiating about 4000 secure sessions per second for Web based applications as well as initiating as many as 3400 secure tunnels for VPN solutions.
The dedicated RSA (Rivest, Shamir, Adleman) cryptography accelerator processes digital signatures with key lengths of 1,024 bits in 420 milliseconds (at 10 MHz, without Chinese Remainder Theorem CRT), RSA algorithms with key lengths of 2,048 bits can also be processed using the CRT.
A 1024-bit RSA computation with Chinese Remainder Theorem (CRT) is achieved in 90 ms.