Efficient encryption method to secure data with reduced number of encryption operations
Abstract:
The invention is particularly related with an encryption method that aims to secure an input data with reduced number of encryption operations. The invention claim the security by using the hardness of the unique decodability of the variable-length non-prefix-free (NPF) codes. The proposed encryption system is operated according to these steps, compression of the input data and coding with the introduced NPF encoding that splits the independent and identically distributed (IID) data to the two stream as code-word boundaries information data, which has all information of boundaries of NPF code words stream, and NPF code words stream which has all payload of encoded IID data except code-word boundaries information and then encrypting the code-word boundaries information without NPF code words stream.
Information query
Patent Agency Ranking
0/0