Journal: Des. Codes Cryptography

Volume 59, Issue 1-3

1 -- 0Matthew G. Parker, Sasha Kholosha, Pascale Charpin, Eirik Rosnes. Editorial
3 -- 34Céline Blondeau, Benoît Gérard, Jean-Pierre Tillich. Accurate estimates of the data complexity and success probability for various cryptanalyses
35 -- 58Andrey Bogdanov. On unbalanced Feistel networks with contracting MDS diffusion
59 -- 68Nina Brandstätter, Gottlieb Pirsic, Arne Winterhof. Correlation of the two-prime Sidel nikov sequence
69 -- 87Lilya Budaghyan, Claude Carlet. CCZ-equivalence of bent vectorial functions and related constructions
89 -- 109Claude Carlet. Relating three nonlinearity parameters of vectorial functions and building APN functions from bent functions
111 -- 118Danyo Danev, Stefan M. Dodunekov, Diana Radkova. A family of constacyclic ternary quasi-perfect codes with covering radius 3
119 -- 130Lars Eirik Danielsen, Matthew G. Parker. Directed graph representation of half-rate additive codes over GF(4)
131 -- 146Richard G. Gibson, Jonathan Jedwab. Quaternary Golay sequence pairs I: even length
147 -- 157Richard G. Gibson, Jonathan Jedwab. Quaternary Golay sequence pairs II: odd length
159 -- 168David G. Harris. Critique of the related-key attack concept
169 -- 182Marc Joye. How (Not) to design strong-RSA signatures
183 -- 191Torleiv Kløve. Lower bounds on the size of spheres of permutations under the Chebychev distance
193 -- 205Philippe Langevin, Gregor Leander. Counting all bent functions in dimension eight 99270589265934370305785861242880
207 -- 222Gregor Leander, François Rodier. Bounds on the degree of APN polynomials: the case of ::::x:::::::-1::: + ::::g::::(::::x::::)
223 -- 230Petr Lisonek, Marko J. Moisio. On zeros of Kloosterman sums
231 -- 245Subhamoy Maitra, Goutam Paul, Shashwat Raizada, Subhabrata Sen, Rudradev Sengupta. Some observations on HC-128
247 -- 263Stéphane Manuel. Classification and generation of disturbance vectors for collision attacks against SHA-1
265 -- 279Sihem Mesnager. A new class of bent and hyper-bent Boolean functions in polynomial forms
281 -- 285Patric R. J. Östergård, Olli Pottonen. Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes
287 -- 318Elif Kurtaran Özbudak, Ferruh Özbudak, Zülfükar Saygi. A class of authentication codes with secrecy
319 -- 331Alexander Pott, Yin Tan, Tao Feng, San Ling. Association schemes arising from bent functions
349 -- 364Igor Semaev. Sparse Boolean equations and circuit lattices