Theory of perpendicular arrays

DOI10.1002/jcd.3180020603zbMath0824.05011OpenAlexW2078143123MaRDI QIDQ4764668

Yves Edel, Juergen Bierbrauer

Publication date: 20 May 1995

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.3180020603

zbMATH Keywords

cryptographyorthogonal arraysblock designsperpendicular arraysauthentication perpendicular arraysRoom cubes

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of block designs (05B05) Cryptography (94A60) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (6)

Construction of orthogonal arrays ⋮ Authentication codes in plaintext and chosen-content attacks ⋮ A bound on permutation codes ⋮ Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\). ⋮ Efficient designs based on orthogonal arrays of type I and type II for experiments using units ordered over time or space ⋮ Large sets with multiplicity

Cites Work

• A construction for authentication/secrecy codes from 3-homogeneous permutation groups
• A family of perpendicular arrays achieving perfect 4-fold secrecy

This page was built for publication: Theory of perpendicular arrays