Abstract. In this paper we consider a class of randomized stream ciphers based on joint employment of encryption, random coding, and error-correction coding by binary linear codes. It is shown that in this class there exist ciphers that have arbitrarily high computational security against the most powerful from all known attacks providing that both the transmission rate and the receiving accuracy have the value arbitrarily close to 1. The complexity of recovering plain messages by the legitimate receiver is acceptable as well. The proof is constructive.
Keywords: randomized stream cipher, random coding, correlation attack, provable security, Reed-Solomon code.
1 Institute of Special Communication and Information Security, National Technical University of Ukraine “Igor
Sikorsky Kyiv Polytechnic Institute,” Kyiv, Ukraine,
e-mail: alex-dtn@ukr.net.
2
Institute of Special Communication and Information Security, National Technical University of Ukraine “Igor
Sikorsky Kyiv Polytechnic Institute,” Kyiv, Ukraine,
e-mail: gsv-crypto@mail.ru.