Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein-Jacobi integers and Lipschitz integers

초록

Steganography is the science of communicating a secret message by hiding it in a cover object. The well known F5 algorithm is based on binary Hamming codes in Hamming graph. It has been an interesting research problem to construct other steganographic schemes from mathematically structured graphs. In this paper, we construct steganographic schemes explicitly from r-perfect codes on Cayley graphs over Gaussian integers, Eisenstein-Jacobi integers, and Lipschitz integers, respectively. Then we further compute various parameters for the suggested steganographic schemes.

키워드