THE DATA ENCODING IN DENIABLE ENCRYPTION ALGORITHMS

Abstract

The hypothesis of the deniable encryption algorithms productivity increasing without the original algorithms transformation possibility has been investigated in this article. The algorithms of deniable encryption is relevant because of effective protection schemes of information and its users. These algorithms have the complex and concentrated structure. It makes impossible their practical applying. Its productivity is affected by them. That’s why deniable encryption algorithms are not applied for practical using. The encoding information algorithms reviewing and its investigation are main objectives of the article. They allow to transform the information, not its value. The deniable encryption algorithms input data is reduced by the encoding algorithms. The deniable encryption algorithms proportional productivity increasing and their practical applying are provided. The effective encoding algorithms and their applications are overviewed and applied to deniable encryption algorithms in this manuscript. Two algorithms have been investigated. The first scheme is based on the deniable encryption mechanisms. Its security bugs have been identified and investigated. Another algorithm is based on the efficient encoding algorithms. They are implemented to the basic data processing subsystem. Both of the algorithms’ efficiency has been investigated by the real public and secret information files using. The proposed data processing schemes are investigated by the user's workplace simulating. The original deniable encryption algorithm productivity increasing has been reached by the reduced data size. Also, the encryption keys difference and its dependence have been tested and compared with the other authors’ investigations. Finally, the general authors' hypothesis has been confirmed. The tested deniable encryption algorithms productivity has been increased.