Volume 59, Issue 1-3

Search all Designs, Codes and Cryptography articles

April 2011

Special Issue: Coding and Cryptography

Issue Editors:

Pascale Charpin,
Alexander Kholosha,
Eirik Rosnes,
Matthew G. Parker

24 articles in this issue

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

Volume 59, Issue 1-3

Search

Navigation