Jump to content

Talk:Binary Goppa code

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 6 years ago by 212.79.106.136 in topic Goppa Codes in Niederreiter's cryptosystem?

Untitled

[edit]

The parity check matrix H is in the form H=VD. As currently written in the Wiki, matrix V is (t+1)×n, and D is n×n. Therefore, H must be (t+1)×n, whereas the text mentions that H is a t-by-n matrix. I believe matrix V must be corrected. MSDousti (talk) 20:02, 16 July 2013 (UTC)Reply

I have corrected the matrix by changing the highest powers from incorrect t to correct t−1. Stefkar (talk) 18:39, 15 February 2018 (UTC)Reply

Misleading use of ℤn

[edit]

Please change the line

∀i,j∈ℤn:Li∈GF(2m)∧Li≠Lj∧g(Li)≠0

into

∀i,j∈{1,...,n}:Li∈GF(2m)∧Li≠Lj∧g(Li)≠0

In the latter i,j are just indizes running from 1 through n, in the former they are elements of the coset ring ℤn=ℤ/nℤ, which has a lot more algebraic structure. (Addtion, multiplication and x=x+kn.) It was taking me nearly 15 minutes wondering what the purpose of the coset ring is and how it is related to n before I understood that ℤn is meant to be an ugly short form for {1,...,n}

Goppa Codes in Niederreiter's cryptosystem?

[edit]

The text currently states: ... the binary Goppa codes are used in several post-quantum cryptosystems, notably McEliece cryptosystem and Niederreiter cryptosystem.

However, the Niederreiter cryptosystem proposed using Generalized Reed-Solomon (GRS) codes instead of Goppa codes in an attempt to make his cryptosystem more efficient and practical compared to McEliece's cryptosystem. - Markovisch (talk) 19:58, 19 April 2017 (UTC)Reply

Hello! The GRS Niederreiter is certainly "faster" but it was broken by Sidelnikov&Shestakov (see [1]). As far as I know, binary Goppa codes and MDPCs are now the "simplest" codes useful in Niederreiter. Also see the thesis of Weger (2017) [2] 212.79.106.136 (talk) 08:57, 3 December 2019 (UTC)Reply

References

  1. ↑ V. Sidelnikov, S. Shestakov. On Insecurity of Cryptosystems based on Gen-eralized Reed-Solomon Codes.Discrete Math Appl., volume 2. Pages: 439-444, 1992
  2. ↑ Weger, Violetta (2017). A Code-Based Cryptosystem using GRS codes. University of Zurich, Institute of Mathematics (master thesis). https://user.math.uzh.ch/rosenthal/masterthesis/11720935/Weger_2017.pdf