Loading patent…
AssigneeIpception
InventorJacotin Romain
Estimating the term…
The system comprises a sending entity (100) and a receiving entity (200). The sending entity (100) is suitable for generating a random mask (MA) with m bits; applying an XOR operation between the raw data block to be encrypted (T) and the random mask (MA) thus generated to obtain a primary encrypted block (CPV) with m bits; and applying a permutation (PE) on the concatenation of the random mask (MA) and the primary encrypted block (CPV) to obtain a secondary encrypted block (CS). The receiving entity (200) is suitable for receiving the secondary encrypted block (CS) of 2*m bits; applying an inverse permutation (PI) on the secondary encrypted block thus received to obtain the de-concatenation of a random mask (MA) and a primary encrypted block (CPV) with m bits; and applying an XOR operation between the primary encrypted block (CPV) and the random mask (MA) thus de-concatenated to obtain a block in clear (T) with m bits. The permutation (PE) and its inverse permutation (PI) are secret and only shared and known by the communicating entities (100, 200).
A method for asynchronous symmetrical encryption of an initial message in clear (T) in N successive blocks of m bits each of raw data implemented between a sending entity (100) and a receiving entity (200), characterized in that, for each block (T) of m bits to be encrypted, the following steps are provided:
A system for the asynchronous encryption/decryption of an initial message in clear (T) of N successive blocks of m bits each of raw data between a sending entity (100) and a receiving entity (200), characterized in that the sending entity (100) is capable of:
Dependencies are inferred from the claim text.