Skip to main content

Designs, Codes and Cryptography OnlineFirst articles


Editorial: Special issue on coding and cryptography


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 …


Preface to the special issue on finite geometries


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 …


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 …

Current Publications

About this journal

There is a great deal of activity in design theory, coding theory and cryptography and recently there has been considerable research done which brings together more than one of the subjects. Designs, Codes and Cryptography provides a forum for high quality papers of both a theoretical and a practical nature which bridge more than one of these areas, encouraging interaction between them. It emphasizes the algebraic and geometric aspects of design theory, coding theory and cryptography.

The journal is widely read by engineers, mathematicians, computer scientists and others in education, industry and government.

Additional information

Premium Partner

image credits