Steganography using Biased Random Keys Genetic Algorithm

Authors

  • Getulio dos Santos Araujo Universidade Federal do Tocantins https://orcid.org/0009-0002-5398-3349
  • Warley Gramacho da Silva Universidade Federal do Tocantins

DOI:

https://doi.org/10.20873/uft.2675-3588.2023.v4n2.p69-72

Keywords:

steganography, substitution matrix, combinatorial problem, heuristic techniques, BRKGA, Metaheuristic

Abstract

Steganography is seen favorably in the digital world as an alternative for sending data via files in digital format, but there is some questioning regarding its quality and security, given that a simple degradation exposes it to data interception. In order to minimize this, the use of the substitution matrix technique tends to “mask” the embedded information, which, if remodeled, can be represented by a vector of size n, with n different values between 0 and n-1 that are ordered in a specific way can determine the sequence of bits that will replace a given sequence of bits. Finding an optimal configuration for a substitution matrix is a combinatorial problem, and deterministically infeasible, requiring the use of heuristics to find a quasi-optimal solution. In the present project we apply the concepts of Genetic Algorithms with Biased Random Keys (BRKGA) to find it, at the same time that its efficiency is attested in relation to the approach of steganography, applications of its concepts in conventional Genetic Algorithms. In the end, we concluded that some aspects may have contributed to its efficiency in relation to the GA approach proposed by [1].

Published

2023-10-16

How to Cite

[1]
dos Santos Araujo, G. and Gramacho da Silva , W. 2023. Steganography using Biased Random Keys Genetic Algorithm. Academic Journal on Computing, Engineering and Applied Mathematics. 4, 2 (Oct. 2023), 69–72. DOI:https://doi.org/10.20873/uft.2675-3588.2023.v4n2.p69-72.

Issue

Section

Special Issue

Categories