Image Encryption Using Novel Mappings over GF(2^n)
Abstract
Galois Field GF(2^n) is valuable to encryption and has been used in some famous encryption algorithms, such as BCH and AES. In practical application, image encryptions are used widely to protect information in transmission. This paper will propose two image encryption techniques based on two novel mappings over GF(2^n): One involves a transformation consisting of a linear transformation and a Frobenius automorphism, which shuffles pixels’ positions, that is, a permutation, giving a good diffusion effect, and another one alters pixels’ values and gives dramatic confusion effect. Key Words: Galois field; Frobenius automorphism; Linear transformation; Confusion; Diffusion
Full Text:
PDFDOI: http://dx.doi.org/10.3968/j.sms.1923845220120201.015
DOI (PDF): http://dx.doi.org/10.3968/g1555
Refbacks
- There are currently no refbacks.
Copyright (c)
Please send your manuscripts to sms@cscanada.net,or sms@cscanada.org for consideration. We look forward to receiving your work.
Articles published in Studies in Mathematical Sciences are licensed under Creative Commons Attribution 4.0 (CC-BY).
STUDIES IN MATHEMATICAL SCIENCES Editorial Office
Address: 1055 Rue Lucien-L'Allier, Unit #772, Montreal, QC H3G 3C4, Canada.
Telephone: 1-514-558 6138
Http://www.cscanada.net
Http://www.cscanada.org
E-mail:caooc@hotmail.com
Copyright © 2010 Canadian Research & Development Centre of Sciences and Cultures