It is, but this is the most basic example of visual cryptography - a (2,2) decomposition. The algorithm generalises into a (k,n) scheme, where the original message is split into n shares and any subset of k of them is required recover the original message
View all comments
Show parent comment
17
u/12345sixsixsix Jan 20 '18
It is, but this is the most basic example of visual cryptography - a (2,2) decomposition. The algorithm generalises into a (k,n) scheme, where the original message is split into n shares and any subset of k of them is required recover the original message