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].
The AVR's high throughput of 5 MIPS at 5 MHz and the crypto-coprocessor's ability to deliver a 1,024-bit RSA-encrypted electronic signature, using the Chinese Remainder Theorem, in less than 180 ms provide ultra-fast encryption and decryption.
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.