Non-Monotonic XOR Visual Cryptography via Krawtchouk Numbers
Classical visual cryptography is monotonic: once a set of shares reveals the secret, every larger set reveals it too. XOR-based schemes can be non-monotonic, revealing the secret for exactly three of four shares, but such schemes have so far been found only by hand. We show that prescribing the contrast for every number of combined shares reduces to a linear system whose matrix is always invertible, with an explicit inverse given by Krawtchouk numbers. Basis matrices realizing any prescribed behavior follow from one matrix-vector product. We also give integrality conditions and explicit examples.
Authors
- Soufiane Mezroui (ORCID: https://orcid.org/0000-0003-2705-9806)
- Chihi Hasnae (ORCID: https://orcid.org/0009-0003-6196-1059)
- Asaad Chahboun
Institutions
- Abdelmalek Essaâdi University (MA)
Publication Details
- Journal
- Gulf Journal of Mathematics
- Published
- 2026-11-20
- DOI
- https://doi.org/10.56947/x4bnxp71
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00