Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding text files of various sizes into BMP images. This paper presents a deeper algorithm performance evaluation; in particular, it evaluates the effects of length of permutation and occupation ratio on stego image quality and steganography processing time. Furthermore, it evaluates the algorithm performance for concealing different types of secret media, such as MS office file formats, image files, PDF files, executable files, and compressed files.
