Combinatorial designs are normally used to construct visual cryptographic schemes. For such schemes two parameters are very important viz. pixel expansion and contrast. Optimizing both is a very hard problem. The schemes having optimal contrast tend to use a high pixel expansion. The focus of the paper is to construct schemes for which pixel expansion is modest and the contrast is close to optimality. Here the tool is latin squares that haven't been used earlier for this purpose.
机构:
Masaryk Univ, Fac Informat, Bot 68A, Brno 60200, Czech RepublicMasaryk Univ, Fac Informat, Bot 68A, Brno 60200, Czech Republic
Cooper, Jacob W.
Kral, Daniel
论文数: 0引用数: 0
h-index: 0
机构:
Masaryk Univ, Fac Informat, Bot 68A, Brno 60200, Czech Republic
Univ Warwick, Math Inst, DIMAP, Coventry, W Midlands, England
Univ Warwick, Dept Comp Sci, Coventry, W Midlands, EnglandMasaryk Univ, Fac Informat, Bot 68A, Brno 60200, Czech Republic
Kral, Daniel
Lamaison, Ander
论文数: 0引用数: 0
h-index: 0
机构:
Masaryk Univ, Fac Informat, Bot 68A, Brno 60200, Czech RepublicMasaryk Univ, Fac Informat, Bot 68A, Brno 60200, Czech Republic