THE SECURITY OF TEXT DATA BASED ON CYCLIC CODES OVER ALGEBRAIC STRUCTURE

被引:0
|
作者
Bahaddad, Adel [1 ]
Asif, Muhammad [2 ]
Ashraf, M. Usman [3 ]
Asiri, Yousef [4 ]
Alkhalaf, Salem [5 ]
机构
[1] King Abdulaziz Univ, Fac Comp & Informat Technol, Jeddah, Saudi Arabia
[2] Univ Management & Technol, Dept Math, Sialkot Campus, Sialkot, Pakistan
[3] GC Women Univ Sialkot, Dept Comp Sci, Sialkot, Pakistan
[4] Najran Univ, Coll Comp Sci & Informat Syst, Najran, Saudi Arabia
[5] Qassim Univ, Coll Comp, Dept Informat Technol, Buraydah, Saudi Arabia
来源
THERMAL SCIENCE | 2024年 / 28卷 / 6B期
关键词
AES algorithm; cryptography; cipher text; cyclic codes; Galois field;
D O I
10.2298/TSCI2406205B
中图分类号
O414.1 [热力学];
学科分类号
摘要
The demand for network security is increasing exponentially as businesses strive to protect personal data from theft or loss. Data security is a paramount concern for both individuals and organizations engaged in various forms of communication, particularly in cyberspace due to the rise of digital computing and communication. With the rapid advancement in digital data exchange, securing information during transmission and storage has become increasingly critical. Given the extensive use of text in security agencies and industries, it is crucial to protect confidential text data from unauthorized access. This paper proposes the use of Bose Chaudhary Hochquenghem (BCH) codes over the Galois field in a modified advanced encryption standard (AES) algorithm to secure text data. Secret keys are generated using the generator polynomial of BCH codes over the Galois field, which is also applied to construct maximum distance separable (MDS) matrices. The proposed scheme enhances the mixed column operation and sub-key construction steps of the AES algorithm using BCH codes over the Galois field. The secret key, based on the designed distance of BCH codes, is difficult to predict using exhaustive key search methods. The avalanche effect test, involving single-bit changes in plaintext and secret keys, along with the popular national institute of standards and technology (KIST) test, confirms that the proposed scheme improves ciphertext encryption. Sethe future, this approach could be adapted for encrypting images, audio, and video.
引用
收藏
页码:5205 / 5215
页数:11
相关论文
共 50 条
  • [41] Cyclic codes over Rk
    Steven T. Dougherty
    Suat Karadeniz
    Bahattin Yildiz
    Designs, Codes and Cryptography, 2012, 63 : 113 - 126
  • [42] Cyclic codes over Rk
    Dougherty, Steven T.
    Karadeniz, Suat
    Yildiz, Bahattin
    DESIGNS CODES AND CRYPTOGRAPHY, 2012, 63 (01) : 113 - 126
  • [43] The algebraic structure of additive codes over F2F8
    Cheng, Xiangdong
    JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2024, 23 (02)
  • [44] Concatenated structure of cyclic codes over of length 4n
    Cao, Yonglin
    Cao, Yuan
    Li, Qingguo
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2016, 27 (04) : 279 - 302
  • [45] On the Structure of Cyclic Codes over Fq+uFq+vFq+uvFq
    XU Xiaofang
    WuhanUniversityJournalofNaturalSciences, 2011, 16 (05) : 457 - 460
  • [46] Group structure on projective spaces and cyclic codes over finite fields
    Lachaud, G
    Lucien, I
    Mercier, DJ
    Rolland, R
    FINITE FIELDS AND THEIR APPLICATIONS, 2000, 6 (02) : 119 - 129
  • [47] Non-binary quantum synchronizable codes based on cyclic codes over Fq
    Sun, Shiwen
    Yan, Tongjiang
    Sun, Yuhua
    Wang, Tao
    Wang, Xueting
    QUANTUM INFORMATION PROCESSING, 2023, 22 (01)
  • [48] Quasi-cyclic codes: algebraic properties and applications
    Zeraatpisheh, Mohamadbagher
    Esmaeili, Morteza
    Gulliver, T. Aaron
    COMPUTATIONAL & APPLIED MATHEMATICS, 2020, 39 (02):
  • [49] GENERAL-PRINCIPLES FOR THE ALGEBRAIC DECODING OF CYCLIC CODES
    CHEN, XM
    REED, IS
    HELLESETH, T
    TRUONG, TK
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (05) : 1661 - 1663
  • [50] Quasi-Cyclic LDPC Codes: An Algebraic Construction
    Kang, Jingyu
    Huang, Qin
    Zhang, Li
    Zhou, Bo
    Lin, Shu
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2010, 58 (05) : 1383 - 1396