• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.471-485
• /
• 2023

As data sharing increases explosively, such information encoded in QR code is completely public as private messages are not securely protected. This paper proposes a new 'PROMISE' framework for hiding information based on the QR code projection matrix by using image segmentation without modifying the essential QR code characteristics. Projection matrix mapping, matrix scrambling, fusion image segmentation and steganography with SEL(secret embedding logic) are part of the PROMISE framework. The QR code could be mapped to determine the segmentation site of the fusion image as a binary information matrix. To further protect the site information, matrix scrambling could be adopted after the mapping phase. Image segmentation is then performed on the fusion image and the SEL module is applied to embed the secret message into the fusion image. Matrix transformation and SEL parameters should be uploaded to the server as the secret key for authorized users to decode the private message. And it was possible to further obtain the private message hidden by the framework we proposed. Experimental findings show that when compared to some traditional information hiding methods, better anti-detection performance, greater secret key space and lower complexity could be obtained in our work.

• Korean Journal of Optics and Photonics
• /
• v.17 no.3
• /
• pp.231-239
• /
• 2006

In recent years, a hierarchical security architecture has been widely studied because it can efficiently protect information by allowing an authorized user access to the level of information. However, the conventional hierarchical decryption methods require several decryption keys for the high level information. In this paper, we propose a hierarchical image encryption using random phase masks and Walsh code having orthogonal characteristics. To decrypt the hierarchical level images by only one decryption key, we combine Walsh code into the hierarchical level system. For encryption process, we first perform a Fourier transform for the multiplication results of the original image and the random phase mask, and then expand the transformed pattern to be the same size and shape of Walsh code. The expanded pattern is finally encrypted by multiplying with the Walsh code image and the binary phase mask. We generate several encryption images as the same encryption process. The reconstruction image is detected on a CCD plane by a despread process and Fourier transform for the multiplication result of encryption image and hierarchical decryption keys which are generated by Walsh code and binary random phase image. Computer simulations demonstrate that the proposed technique can decrypt hierarchical information by using only one level decryption key image and it has a good robustness to the data loss such as random cropping.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.601-604
• /
• 2007

In this paper dose a laver surface check using a real time image process. This system does false retrieval of a laver at a laver production line. At first, a laver image was read in real time using a CCD camera. In this paper, we use an area scan CCD camera. Image is converted into a binary code image using a high-speed imaging process board afterwards. A laver feature is extracted by a binary code image. Surface false retrieval is finally executed using a laver feature. In this paper, we use an area feature of a laver image.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.27-35
• /
• 2012

In this paper, we look into a Jong Nang Channel which is the origin of digital communications and has been used in Jeju Island since AD 1234. It is one kind of communication ways which informs people of whether a house owner is in one's house or not using its own protocol. It is comprised of three timber and two stone pillars whose one side has three holes respectively. In this paper, we analyze the Jong-Nang Channel both in the light of logic and bit error probability. In addition, we compare it with a conventional binary erasure channel when some errors occur over them respectively. We also show that a capacity of NOR channel approaches Shannon limit.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.237-242
• /
• 2012

Cyber attacks have rapidly increased by exploiting the underlying vulnerabilities in the target software. However, identifying and correcting these vulnerabilities are extremely difficult and time consuming tasks. To address these problems efficiently, we propose a systematic methodology for security vulnerability assessment process on binary code in the paper. Specifically, we first classified the existing vulnerabilities based on whether the target software run in a Web environment and features of the software. Based on the classification, we determined the list and scope of the vulnerabilities. As our future research direction, we need to further refine and validate our methodology.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03b
• /
• pp.2-5
• /
• 2008

This study describes the numerical simulation of three-dimensional droplet formation and the following motion in a cross-junction microchannel by using the Lattice Boltzmann Method (LBM). Our aim is to develop the three-dimensional binary fluids model, consisting of two sets of distribution functions to represent the total fluid density and the density difference, which introduces the repulsive interaction consistent with a free-energy function between two fluids. We validated the LBM code with the velocity profile in a 3-dimensional rectangular channel. Then, we applied our code to the numerical simulation of a binary fluid flow in a cross-junction channel focusing on the investigation of the droplet formulation. Due to the pressure and interfacial-tension effect, one component of the fluids which is injected from one inlet is cut off into many droplets periodically by the other component which is injected from the other inlets. We considered the effect of the boundary conditions for density difference (order parameter) on the wetting of the droplet to the side walls.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7A
• /
• pp.1005-1015
• /
• 1999

This paper is concerned with an improvement on IFFT (inverse fast Fourier transform) and FFT based baseband digital implementation algorithm for BPSK (binary phase shift keying)-modulated MC-CDMA (multicarrier-code division multiple access) systems, that is functionally equivalent to the conventional implementation algorithm, while reducing computational complexity and bandwidth requirement. We also derive an equalizer structure for the proposed implementation algorithm. The proposed algorithm is based on a variant of FFT algorithm that utilizes a N/2-point FFT/IFFT for simultaneous transformation and reconstruction of two N/2-point real signals. The computer simulations under additive white Gaussian noise channels and frequency selective fading channels using equal gain combiner and maximal ratio combiner diversities, demonstrate the performance of the proposed algorithm.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.9
• /
• pp.27-35
• /
• 1999

In this paper, we propose an error detection scheme of phase offsets for binary sequences including PN (Pseudo Noise) sequences based on the number theoretical approach. It is important to know phase offsets of spreading sequences in the CDMA (Code Division Multiple Access) mobile communication systems because phase offsets of the same spreading sequence are used to achieve the acquisition and are used to distinguish each base station. When the period of the sequence is not very long, the relative phase offset between the sequence and its shifted replica can be found by comparing them, but as the period of the sequence increases it becomes difficult to find the phase offset. The error detection failure probability of the proposed method is derived, and it is confirmed by the simulation results. We also discuss the circuit realization of the proposed method and show it can be easily implemented.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.16 no.4
• /
• pp.1-12
• /
• 1979

This article is a sequel to " Korean Character Processing: Part I. Theoretical Foundation " and deals with the practical and historical aspects of the same subject. We discuss , in the first half, the functional design of Korean I/O terminals, Korean character generators based on the conversion algorithm and dot matrix fonts, input keyboard configuration ( trade -offs between a key set and the number of key -strokes ), and the conditions to be considered for binary code design. The second half of the article is devoted to the history of Korean Character processing which is seen from the personal viewpoints. The recorded works are classified into 4 groups according to their maj or contents. Then we bring up each problematic issue to give a critical review of articles . Issues related to output (conversion process) and input ( character recognition) are separated. The bibliography is given in a chronological order.cal order.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1136-1140
• /
• 2007

In this paper dose a laver surface check using a real time image process. This system does false retrieval of a laver at a laver production line. At first, a laver image was read in real time using a CCD camera. In this paper, we use an area scan CCD camera. Image is converted into a binary code image using a high-speed imaging process board afterwards. A laver feature is extracted by a binary code image. Surface false retrieval is finally executed using a laver feature. In this paper, we use an area feature of a laver image.