Designs, Codes and Cryptography

Designs, Codes and Cryptography OnlineFirst articles

12-01-2019

Editorial: Special issue on coding and cryptography

09-01-2019

Transparency order for Boolean functions: analysis and construction

The notion of transparency order, proposed by Prouff (DPA attacks and S-boxes, FSE 2005, LNCS 3557, Springer, Berlin, 2005) and then redefined by Chakraborty et al. (Des Codes Cryptogr 82:95–115, 2017), is a property that attempts to characterize …

08-01-2019

Preface to the special issue on finite geometries

05-01-2019

Projective Reed–Muller type codes on higher dimensional scrolls

In 1988 Lachaud introduced the class of projective Reed–Muller codes, defined by evaluating the space of homogeneous polynomials of a fixed degree d on the points of $$\mathbb {P}^n(\mathbb {F}_q)$$ P n ( F q ) . In this paper we evaluate the same …

05-01-2019

On (t, L)-fold perfect authentication and secrecy codes with arbitration

An authentication code with arbitration is t-fold perfect if the numbers of decoding rules and encoding rules meet the information-theoretic lower bounds with equality. A code has perfect L-fold secrecy if observing a set of $$L'\le L$$ L ′ ≤ L …

Additional information

Title

Designs, Codes and Cryptography

Publisher

Springer US

Coverage

Volume 10/1997 - Volume 87/2019

Print ISSN

0925-1022

Electronic ISSN

1573-7586

DOI

https://doi.org/10.1007/10623.1573-7586

Journal ID

10623