• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.6
• /
• pp.1319-1326
• /
• 2015

The symmetric key encryption algorithms, such as the AES or the ARIA, generate round keys by the key expansion mechanism. While the algorithm is executed, key expansion mechanism emits information about the secret key by the power consumption. The vulnerability exists that can reduce significantly the candidate of the secret key by the simple power analysis attack using a small number of the power traces. Therefore, we'll have to study about the attack and the countermeasure to prevent information leakage. While a simple power analysis attack on the AES key expansion has been studied since 2002, ARIA is insufficient. This paper presents a simple power analysis attack on 8-bit implementations of the ARIA-128 key expansion. The presented attack efficiently utilizes this information leakage to substantially reduce the key space that needs to be considered in a brute-force search for the secret key. We show that ARIA is vulnerable to a SPA attack based on hamming weight leakage.

• Journal of Advanced Navigation Technology
• /
• v.20 no.1
• /
• pp.65-71
• /
• 2016

Quantum-dot cellular automata (QCA) consists of nano-scale cells and demands very low power consumption so that it is one of the alternative technologies that can overcome the limits of scaling CMOS technologies. Typical BCD-EXCESS 3 code converters using QCA have not considered the scalability so that the architectures are not suitable for a large scale circuit design. Thus, we design a BCD-EXCESS 3 code converter with scalability using QCADesigner and verify the effectiveness by simulation. Our structure have reduced 32 gates and 7% of garbage space rate compare with typical URG BCD-EXCESS 3 code converter. Also, 1 clock is only needed for circuit expansion of our structure though typical QCA BCD-EXCESS 3 code converter demands 7 clocks.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.33-41
• /
• 2011

From Complicated graph structures, duplicated operations can be executed and the operations give low efficiency. In this paper, we propose an efficient graph mining algorithm of minimizing the extension of duplicated graph patterns in which the priorities of cyclic edges are considered. In our approach, the cyclic edges with lower priorities are first extended and so duplicated extensions can be reduced. For performance test, we implement our algorithm and compare our algorithm with a state of the art, Gaston algorithm. Finally, We show that ours outperforms Gaston algorithm.

• International Journal of Highway Engineering
• /
• v.8 no.4 s.30
• /
• pp.25-36
• /
• 2006

Through field surveys and evaluation on several widened concrete pavements, issues on construction and design related problems are broken down into three categories to be discussed; poor smoothness, influence of traffic vibration on concrete curing, and poor connection to the existing pavement. There are many places where about 100mm only of the marginal strip is removed and where defects such as widening and faulting are observed. Also cracks arise again from the patched areas due to stress concentration near the joint. Roughness on the widened concrete pavement was evaluated and there are some stations where the smoothness limit is over passed. For design consideration, shortage of the required force in the tie-bar is expected in case of road widening specially from 3 lanes to 4 lanes. Finally the average pull-out force of specimens made from the current practice was about 57% of the required force. New connecting methods were suggested in this study.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6C
• /
• pp.632-639
• /
• 2002

To reduce the area and power consumption in constant coefficient multiplications, the constant coefficient can be encoded using canonic signed digit(CSD) representation. When the partial product terms are added depending on the nonzero bit(1 or -1) positions in the CSD-encoded multiplier, all sign bits are properly extended before the addition takes place. In this paper, to reduce the overhead due to sign extension, a new method is proposed based on the fact that carry propagation in the sign extension part can be controlled such that a desired input bit can be propagated as a carry. Also, a fixed-width multiplier design method suitable for CSD multiplication is proposed. As an application, 43-tap filbert transformer for SSB/BPSK-DS/CDMA is implemented. It is shown that, about 16∼28% adders can be saved by the proposed method compared with the conventional methods.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2596-2604
• /
• 1997

There are two kinds of backends in ACK:code generator(full-fledged backend) and code expander(fast backend). Code generators generate target code using string pattern matching and code expanders generate target code using macro expansion. ACK translates EM to SPARC code using code expander. The corresponding SPARC code sequences for a EM code are generated and then push-pop optimization is performed. But, there is the problem of maintaining hybrid stack. And code expander is not considered to passes parameters of a procedure call through register windows. The purpose of this paper is to improve SPARC code quality. We suggest a method of SPARC cod generation using EM tree. Our method is divided into two phases:EM tree building phase and code expansion phase. The EM tree building phase creates the EM tree and code expansion phase translates it into SPARC code. EM tree is designed to pass parameters of a procedure call through register windows. To remove hybrid stack, we extract an additional information from EM code. We improved many disadvantages that arise from code expander in ACK.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.929-932
• /
• 2006

본 논문에서는 암호화된 Scalable Video Coding (SVC) 비트스트림에서의 조건적 접근제어을 위한 키 관리 기법을 제안한다. 스케일러블 비디오 코딩 기술은 한번 인코딩 후 비트스트림 추출을 통해 다양한 확장성(scalabbility)을 가지는 비디오를 생성 할 수 있는 기술로 확장하는 단위마다 다른 키로 암호화 하여 조건적 접근제어를 구성 할 수 있다. 그러나 기존의 조건적 접근제어 기술은 암호화 시 복수의 키가 필요하며 이는 키의 관리와 분배에 어려움을 준다. 이러한 문제를 해결하기 위해 본 논문에서는 기존의 스케일러블 코딩기법에서 조건적 접근제어를 위한 키 관리기법을 살펴보고 SVC 의 확장 구조에 맞는 키 관리 기법을 제안한다. 제안한 방법은 SVC 를 이용한 스트리밍 테스트베드에서 구현되어, 조건적 접근제어를 위한 키 관리기능의 유용성을 확인하였다.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.33 no.10
• /
• pp.1622-1632
• /
• 2009

This study investigates the influence of the innovativeness of consumers on extended products in brand extensions. 300 surveys were distributed and 283 were used in the final analysis. The results of this study show that consumers evaluate similar product category (i.e., sportswear) better than a dissimilar category (i.e., cosmetics) in brand extension. In addition, innovative consumers evaluated extended product better regardless of similarity with the original brand. The results showed that consumers with higher level of innovativeness were less likely to evaluate differently between a similar product and dissimilar product categories in apparel brand extension.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.837-846
• /
• 2002

When you develop component, you can offer reusability and extension by analyzing commonality and variability about attribute and behavior. Therefore Component that analyzing commonality and variability are use for the purpose of reducing discord of function and adaptedness. I wish to research reusability and extension of component by analysis commonality and variability of component that exist by domain in this paper, extractfunctionofcomponentbybehavioranalysis.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.51-55
• /
• 2001

이동통신 환경에서 멀티미디어 서비스를 요구하는 사용자가 증가함에 따라 데이터를 전송할 때 QoS의 보장은 필수적인 요건이 되었다. 이러한 QoS 보장을 위해 신속한 핸드오프나 자원 예약을 위한 매커니즘이 사용되게 된다. 본 논문에서는 이러한 이동통신 환경에서 향상된 QoS를 위하여 이동 호스트가 핸드오프 시 신속한 호 설정을 할 수 있도록 확장된 SIP(Session Initiation Protocol) 프로토콜을 통하여 미리 다른 네트워크(Foreign Network)에서 사용될 주소를 할당받음으로써 QoS를 보장할 수 있는 방안을 제안하였다. SIP Server 간의 제어 정보를 교환하고 또한 이동 호스트에게 정보를 전송하기 위해 본 논문에서는 SIP INFO Method를 확장하여 사용하였다.