Cryptographic systems using redundancy

The problem of ensuring recoverability of encrypting data in a file storage system is examined. In this situation, the original data (plaintext) are removed from the system after encryption. In the event of errors either in the initial processing or in the storage of the data, the file may be rendered unrecoverable. A model of a file storage system that incorporates errors in these areas is developed. A two-stage coding system involving error-correcting codes and interleaving is introduced. The performance of this system is analyzed for various sizes of encryption blocks and error-correcting codes. >