|
D.12.3.7 chineseRem
Procedure from library crypto.lib (see crypto_lib).
- Usage:
- chineseRem(T,L);
- Return:
- x such that x = T[i] mod L[i]
- Note:
- chinese remainder theorem
Example:
| LIB "crypto.lib";
ring R = 0,x,dp;
chineseRem(list(24,15,7),list(2,3,5));
==> 12
|
|