Effective attack on the McEliece cryptosystem based on Reed-Muller codes
AbstractMcEliece cryptosystem is an public-key cryptosystem; its security is based on the complexity of decoding problem for an arbitrary error-correcting code. V. M. Sidel’nikov in 1994 suggested to construct the cryptosystem on the base of binary Reed-Muller code. In 2007 L. Minder and A. Shokrollahi had designed a structural attack on theMcEliece cryptosystem based on the Reed-Muller codes.Herewe improve their attack and suggest a polynomial attack on the McEliece cryptosystem based on Reed-Muller codes RM(r, m) such that GCD(r,m − 1) = 1.
2014 ◽
Vol 962-965
◽
pp. 2814-2817
Keyword(s):
2014 ◽
Vol 19
(6)
◽
pp. 489-496
2021 ◽
Vol 03
(03)
◽
pp. 31-40
1996 ◽
Vol 143
(1)
◽
pp. 96
◽
2018 ◽
Vol E101.A
(1)
◽
pp. 29-38
2014 ◽
Vol E97.A
(1)
◽
pp. 298-299
◽
2011 ◽
Vol 30
(6)
◽
pp. 1450-1452
◽
2021 ◽
Vol 1897
(1)
◽
pp. 012045