BCH Codes with computational approach and its applications in image encryption

被引:20
作者
Asif, Muhammad [1 ]
Shah, Tariq [1 ]
机构
[1] Quaid I Azam Univ, Dept Math, Islamabad, Pakistan
关键词
Primitive BCH-code; Galois ring; Galois field; generator polynomial; AES algorithm; EXTENSIONS; ALGORITHM;
D O I
10.3233/JIFS-190137
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Accelerated adventures in computer Science and technology has made digital technology, a need of the day. Academicians, researchers, and technologists are anxious to share their secret data through the communication channel along with its security. The security of data, transmission rate, and error correction capability are the fundamental questions against the data transmission through any algebraic code dependent communication channel. Though, data security is always questioned due to the synchronized encoding and decoding algorithms. In this paper, a novel approach is developed to ensure the data security issues occurred due to synchronized encoding-decoding of a BCH code and for data transmission, a computational technique is designed by which data can be encoded and transmitted by using Field-Linear BCH code or a Ring-Linear BCH code of the same dimension, designed distance and code length. Although the Ring-Linear BCH code is preferable for encoding, on the other hand decoding of data is adept by Field-Linear BCH code. Accordingly, a computational technique of Barlekamp Massey Algorithm is utilized for the purpose. This scheme provides a quick code selection of the desired level of transmission rate and error correction capability during the communication. Thus, it also addresses the dimension issue of primitive BCH code. In addition, for the data security perspective we utilize a BCH code in round key addition and mixed column matrix steps in AES algorithm and then put on this modified AES algorithm to image encryption. The image encryption quality permits to incorporate this alteration in AES.
引用
收藏
页码:3925 / 3939
页数:15
相关论文
共 22 条
[1]  
Andrade D., 2011, TEMA Tendencias Em Matematica Aplicada e Computacional, V12, P79
[2]   An association between primitive and non-primitive BCH codes using monoid rings [J].
Ansari, Asma Shaheen ;
Shah, Tariq .
EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2016, :1-9
[3]   CODES OVER INTEGER RESIDUE RINGS [J].
BLAKE, IF .
INFORMATION AND CONTROL, 1975, 29 (04) :295-300
[4]   CODES OVER CERTAIN RINGS [J].
BLAKE, IF .
INFORMATION AND CONTROL, 1972, 20 (04) :396-&
[5]   An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings [J].
Cazaran, J. ;
Kelarev, A. V. ;
Quinn, S. J. ;
Vertigan, D. .
SEMIGROUP FORUM, 2006, 73 (03) :317-329
[6]   Construction and decoding of BCH Codes over finite commutative rings [J].
de Andrade, AA ;
Palazzo, R .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1999, 286 (1-3) :69-85
[7]   The dimension and, minimum distance of two classes of primitive BCH, codes [J].
Ding, Cunsheng ;
Fan, Cuiling ;
Zhou, Zhengchun .
FINITE FIELDS AND THEIR APPLICATIONS, 2017, 45 :237-263
[8]   Binary cyclic codes from explicit polynomials over GF(2m) [J].
Ding, Cunsheng ;
Zhou, Zhengchun .
DISCRETE MATHEMATICS, 2014, 321 :76-89
[9]   On the decoding of Reed-Solomon and BCH codes over integer residue rings [J].
Interlando, JC ;
Palazzo, R ;
Elia, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (03) :1013-1021
[10]   Algorithms for computing parameters of graph-based extensions of BCH codes [J].
Kelarev, A. V. .
JOURNAL OF DISCRETE ALGORITHMS, 2007, 5 (03) :553-563