Cybernetics And Systems Analysis logo
Editorial Board Announcements Abstracts Authors Archive
Cybernetics And Systems Analysis
International Theoretical Science Journal
UDC 621.391:519.2
S.V. Mitin1


1 Institute of Special Communication and Information Protection of the National
Technical University “Igor Sikorsky Kyiv Polytechnic Institute,” Kyiv, Ukraine

meetser@gmail.com

AMOUNT OF KEY INFORMATION CONTAINED IN OPEN AND ENCRYPTED
TEXT SETS OF THE SYMMETRIC RANDOMIZED McELIECE CRYPTOSYSTEM

Abstract. A symmetric code cryptosystem, which is similar to the randomized (asymmetric) McEliece encryption scheme, is considered. An expression for the amount of information about the secret key, which can be extracted from the open and the corresponding encrypted messages of the cryptosystem, is obtained. It is shown that with this information, the security of the symmetric cryptosystem to the attacks based on known ciphertext coincides with the security of its asymmetric counterpart.

Keywords: code-based cryptography, McEliece encryption scheme, randomized code cryptosystem, amount of information.



FULL TEXT

REFERENCES

  1. McEliece R.J. A public-key cryptosystem based on algebraic coding theory. Prog. Rep., Jet Prop. Lab., California Inst. Technol., 1978. P. 114–116.

  2. Jordan J.P. A variant of public-key cryptosystem based on Goppa codes. Sigact news. 1983. Vol. 15, N 1. P. 61–66.

  3. Rao T.R.N. Cryptosystems using algebraic codes. In: Proc. Int. Conf on Computer Systems & Signal Processing. Dec. 84. Bangalore, India, 1984.

  4. Rao T.R.N., Nam K.H. Private-key algebraic code encryption. IEEE Trans. on Inform Theory. 1987. IT-35(4). P. 829–833.

  5. Sobhi Afshar A.A., Eghlidos T., Aref M.R. Efficient secure channel coding based on quasi-ciclic low-density parity-check codes. Journal of IET-Communications. 2009. Vol. 3, Iss. 2. P. 279–292.

  6. Hooshmand R., Eghlidos T., Aref M.R. Improving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes. ISC Journal of Information sequrity. 2012. Vol. 4, Issue 1. P. 3–14.

  7. Nojima R., Imai H., Kobara K., Morozov K. Semantic security for the McEliece cryptosystem without random oracles. Des. Codes Cryptography. 2008. Vol. 49, N 1–3. P. 289–305.

  8. Glukhov M.M., Elizarov V.P., Nechaev A.A. Algebra. Textbook in 2 volumes, Vol. 1.Moscow: Helios ARV, 2003. 336 p.

  9. Stinson D.R. Cryptography: Theory and practice. Third Edition. CRC Press. 2005. 616 p.

  10. Alekseychuk A.N., Konyushok S.N. On statistical properties of nonlinearity of constraints of Boolean functions to a randomly chosen subspace. Applied discrete mathematics. 2012. Iss. 1(15). P. 5–10.
© 2020 Kibernetika.org. All rights reserved.