In digital image security, the Josephus permutation is widely used in cryptography to enhance randomness. However, its application in steganography is underexplored. This study introduces a novel method integrating the Josephus permutation into the LSB 3-3-2 embedding technique for image steganography. This approach improves the randomness of the keystream generated by the chaotic logistic map, addressing vulnerabilities in basic logistic maps susceptible to steganalysis. Our algorithm is tested on RGB images as secret data, presenting higher complexity compared to grayscale images used in previous studies. Comparative analysis shows that the proposed algorithm offers higher payload capacity while maintaining image quality, outperforming traditional LSB techniques. This research advances the field of image steganography by demonstrating the effectiveness of the Josephus permutation in creating more secure and robust steganographic images.

Protection to classified digital data becomes so important in avoiding data manipulation and alteration. The focus of this paper is in data and information protection of digital images form. Protection is provided in the form of encrypted digital image. The encryption process uses a new map, xn+1 = rλxn 1+λ(1-xn) 2 (mod 1), which is called MS map. This paper will show: the results of digital image encryption using MS map and how the performance is regarding the average time needed for encryption/decryption process; randomness of key stream sequence with NIST test, histogram analysis and goodness of fit test, quality of the decrypted image by PSNR, initial value sensitivity level, and key space. The results show that the average time of the encryption process is relatively same as the decryption process and it depends to types and sizes of the image. Cipherimage (encrypted image) is uniformly distributed since: it passes the goodness of fit test and also the histogram of the cipherimage is flat; key stream, that are generated by MS map, passes frequency (monobit) test, and runs test, which means the key stream is a random sequence; the decrypted image has same quality as the original image; and initial value sensitivity reaches 10-17, and key space reaches 3.24 × 10 634. So, that encryption algorithm generated by MS map is more resistant to brute-force attack and known plaintext attack.

This paper presents a novel discrete-time (DT) chaotic map-based random-number generator (RNG), namely the Siponi map, which is a modification of the Logistic map. The Logistic map is usually applied to cryptosystems, mainly for the purposes of generating random numbers. In addition to being easy to implement, it has a better security level than other nonlinear functions. However, it can only process positive real-number inputs. Our proposed map is a deterministic function that can process positive and negative real values. We explored the map comprehensively and investigated its characteristics and parameters. We calculated the optimum parameter values using empirical and theoretical mathematical models to yield the maximum randomness of a sequence of bits. The limit variation of the maximum parameter value was determined based on a practical information measure. Empirical verification was performed for the Siponi map to generate bit sequences unrelated to the previous bit with high entropy values, and we found the extractor function threshold value to be 0.5, while the parameter control was −2 or 2. Using our proposed map, a simple RNG without post-processing passed DieHard statistical tests and all the tests on the NIST SP 800-22. Finally, we have implemented a Siponi map-based RNG on the FPGA board and demonstrated that the sources used are LUT = 4086, DSP = 62, and register = 2206.

This paper focus on keeping data and information confidentiality on digital image based on chaotic system. In this paper, we use the unmodified SIYu map for the encryption and embedding process and use 3-3-2 LSB insertion method to embed data to cover image. This paper will show how is the result of encryption process and embedding process using SIYu map. Furthermore, we will show our algorithm performance based on randomness of sequence generated by SIYu map with NIST test and entropy test, histogram analysis, goodness of fit test, quality of the stego image, quality of decrypted data, initial value sensitivity, and key space. The results show encrypted data is uniformly distributed; sequence generated by SIYu map passes all NIST test and entropy test, which means the generated sequence is random; stego image have a good quality, it can be seen from the correlation coefficient and PSNR value more than 40 dB; decrypted data has the same quality as the original data; initial value sensitivity reaches 10⁻¹⁶; key space reaches 2.56 × 10⁹⁴; and add noises can be optional to increase data confidentiality. For the conclusion, our algorithm can be used to keeping data and information confidentiality on digital image.

The key sequence is one of the main elements in the cryptosystem. True Random Number Generators (TRNG) method is one of the approaches to generating the key sequence. The randomness source of the TRNG divided into three main groups, i.e. electrical noise based, jitter based and chaos based. The chaos based utilizes a non-linear dynamic system (continuous time or discrete time) as an entropy source. In this study, a new design of TRNG based on discrete time chaotic system is proposed, which is then simulated in LabVIEW. The principle of the design consists of combining 2D and 1D chaotic systems. A mathematical model is implemented for numerical simulations. We used comparator process as a harvester method to obtain the series of random bits. Without any post processing, the proposed design generated random bit sequence with high entropy value and passed all NIST 800.22 statistical tests.