“…The main idea behind our proposed new steganography approach, which attempts to strike a good balance between embedding transparency and capacity as detailed next, stems from these observations. Let us assume that, M = {m 1 , m 2 , …, m L } is the bit set of a given secret message (it may be encrypted beforehand, which is irrelevant in this scheme), where L is the length of the secret message; B = {b 1 , b 2 , …, b N } is the LSB set of each VoIP packet, where, N is the total number of LSBs, and the selection of LSBs can refer to previous methods [9]. We divide B into S parts, namely, B = {B' 1 , B' 2 , …, B' S }, where…”