Non-Monotonic XOR Visual Cryptography via Krawtchouk Numbers
Main Article Content
Abstract
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.
Article Details
Issue
Section
Articles
How to Cite
Non-Monotonic XOR Visual Cryptography via Krawtchouk Numbers. (2026). Gulf Journal of Mathematics, 24(2). https://doi.org/10.56947/x4bnxp71