Introduction to finite fields and their applications
Introduction to finite fields and their applications
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Construction of secure and fast hash functions using nonbinary error-correcting codes
IEEE Transactions on Information Theory
Hi-index | 0.00 |
The attempt of using the techniques of error correction coding for building the cryptographic system, which can detect the manipulations on cryptograms, is shown in the paper. Presented approach to generating cipher, generating redunant ciphertexts, which are resistant to manipulations, allows to fulfilling the accessibility as well as confidentiality and authenticity. The capacity of obtained ciphertexts, by mean of statistical tests' results, is also presented.