Author : Renuka Sahu 1
Date of Publication :25th February 2018
Abstract: Nowadays security on network is major challenge. For securing the information on network various public key Encryption schemes are used. In this paper, we introduced a new scheme called Random Hexi Code Encryption Scheme. In this encryption scheme, Binary Goppa Code is changed via Hexi Code which is more secure against attacks executed on the present variations of McEliece PKC and RLCE scheme. This new scheme has better error correcting ability and lesser time complexity making it more feasible to apply.
Reference :
-
- M. Baldi, M. Bodrato, and F. Chiaraluce. A new analysis of the mceliece cryptosystem based on qcldpc codes. In Security and Cryptography for Networks, pages 246–262. Springer, 2008.
- T.P. Berger, P.-L. Cayrel, P. Gaborit, and A. Otmani. Reducing key length of the mceliece cryptosys- ˜ tem. In Progress in Cryptology–AFRICACRYPT 2009, pages 77–97. Springer, 2009.
- T.P Berger and P. Loidreau. How to mask the structure of codes for a cryptographic use. Designs, Codes and Cryptography, 35(1):63–79, 2005.
- K. Ilanthenral and K.S. Easwarakumar, Design of Hexi cipher for error correction–using Quasi Cyclic Partial hexi codes, Journal of Applied Mathematics and Information Sciences, 7, 2063-2071 (2013).
- K. Ilanthenral and K.S. Easwarakumar, Hexi McEliece Public key cryprosystem, Journal of Applied Mathematics and Information Sciences, 5, 2595-2603 (2014)
- [6] H. Janwa and O. Moreno. Mceliece public key cryptosystems using algebraic-geometric codes. Designs, Codes and Cryptography, 8(3):293–307, 1996.
- C. Londahl and T. Johansson. A new version of mceliece pkc based on convolutional codes. In ¨ Information and Communications Security, pages 461–470. Springer, 2012
- R.J. McEliece, A public-key cryptosystem based on algebraic coding theory, Jet Propulsion Laboratory DSN Progress Report, 4244, 114-116 (1978).
- R. Misoczki, J.-P. Tillich, N. Sendrier, and P. Barreto. MDPC-McEliece: New McEliece variants from moderate density parity-check codes. In Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on, pages 2069–2073. IEEE, 2013.
- R. Misoczki and P. Barreto. Compact mceliece keys from goppa codes. In Selected Areas in Cryptography, pages 376–392. Springer, 2009
- R. Misoczki, J.-P. Tillich, N. Sendrier, and P. Barreto. MDPC- McEliece: New McEliece variants from moderate density parity-check codes. In Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on, pages 2069–2073. IEEE, 2013.
- H. Niederreiter. Knapsack-type cryptosystems and algebraic coding theory. Prob. Control and Information Theory, 15(2):159–166, 1986.
- N. Courtois, M.Finiaz and N.Sendrier, How to achieve a McEliece based digital signature scheme, Advances in cryptology - ASIACRYPT 2001, Springer Verlag, 2248, 157-174 (2001).
- V.M. Sidelnikov. A public-key cryptosystem based on binary reed-muller codes. Discrete Mathematics and Applications, 4(3):191–208, 1994.
- V. M. Sidelnikov and S. Shestakov. On insecurity of cryptosystems based on generalized Reed-Solomon codes. Discrete mathematics and Applications,2(4):439-444, 1992.
- Y. Wang. Random linear code based public key encryption implementation http://webpages.uncc. edu/yonwang/rlce.html, 2015