Efficient S-repetition method for constructing an IND-CCA2 secure McEliece modification in the standard model | Applied Discrete Mathematics. Supplement. 2020. № 13. DOI: 10.17223/2226308X/13/24

Efficient S-repetition method for constructing an IND-CCA2 secure McEliece modification in the standard model

The paper is devoted to the construction of IND-CCA2-secure modification of the McEliece cryptosystem in the standard model. The modification uses S-repetition 1^-в1 _Р°в - вв •••^рв encryption of S/2 various messages with one common secret permutation, in contrast to other modifications that use S-repetition encryption of one message. Thus, this modification provides IND-CCA2-security with an efficient information transfer rate.

Download file

Counter downloads: 109

Keywords

post-quantum cryptography, McEliece-type cryptosystem, IND-CCA2-security, S-repetition encryption, постквановая криптография, криптосистема типа Мак-Элиса, IND-CCA2 безопасность, S-повторенное шифрование

Authors

Name	Organization	E-mail
Kosolapov Y. V.	South Federal University	itaim@mail.ru
Turchenko O. Y.	South Federal University	olegmmcs@gmail.com

Всего: 2

References

McEliece R. J. A public-key cryptosystem based on algebraic coding theory // DSN Progress Report. 1978. P. 42-44.

Rosen A. and Segev G. Chosen-ciphertext security via correlated products // LNCS. 2009. V. 5444. P. 419-436.

Dottling N., Dowsley R., Quade J. M., and Nascimento A. C. A. A CCA2 secure variant of the McEliece cryptosystem // IEEE Trans. Inform. Theory. 2012. V. 58(10). P. 6672-6680.

Persichetti E. On a CCA2-secure variant of McEliece in the standard model // Provable Security. 2018. V. 11192. P. 165-181.

Lamport L. Constructing Digital Signatures from One-Way Functions. SRI International, 1979. https://www.microsoft.com/en-us/research/publication/constructing-digital-signatures-one-way-function/

Naor M. and Yung M. Universal One-Way Hash Functions and their Cryptographic Applications // Proc. STOC'89. N.Y.: ACM, 1989. P. 33-43.

Nojima R., Imai H., Kobara K., et al. Semantic security for the McEliece cryptosystem without random oracles // Designs, Codes and Cryptography. 2008. V. 49. P. 289-305.

Berlekamp E. R., McEliece R. J., and van Tilborg H. C. On the inherent intractability of certain coding problems // IEEE Trans. Inform. Theory. 1978. V.24. No.3. P. 384-386.

Kobara K. and Imai H. On the one-wayness against chosen-plaintext attacks of the Loidreau's modified McEliece PKC // IEEE Trans. Inform. Theory. 2003. V.49. No. 12. P. 3160-3168.