Abstract: A digital encrypting and decrypting unit (PMEU) that operates according to a Rivest-Shamir-Adleman (RSA) cryptosystem based on Residue Numeral System (RNS) and Chinese Reminder Theorem (CRT). The unit includes two modular exponentiation calculating units (MES-1, MES-2) to process a two residual signals (X mod p; X mod q) to calculate a result of a modular exponentiation by a binary method. The calculating units have inputs (I-k[i], I-SM, I-MM) and outputs (O-k[i], O-SM, O-MM) for signals representing partial results of the modular exponentiation. A modular exponentiation controlling unit (MECU) is connected to the inputs and outputs of the calculating units to control flow of the signals representing the partial results of the modular exponentiation.

Abstract: A digital encrypting and decrypting unit (PMEU) that operates according to a Rivest-Shamir-Adleman (RSA) cryptosystem based on Residue Numeral System (RNS) and Chinese Reminder Theorem (CRT). The unit includes two modular exponentiation calculating units (MES-1, MES-2) to process a two residual signals (X mod p; X mod q) to calculate a result of a modular exponentiation by a binary method. The calculating units have inputs (I-k[i], I-SM, I-MM) and outputs (O-k[i], O-SM, O-MM) for signals representing partial results of the modular exponentiation. A modular exponentiation controlling unit (MECU) is connected to the inputs and outputs of the calculating units to control flow of the signals representing the partial results of the modular exponentiation.

Abstract: A computer-implemented method for irreversible generating of distinct one-time encryption keys. For each subsequent operation of generating the one-time encryption key, the method comprises the following steps, performed with a one-time key generator: reading previously stored values P and Q to obtain read values P and Q, wherein the values P and Q are probable prime numbers; modifying the read values P and Q by using a modifier M and an additive operation, including size adjustment to obtain modified values P and Q; generating, based on the modified values P and Q, new values P and Q as probable prime numbers; storing the new values P and Q as stored values P and Q; executing a multiplication operation on the stored values P and Q to determine a new value N; and providing the new value N as a new component of the one-time encryption key.