[[1] BALDI, M.—CHIARALUCE, F.: Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes, in: Internat. Symposium on Information Theory—ISIT ’07, Nice, France, 2007, IEEE, 2007, pp. 2591–2595.10.1109/ISIT.2007.4557609]Search in Google Scholar
[[2] BALDI, M.—BODRATO, M.—CHIARALUCE, F.: A new analysis of the McEliece cryptosystem based on QC-LDPC codes, in: 6th Internat. Conf. on Security and Cryptography for Networks—SCN ’08, Amalfi, Italy, 2008, (R. Ostrovsky et al., eds.), Lecture Notes in Comput. Sci., Vol. 5229, Springer-Verlag, Berlin, 2008, pp. 246–262.]Search in Google Scholar
[[3] LIDL, R.—NIEDERREITER, H.: Finite Fields. Cambridge University Press, Cambridge, 2008.]Search in Google Scholar
[[4] MCELIECE, R. J.: A public-key cryptosystem based on algebraic coding theory, DSN Progress Report, 1978, pp. 114–116.]Search in Google Scholar
[[5] REPKA, M.—ZAJAC, P.: Overview of the McEliece cryptosystem and its security, Tatra Mt. Math. Publ. 60 (2014), 57–83.]Search in Google Scholar
[[6] SINGHMASTER, D.: Divisibility of binomial and multinomial coeficients by primes and prime powers, in: A Collection of Manuscripts Related to the Fibonacci Sequence, 18th Anniversary Volume of the Fibonacci Association, 1980, pp. 98–113.]Search in Google Scholar
[[7] ZAJAC, P.—ONDROŠ, M.: Rotational cryptanalysis of GOST with identical S-boxes. Tatra Mt. Math. Publ. 57 (2013), 1–19.]Search in Google Scholar
