Abstract
The purpose of this paper is to present a new version of the McEliece cryptosystem based on punctured convolutional codes and the pseudo-random generators. We use the modified self-shrinking generator to fill the punctured pattern. More precisely we propose to fill out the pattern punctured by the bits generated using a pseudo random generator LFSR.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Barbier, M., Baretto, P.S.L.M.: Key reduction of McEliece’s cryptosystem using list decoding. In: International Symposium of Information Theory ISIT 2011, Saint-Pettersburg (2011)
Berger, T.P., Cayrel, P.L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece cryptosystem. In: Preneel, B. (Ed.) AFRICACRYPT 2009, Gammarth. Volume 5580 of Lecture Notes in Computer Science, pp. 77–97. Springer Berlin/Heidelberg (2009)
Berson, T.A.: Failure of the McEliece public-key cryptosystem under message-resend and related-message attack. In: Kaliski, B.S., Jr. (ed.) Advances in Cryptology-CRYPTO ’97, Santa Barbara, California, USA, 17–21 Aug 1997. Volume 1294 of Lecture Notes in Computer Science, pp. 213–220. Springer (1997)
Canteaut, A., Chabaud, F.: A new algorithm for finding minimum-weight words in a linear code: application to McEliece’s cryptosystem and to narrow-sense BCH codes of length 511. IEEE Trans. Inf. Theory 44(1), 367–378 (1998)
Johannesson, R., SZigangirov, K.: Fundamentals of Convolutional Coding. IEEE, New York (1999)
Kanso, A.: Modified self-shrinking generator. Comput. Electr. Eng. 36(5), 993–1001 (2010)
Landais, G., Tillich, J.P.: An efficient attack of a McEliece cryptosystem variant based on convolutional codes. In: Gaborit, P. (ed.) PQCrypto 2013. Lecture Notes in Computer Science, vol. 7932, pp. 102–117. Springer, Berlin/Heidelberg (2013)
Londahl, C., Johansson, T.: A new version of McEliece PKC based on convolutional codes. In: International Conference on Information and Communications Security ICICS 2012, Hong-Kong, Oct 2012
Marazin, M., Gautier, R., Burel, G.: Algebraic method for blind recovery of punctured convolutional encoders from an erroneous bitstream. IET Signal Process, 6(2), 122–131 (2012)
McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Progress Report 42–44, pp. 114–116 (1978)
Meier, W., Statfelbach, O.: The self-shrinking generator. In: De Santis, A. (ed.) Advances in Cryptology, Eurocrypt 94. Lecture Note in Computer Science, vol. 950, pp. 205–214. Springer, Berlin (1995)
Wieschebrink, C.: Two NP-complete problems in coding theory with an application in code based cryptography. In: International Symposium on Information Theory (ISIT06), Seattle, July 2006
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Moufek, H., Guenda, K. (2015). New Variant of the McEliece Cryptosystem. In: Pinto, R., Rocha Malonek, P., Vettori, P. (eds) Coding Theory and Applications. CIM Series in Mathematical Sciences, vol 3. Springer, Cham. https://doi.org/10.1007/978-3-319-17296-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-17296-5_31
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17295-8
Online ISBN: 978-3-319-17296-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)