Journal: Des. Codes Cryptography

Volume 82, Issue 1-2

1 -- 2Pascale Charpin, Thomas Johansson, Gohar M. M. Kyureghyan, Nicolas Sendrier, Jean-Pierre Tillich. Editorial: Special issue on coding and cryptography
3 -- 25Christina Boura, Anne Canteaut, Lars R. Knudsen, Gregor Leander. Reflection ciphers
27 -- 41Sondre Rønjom. Improving algebraic attacks on stream ciphers based on linear feedback shift register over $$\mathbb {F}_{2^k}$$ F 2 k
43 -- 56Pavol Zajac. Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
57 -- 67Serhii Dyshko. MacWilliams Extension Theorem for MDS codes over a vector space alphabet
69 -- 76Sergey Bezzateev, Natalia A. Shekhunova. Lower bound of covering radius of binary irreducible Goppa codes
77 -- 94Kishan Chand Gupta, Sumit Kumar Pandey, Ayineedi Venkateswarlu. On the direct construction of recursive MDS matrices
95 -- 115Kaushik Chakraborty, Sumanta Sarkar, Subhamoy Maitra, Bodhisatwa Mazumdar, Debdeep Mukhopadhyay, Emmanuel Prouff. Redefining the transparency order
117 -- 129Marine Minier. Improving impossible-differential attacks against Rijndael-160 and Rijndael-224
131 -- 148Santanu Sarkar, Ayineedi Venkateswarlu. Revisiting (nested) Roos bias in RC4 key scheduling algorithm
149 -- 160Srimanta Bhattacharya, Sumanta Sarkar. On some permutation binomials and trinomials over $$\mathbb {F}_{2^n}$$ F 2 n
161 -- 177Mehdi Tibouchi, Taechan Kim 0001. Improved elliptic curve hashing and point representation
179 -- 195Kishan Chand Gupta, Sumit Kumar Pandey, Ayineedi Venkateswarlu. Towards a general construction of recursive MDS diffusion layers
197 -- 209Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Shchukin. Cover-free codes and separating system codes
211 -- 229Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Shchukin. Symmetric disjunctive list-decoding codes
231 -- 247Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Shchukin. Almost cover-free codes and designs
249 -- 263Cem Güneri, Ferruh Özbudak, Funda Özdemir. Hasse-Weil bound for additive cyclic codes
265 -- 291Nurdagül Anbar, Wilfried Meidl, Alev Topuzoglu. Idempotent and p-potent quadratic functions: distribution of nonlinearity and co-dimension
293 -- 299Vladimir Gritsenko, Grigory Kabatiansky, Vladimir Lebedev, Alexey Maevskiy. Signature codes for noisy multiple access adder channel
301 -- 318Jeremy Maitin-Shepard. Optimal software-implemented Itoh-Tsujii inversion for $$\mathbb {F}_{2^{m}}$$ F 2 m
319 -- 349Céline Blondeau, Kaisa Nyberg. Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity
351 -- 375Santanu Sarkar, Subhamoy Maitra, Anubhab Baksi. Observing biases in the state: case studies with Trivium and Trivia-SC
377 -- 388Brandon Dravie, Philippe Guillot, Gilles Millérioux. Security proof of the canonical form of self-synchronizing stream ciphers
389 -- 409Sven Puchinger, Johan Rosenkilde né Nielsen, Wenhui Li, Vladimir Sidorenko. Row reduction applied to decoding of rank-metric and subspace codes
411 -- 433Peter Boyvalenkov, P. D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova. Energy bounds for codes and designs in Hamming spaces
435 -- 447Valentin Suder. Antiderivative functions over $$\mathbb {F}_{2^n}$$ F 2 n
449 -- 467Hannes Bartz, Vladimir Sidorenko. Algebraic decoding of folded Gabidulin codes
469 -- 493Quentin Alamélou, Olivier Blazy, Stéphane Cauchie, Philippe Gaborit. A code-based group signature scheme
495 -- 509Anthony Journault, François-Xavier Standaert, Kerem Varici. Improving the security and efficiency of block ciphers based on LS-designs