remainder theorem

remainder theorem

[ri′mān·dər ‚thir·əm]
(mathematics)
Dividing a polynomial p (x) by (x-a) gives a remainder equaling the number p (a).
References in periodicals archive ?
Proof: The result is easy when n is prime and can be deduced from the Chinese Remainder Theorem in the general case.
The key to the team's innovation is the pooling strategy, which is based on the 2,000-year-old Chinese remainder theorem.
024 bits are processed in 65 milliseconds without Chinese Remainder Theorem (CRT).
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.
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.
Fast format RSA keys (Chinese remainder theorem & Fermat-5)
In addition, the coprocessor offers extremely short execution times of 220 ms for an RSA 512-bit standard encryption and 450 ms for 1024-bit RSA employing the commonly used Chinese Remainder Theorem (CRT).