• Journal of Information Processing Systems
• /
• v.12 no.3
• /
• pp.525-537
• /
• 2016

Data hiding is a wide field that is helpful to secure network communications. It is common that many data hiding researchers consider improving and increasing many aspects such as capacity, stego file quality, or robustness. In this paper, we use an audio file as a cover and propose a reversible steganographic method that is modifying the sample values using modulus function in order to make the reminder of that particular value to be same as the secret bit that is needed to be embedded. In addition, we use a location map that locates these modified sample values. This is because in reversible data hiding it needs to exactly recover both the secret message and the original audio file from that stego file. The experimental results show that, this method (measured by correlation algorithm) is able to retrieve exactly the same secret message and audio file. Moreover, it has made a significant improvement in terms of the following: the capacity since each sample value is carrying a secret bit. The quality measured by peak signal-to-noise ratio (PSNR), signal-to-noise ratio (SNR), Pearson correlation coefficient (PCC), and Similarity Index Modulation (SIM). All of them have proven that the quality of the stego audio is relatively high.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.24-32
• /
• 1998

The bus contention among bus-based shared-memory multiprocessors limits their performance. In addition, under split bus transaction environment, multiprocessors may make some memory requests unnecessary stand by in the memory access buffer, which makes system performance worse. This unnecessary stand-by can be eliminated by maintaining the bitmap table which contains the status bit for each memory block. However, this mechanism requires a great size of SRAM for the status information, which is fully mapped from the whole memory blocks. To solve this problem, we propose a bitmap cache which exploits partial mapping and locality of references. The simulation results show that the proposed system can greatly reduce the capacity of SRAM for the status information with little deteriorating its performance.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.579-586
• /
• 2002

This paper propose an efficient algorithm for mining association rules in the large main memory systems. To do this, the paper attempts firstly to extend the conventional algorithms such as DHP and Partition in order to be compatible to the large main memory systems and proposes secondly an algorithm to improve Partition algorithm by applying the techniques of the hash table and the bit map. The proposed algorithm is compared to the extended DHP within the experimental environments and the results show up to 65% performance improvement in comparison to the expanded DHP.

• ETRI Journal
• /
• v.45 no.2
• /
• pp.213-225
• /
• 2023

Physical layer security (PLS) can improve the security of both terrestrial and nonterrestrial wireless communication networks. This study proposes a simplified framework for nonterrestrial cyclic prefixed orthogonal variable spreading factor (OVSF)-encoded multiple-input and multiple-output nonorthogonal multiple access (NOMA) systems to ensure complete network security. Various useful methods are implemented, where both improved sine map and multiple parameter-weighted-type fractional Fourier transform encryption schemes are combined to investigate the effects of hybrid PLS. In addition, OVSF coding with power domain NOMA for multi-user interference reduction and peak-toaverage power ratio (PAPR) reduction is introduced. The performance of $\frac{1}{2}$-rated convolutional, turbo, and repeat and accumulate channel coding with regularized zero-forcing signal detection for forward error correction and improved bit error rate (BER) are also investigated. Simulation results ratify the pertinence of the proposed system in terms of PLS and BER performance improvement with reasonable PAPR.

• Korean Journal of Optics and Photonics
• /
• v.19 no.1
• /
• pp.60-67
• /
• 2008

An all-optical 4-bit Gray code to binary coded decimal (BCD) converter by means of commercially available numerical analysis tool (VPI) was demonstrated, for the first time to our knowledge. Circuit design approach was modified appropriately in order to fit the electrical method on an all-optical logic circuit based on a cross gain modulation (XGM) process so that signal degradation due to the non-ideal optical logic gates can be minimized. Without regenerations, Q-factor of around 4 was obtained for the most severely degraded output bit (least significant bit-LSB) with 2.5 Gbps clean input signals having 20 dB extinction ratio. While modifying the two-level simplification method and Karnaugh map method to design a Gray code to BCD converter, a general design concept was also founded (one-level simplification) in this research, not only for the Gray code to BCD converter but also for any general applications.

• ETRI Journal
• /
• v.42 no.4
• /
• pp.619-632
• /
• 2020

Highly dispersive S-boxes are desirable in cryptosystems as nonlinear confusion sublayers for resisting modern attacks. For a near optimal cryptosystem resistant to modern cryptanalysis, a highly nonlinear and low differential probability (DP) value is required. We propose a method based on a piecewise linear chaotic map (PWLCM) with optimization conditions. Thus, the linear propagation of information in a cryptosystem appearing as a high DP during differential cryptanalysis of an S-box is minimized. While mapping from the chaotic trajectory to integer domain, a randomness test is performed that justifies the nonlinear behavior of the highly dispersive and nonlinear chaotic S-box. The proposed scheme is vetted using well-established cryptographic performance criteria. The proposed S-box meets the cryptographic performance criteria and further minimizes the differential propagation justified by the low DP value. The suitability of the proposed S-box is also tested using an image encryption algorithm. Results show that the proposed S-box as a confusion component entails a high level of security and improves resistance against all known attacks.

• Journal of Information Processing Systems
• /
• v.13 no.2
• /
• pp.385-399
• /
• 2017

Nowadays, with the development of signal processing technique, the protection to the integrity and authenticity of images has become a topic of great concern. A blind image authentication technology with high tamper detection accuracy for different common attacks is urgently needed. In this paper, an improved fragile watermarking method based on local binary pattern (LBP) is presented for blind tamper location in images. In this method, a binary watermark is generated by LBP operator which is often utilized in face identification and texture analysis. In order to guarantee the safety of the proposed algorithm, Arnold transform and logistic map are used to scramble the authentication watermark. Then, the least significant bits (LSBs) of original pixels are substituted by the encrypted watermark. Since the authentication data is constructed from the image itself, no original image is needed in tamper detection. The LBP map of watermarked image is compared to the extracted authentication data to determine whether it is tampered or not. In comparison with other state-of-the-art schemes, various experiments prove that the proposed algorithm achieves better performance in forgery detection and location for baleful attacks.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.39-44
• /
• 2007

In this paper, we propose a reversible watermarking method to recover an original image after the watermark has been extracted. Most watermarking algorithms cause degradation of image quality in original digital content in the process of embedding watermark. In the proposed algorithm, the original image can be obtained when the degradation is removed from the watermarked image after extracting watermark information. In the proposed method, we utilize histogram shifting concept and Location Map structure. We could solve the Filp-Flop problem by using Location Map structure and enlarge the information embedding capacity by embedding recursively. Experimental results demonstrate that the embedding information as large as 120k bits can be realized while the invisibility as high as 41dB can be maintained.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3245-3271
• /
• 2016

To obtain well-dehazed images at the receiver while sustaining low bit rates in the transmission pipeline, this paper investigates the effects of image dehazing methods using dehazing contrast-enhancement filters on image compression for surveillance systems. At first, this paper proposes a novel image dehazing method by using a new method of calculating the transmission function—namely, the direct denoising method. Next, we deduce the dehazing effects of the direct denoising method and image dehazing method based on dark channel prior (DCP) on image compression in terms of ringing artifacts and blocking artifacts. It can be concluded that the direct denoising method performs better than the DCP method for decompressed (reconstructed) images. We also improve the direct denoising method to obtain more desirable dehazed images with higher contrast, using the saliency map as the guidance image to modify the transmission function. Finally, we adjust the parameters of dehazing contrast-enhancement filters to obtain a corresponding composite peak signal-to-noise ratio (CPSNR) and blind image quality assessment (BIQA) of the decompressed images. Experimental results show that different filters have different effects on image compression. Moreover, our proposed dehazing method can strike a balance between image dehazing and image compression.

• 한국정보통신설비학회:학술대회논문집
• /
• 2005.08a
• /
• pp.406-414
• /
• 2005

In this paper, we propose 128bits chaotic block encryption scheme using a PLCM(Piece-wise Linear Chaotic Map) having a good dynamical property. The proposed scheme has a block size of 128 bits and a key size of 128 bits. In proposed scheme we use four 32bi1s sub-keys of session key and four 32bit sub-blocks of block to decide the initial value and the number of iteration of PLCM. The encrypted code is generated from the output of PLCM. With results of test and analyses of security we show the proposed scheme is very secure against statistical attacks and have very good Avalanche Effect and Randomness properties.