default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDesigns, Codes and Cryptography, Volume 59
Volume 59, Numbers 1-3, April 2011
- Matthew Geoffrey Parker, Sasha Kholosha, Pascale Charpin, Eirik Rosnes:
Editorial. 1 - Céline Blondeau
, Benoît Gérard, Jean-Pierre Tillich:
Accurate estimates of the data complexity and success probability for various cryptanalyses. 3-34 - Andrey Bogdanov:
On unbalanced Feistel networks with contracting MDS diffusion. 35-58 - Nina Brandstätter, Gottlieb Pirsic, Arne Winterhof:
Correlation of the two-prime Sidel'nikov sequence. 59-68 - Lilya Budaghyan, Claude Carlet:
CCZ-equivalence of bent vectorial functions and related constructions. 69-87 - Claude Carlet:
Relating three nonlinearity parameters of vectorial functions and building APN functions from bent functions. 89-109 - Danyo Danev, Stefan M. Dodunekov, Diana Radkova:
A family of constacyclic ternary quasi-perfect codes with covering radius 3. 111-118 - Lars Eirik Danielsen, Matthew Geoffrey Parker:
Directed graph representation of half-rate additive codes over GF(4). 119-130 - Richard G. Gibson, Jonathan Jedwab:
Quaternary Golay sequence pairs I: even length. 131-146 - Richard G. Gibson, Jonathan Jedwab:
Quaternary Golay sequence pairs II: odd length. 147-157 - David G. Harris:
Critique of the related-key attack concept. 159-168 - Marc Joye:
How (Not) to design strong-RSA signatures. 169-182 - Torleiv Kløve:
Lower bounds on the size of spheres of permutations under the Chebychev distance. 183-191 - Philippe Langevin, Gregor Leander:
Counting all bent functions in dimension eight 99270589265934370305785861242880. 193-205 - Gregor Leander, François Rodier:
Bounds on the degree of APN polynomials: the case of x-1 + g(x). 207-222 - Petr Lisonek, Marko J. Moisio:
On zeros of Kloosterman sums. 223-230 - Subhamoy Maitra, Goutam Paul, Shashwat Raizada, Subhabrata Sen, Rudradev Sengupta:
Some observations on HC-128. 231-245 - Stéphane Manuel:
Classification and generation of disturbance vectors for collision attacks against SHA-1. 247-263 - Sihem Mesnager:
A new class of bent and hyper-bent Boolean functions in polynomial forms. 265-279 - Patric R. J. Östergård, Olli Pottonen:
Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes. 281-285 - Elif Kurtaran Özbudak, Ferruh Özbudak, Zülfükar Saygi:
A class of authentication codes with secrecy. 287-318 - Alexander Pott, Yin Tan, Tao Feng, San Ling:
Association schemes arising from bent functions. 319-331 - Kai-Uwe Schmidt:
On the correlation distribution of Delsarte-Goethals sequences. 333-347 - Igor A. Semaev:
Sparse Boolean equations and circuit lattices. 349-364
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-20 21:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
