• Journal of Korea Multimedia Society
• /
• v.4 no.3
• /
• pp.247-256
• /
• 2001

Digital watermarking is a copyright protection technique for digital images which embed a code into the digital data so the data is marked. Watermarking techniques previously deal with on-line digital data and have been developed to withstand digital attacks such image processing, compression and geometric transformation. In this paper we propose a novel method of embedding watermarks in printed images. In the proposed algorithm, watermark is embedded in a dithered binary image by comparing the $2\times{2}$ blocks of the counting array is the number of 1 (WHITE) in the $16\times{16}$ blocks of the dithered binary image with predefined reference block pattern, which is generated by watermark values. The proposed algorithm is able to provide more information at a watermark because the proposed algorithm use both '1'and '0' as watermark values. The watermark information is detected by comparing the watermark which is reconstructed from the image which is embedded watermark with the original watermark which is embedded in a binary image. The performance of the proposed algorithm is compared with that of the conventional watermark embedding algorithm for printed images by detecting watermark for scan images.

• The KIPS Transactions:PartD
• /
• v.9D no.3
• /
• pp.337-344
• /
• 2002

Recently, there has been a lot of research on graph-type data because it can model seamless the application domains such as GIS, network, WWW, multimedia presentations etc., and domain in which the data sequence is important. In this paper, an efficient code system, called node code system, is proposed to evaluate paths of DAG in a multimedia presentation graph. The node code system assigns a unique binary string to each node of a graph. The comparison of node codes of two nodes tells the connectivity between the nodes without actual traversal of a graph. The method using the property of the node code system allows us to construct the paths between two nodes more efficiently than the method using conventional graph traversals. The algorithms to construct paths using the node code system are provided.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.5
• /
• pp.3121-3131
• /
• 2014

Vulnerabilities related to memory have been known as major threats to the security of a computer system. Actually, the number of attacks using memory vulnerability has been increased. Accordingly, various memory protection mechanisms have been studied and implemented on operating system while new attack techniques bypassing the protection systems have been developed. Especially, buffer overflow attacks have been developed as Return-Oriented Programing(ROP) and Jump-Oriented Programming(JOP) called Code Re-used attack to bypass the memory protection mechanism. Thus, in this paper, I analyzed code re-use attack techniques emerged recently among attacks related to memory, as well as analyzed various detection mechanisms proposed previously. Based on the results of the analyses, a mechanism that could detect various code re-use attacks on a binary level was proposed. In addition, it was verified through experiments that the proposed mechanism could detect code re-use attacks effectively.

• Journal of Positioning, Navigation, and Timing
• /
• v.4 no.3
• /
• pp.107-114
• /
• 2015

Binary Offset Carrier (BOC) signal planned for future Global Navigation Satellite System (GNSS) provided better positioning accuracy and smaller multipath error than GPS C/A signal. However, due to the multiple side peaks in the auto-correlation function (ACF) of the BOC modulated signals, a receiver may false lock onto one of the side peaks in the tracking mode. This false lock would then result in a fatal tracking error. In this paper, we propose an unambiguous tracking method for composite BOC (CBOC) signals to mitigate this problem. It aims to reduce the side peaks of the ACF of CBOC modulated signals. It is based on the combination of traditional CBOC correlation function (CF) and reference CF of unmodulated pseudo- random noise code (PRN code). First, we present that cross-correlation function (CCF) with unmodulated PRN code is close to the secondary peaks of the traditional CBOC. Then, we obtain an unambiguous correlation function by subtracting traditional CBOC ACF from these CFs. Finally, the tracking performance for the CBOC signals is examined, and it is shown that the proposed method has better performance than the traditional unambiguous tracking method in additive white Gaussian noise (AWGN) channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9C
• /
• pp.817-824
• /
• 2006

The crest factor properties of 16-QAM modulated one- and two-code assisted multi-carrier code-division multiple-access (MC-CDMA) signals employing complementary pair as spreading sequences are characterized. It is shown that a set of relationship between the two 16-QAM symbols entirely characterize the power envelope waveforms of the signals. There exists 60 different sets of relationship, which results in 16 different crest factors as a result of various equivalent transforms on the corresponding message symbols. It is also shown that the individual crest factor corresponding to each message combination is always bounded by 3dB.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.5
• /
• pp.241-249
• /
• 2003

Carry lookahead(CLA) circuitry of decimal adders is proposed aiming at delay reduction. The truncation error in calculation of monetary interests may accumulate yielding a substantial amount of errors. Binary Coded Decimal(BCD) additions. for example, eliminate the truncation error in a fractional representation of decimal numbers. The proposed BCD carry lookahead scheme is aiming at the speed improvements without any truncation errors in the addition of decimal fractions. The delay estimation of the BCD CLA is demonstrated with improved performance in addition. Further reduction in delay can be achieved introducing non-weighted number system such as the excess-3 code.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.542-545
• /
• 2006

In recent years, RFID is widely used in Industrial applications including factory, material flow, logistics and defense areas. In this paper, we developed a RFID baseband system with ASK modulation and convolutional channel code. A commercial ASK RF module is used and its frequency range in $350\sim351MHz$ and power is 10mW and the convolution code is constraint length k=3 and rate R=1/2. The performance is measured by frame error rate and the convolutional code is very useful in performance improvement and, also we implemented the binary search algorithm as anti-collision method and we show the wave shapes whit collision occurrence. This RFID system is designed by FPGA therefore it produces result of speed-up and improvement of reliability.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.443-446
• /
• 2014

Code reuse attack (CRA)는 기존의 코드 내에서 필요한 코드 조각들 (gadgets)을 모아 indirect branch 명령어들로 잇는 방식으로 공격자가 원하는 악성 프로그램을 구성할 수 있는 강력한 공격 방법이다. 공격자는 자신의 코드를 대상 시스템에 심는 대신 기존의 코드를 이용하기 때문에, 대부분의 범용 운영체제 (OS)가 강제하는 W^X protection 을 무력화할 수 있다. 이러한 CRA 에 대응하기 위하여 다수의 연구들에서 branch 의 trace 를 분석하여 CRA 고유의 특성을 찾아내는 Signature 기반 탐지 기술을 제안하였다. 본 논문에서는 ARM 프로세서 상에서의 CRA 를 대응하기 위한 Signature 기반 탐지 기술을 효율적으로 도울 수 있는 binary 분석 및 meta-data 생성 기술을 제안한다. 특히, 본 논문은 우리의 이전 논문에서 고려 되지 못했던 ARM 의 두 가지 명령어 세트의 특성을 고려하여, 공격자가 어느 명령어 세트를 이용하여 CRA 를 시도하더라도 막아낼 수 있도록 meta-data 를 두 가지 mode 에 대해서 생성하였다. 실험 결과, meta-data 는 본래 바이너리 코드 대비 20.8% 정도의 크기 증가를 일으키는 것으로 나타났다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.4
• /
• pp.753-762
• /
• 2021

WebAssembly(WASM) is a low-level instruction format that can be run in a web environment. Since WASM has a excellent performance, various web applications use webassembly. However, according to our security analysis WASM has a security pitfall related to control flow integrity (CFI) for indirect calls. To address the problem in this paper we propose a new code instrumentation scheme to protect indirect calls, named WACFI. Specifically WACFI enhances a CFI technique for indirect call in WASM based on source code anlysis and binary instrumentation. To test the feasibility of WACFI, we applied WACFI to a sound-encoding application. According to our experimental results WACFI only adds 2.75% overhead on the execution time while protecting indirect calls safely.

• Journal of KIISE
• /
• v.43 no.12
• /
• pp.1334-1341
• /
• 2016

In recent years, the importance of managing software defects in the implementation stage has emerged because of the rapid development and wide-range usage of intelligent smart devices. Even if not a few studies have been conducted on the prediction models for software defects, their outcomes have not been widely shared. This paper proposes an efficient probabilistic management model of software metrics based on the Bayesian network, to overcome limits such as binary defect prediction models. We expect the proposed model to configure the Bayesian network by taking advantage of various software metrics, which can help in identifying improvements for refactoring. Once the source code has improved through code refactoring, the measured related metric values will also change. The proposed model presents probability values reflecting the effects after defect removal, which can be achieved by improving metrics through refactoring. This model could cope with the conclusive binary predictions, and consequently secure flexibilities on decision making, using indeterminate probability values.