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