k-Potent Matrices-Construction and Applications in Digital Image Encryption
Recent Advances in Applied Mathematics: Proceedings of the American Conference on Applied Mathematics
A k-potent matrix is any matrix A, the kth power of which is a linear combination of the identity matrix and A, for example, unipotent, idempotent, and involutary matrices are special k-potent matrices. Such matrices have values in applications to digital image encryption. In order to achieve lossless image decryption, all arithmetic operations are restricted over the integer field. Therefore, algorithms are sought to construct integral k-potent matrices. It turns out that the unique eigenstructure of these matrices provides the key for constructing k-potent matrices systematically. In this paper, we explore the spectral properties of k-potent matrices and applications to digital image encryption.
"k-Potent Matrices-Construction and Applications in Digital Image Encryption."
Recent Advances in Applied Mathematics: Proceedings of the American Conference on Applied Mathematics, Stephen Lagakos, Leonid Perlovsky, Manoj Jha, Brindusa Covaci, Azami Zaharim, and Nikos Mastorakis (Ed.): 455-460 Cambridge, MA: World Scientific and Engineering Academy and Society Press.
source: http://www.wseas.us/e-library/conferences/2010/Harvard/MATH/MATH-074.pdf isbn: 978-960-474-150-2