Image Encryption Using Novel Mappings over GF(2^n)

Liebin YAN, Ruisong YE

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:

PDF


DOI: http://dx.doi.org/10.3968%2Fj.sms.1923845220120201.015

Refbacks

  • There are currently no refbacks.


Reminder

If you have already registered in Journal A and plan to submit article(s) to Journal B, please click the CATEGORIES, or JOURNALS A-Z on the right side of the "HOME".


We only use three mailboxes as follows to deal with issues about paper acceptance, payment and submission of electronic versions of our journals to databases:
caooc@hotmail.com; sms@cscanada.net; sms@cscanada.org

Copyright © 2010 Canadian Research & Development Centre of Sciences and Cultures
Address: 730, 77e AV, Laval, Quebec, H7V 4A8, Canada

Telephone: 1-514-558 6138
Http://www.cscanada.net
Http://www.cscanada.org
E-mail:caooc@hotmail.com