Wang Ji Jun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wang Ji Jun has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Tan Soo Fun
Cybersecurity Research Lab, Creative Advanced Machine Intelligence Research Centre, Faculty of Computing and Informatics, University Malaysia Sabah (UMS), Kota Kinabalu 88400, Malaysia
2 shared publications - Yi Yuan
School of Computer Science and Artificial Intelligence, Hunan University of Technology, Zhuzhou, China
1 shared publication
Latest Publications
- Open Access
Random Matrix Transformation and Its Application in Image Hiding
Image coding technology has become an indispensable technology in the field of modern information. With the vigorous development of the big data era, information security has received more attention. Image steganography is an important method of image encoding and hiding, and how to protect information security with this technology is worth studying. Using a basis of mathematical modeling, this paper makes innovations not only in improving the theoretical system of kernel function but also in constructing a random matrix to establish an information-hiding scheme. By using the random matrix as the reference matrix for secret-information steganography, due to the characteristics of the random matrix, the secret information set to be retrieved is very small, reducing the modification range of the steganography image and improving the steganography image quality and efficiency. This scheme can maintain the steganography image quality with a PSNR of 49.95 dB and steganography of 1.5 bits per pixel and can ensure that the steganography efficiency is improved by reducing the steganography set. In order to adapt to different steganography requirements and improve the steganography ability of the steganography schemes, this paper also proposes an adaptive large-capacity information-hiding scheme based on the random matrix. In this scheme, a method of expanding the random matrix is proposed, which can generate a corresponding random matrix according to different steganography capacity requirements to achieve the corresponding secret-information steganography. Two schemes are demonstrated through simulation experiments as well as an analysis of the steganography efficiency, steganography image quality, and steganography capacity and security. The experimental results show that the latter two schemes are better than the first two in terms of steganography capacity and steganography image quality.
Open AccessRandom Matrix Transformation and Its Application in Image Hiding
Image coding technology has become an indispensable technology in the field of modern information. With the vigorous development of the big data era, information security has received more attention. Image steganography is an important method of image encoding and hiding, and how to protect information security with this technology is worth studying. Using a basis of mathematical modeling, this paper makes innovations not only in improving the theoretical system of kernel function but also in constructing a random matrix to establish an information-hiding scheme. By using the random matrix as the reference matrix for secret-information steganography, due to the characteristics of the random matrix, the secret information set to be retrieved is very small, reducing the modification range of the steganography image and improving the steganography image quality and efficiency. This scheme can maintain the steganography image quality with a PSNR of 49.95 dB and steganography of 1.5 bits per pixel and can ensure that the steganography efficiency is improved by reducing the steganography set. In order to adapt to different steganography requirements and improve the steganography ability of the steganography schemes, this paper also proposes an adaptive large-capacity information-hiding scheme based on the random matrix. In this scheme, a method of expanding the random matrix is proposed, which can generate a corresponding random matrix according to different steganography capacity requirements to achieve the corresponding secret-information steganography. Two schemes are demonstrated through simulation experiments as well as an analysis of the steganography efficiency, steganography image quality, and steganography capacity and security. The experimental results show that the latter two schemes are better than the first two in terms of steganography capacity and steganography image quality.
- Open Access
- 30 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 120596-120612
A New Image Encryption Algorithm Based on Single S-Box and Dynamic Encryption Step
Chaotic-based S-box image encryption schemes promise to be a practical solution for securing digital images. However, the high-dimensional continuous chaotic has increased the algorithm’s complexity. Recent alternatives that focused on double or multiple S-box es approaches, on the other hand, have been proven vulnerable to differential attacks. This paper presents an efficient and secure chaotic-based S-box image encryption scheme. Firstly, a single S-box with a size of $10\times 26$ was constructed by using a low-dimensional chaotic system. Without a complex mathematical operation, the constructed single S-box has obvious efficiency advantages and achieved a higher image entropy rate than recent double or multiple S-box es. Secondly, a new dynamic encryption step method is proposed to solve the high correlation and deterministic problems in multiple S-box encryptions. Under the control of the dynamic encryption step algorithm, it effectively destroys the correlation between the source image’s pixels. The experimental results and security analysis show that the proposed scheme enjoys higher security and is more efficient to secure digital images in real-world applications.
- 30 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 120596-120612
Open AccessA New Image Encryption Algorithm Based on Single S-Box and Dynamic Encryption Step
Chaotic-based S-box image encryption schemes promise to be a practical solution for securing digital images. However, the high-dimensional continuous chaotic has increased the algorithm’s complexity. Recent alternatives that focused on double or multiple S-box es approaches, on the other hand, have been proven vulnerable to differential attacks. This paper presents an efficient and secure chaotic-based S-box image encryption scheme. Firstly, a single S-box with a size of $10\times 26$ was constructed by using a low-dimensional chaotic system. Without a complex mathematical operation, the constructed single S-box has obvious efficiency advantages and achieved a higher image entropy rate than recent double or multiple S-box es. Secondly, a new dynamic encryption step method is proposed to solve the high correlation and deterministic problems in multiple S-box encryptions. Under the control of the dynamic encryption step algorithm, it effectively destroys the correlation between the source image’s pixels. The experimental results and security analysis show that the proposed scheme enjoys higher security and is more efficient to secure digital images in real-world applications.