• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1991.11a
• /
• pp.40-48
• /
• 1991

McEliece 공개키 암호체계에 대한 새로운 암호해독적 공격이 제시되어진다. 기존의 암호해독 algorithm이 exponential-time의 complexity를 가지는 반면, 본고에서 제시되어지는 algorithm은 polynomial-time의 complexity를 가진다. 모든 linear codes에는 systematic generator matrix가 존재한다는 사실이 본 연구의 동기가 된다. Public generator matrix로부터, 암호해독에 사용되어질 수 있는 새로운 trapdoor generator matrix가 Gauss-Jordan Elimination의 역할을 하는 일련의 transformation matrix multiplication을 통해 도출되어진다. 제시되어지는 algorithm의 계산상의 complexity는 주로 systematic trapdoor generator matrix를 도출하기 위해 사용되는 binary matrix multiplication에 기인한다. Systematic generator matrix로부터 쉽게 도출되어지는 parity-check matrix를 통해서 인위적 오류의 수정을 위한 Decoding이 이루어진다.

• Science of Emotion and Sensibility
• /
• v.21 no.2
• /
• pp.125-136
• /
• 2018

Although atypical sensory processing is a core feature of autism spectrum disorder (ASD), there is considerable heterogeneity among ASD individuals in the modality and symptoms of atypical sensory processing. The present study examined visual processing of children with ASD, focusing on the complexity and orientation of visual information. Age- and -IQ-matched Korean children (14 ASD and 14 typically-developing (TD) children) received an orientation discrimination task involving static spatial gratings varied in complexity (simple versus complex) and orientation (horizontal versus vertical). The results revealed that ASD children had difficulty perceiving complex information regardless of orientation, whereas TD children had more difficulty with vertical gratings than horizontal gratings. Thus, group-level differences between ASD and TD children appeared greater when gratings were presented horizontally. Unlike ASD adult literature, however, ASD children did not show superior performance on simple gratings. Our findings on typical and atypical processing of ASD children have implications for both understanding the characteristics of ASD children and developing diagnostic tools for ASD.

• Journal of Distribution Science
• /
• v.15 no.7
• /
• pp.35-41
• /
• 2017

Purpose - A product bundling is a marketing approach where multiple products or components are packaged together into one bundle solution. This paper aims to introduce an optimal bundle search problem (hereinafter called "OBSP") which may be embedded with online recommendation system to provide an optimized service considering pairwise discount and delivery cost. Research design, data, and methodology - Online retailers have their own discount policy and it is time consuming for online shoppers to find an optimal bundle. Unlike an online system recommending one item for each search, the OBSP considers multiple items for each search. We propose a mathematical formulation with numerical example for the OBSP and analyzed the complexity of the problem. Results - We provide two results from the complexity analysis. In general case, the OBSP belongs to strongly NP-Hard which means the difficulty of the problem while the special case of OBSP can be solved within polynomial time by transforming the OBSP into the minimum weighted perfect matching problem. Conclusions - In this paper, we propose the OBSP to provide a customized service considering bundling price and delivery cost. The results of research will be embedded with an online recommendation system to help customers for easy and smart online shopping.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.3
• /
• pp.9-14
• /
• 2009

Recently, a rate-2, $2{\times}2$ space-time code with simple ML decoding has been designed. Though the simple ML decoding algorithm does reduce the ML decoding complexity, there is still need for improvement. In this paper, we propose an efficient decoding algorithm for the rate-2, $2{\times}2$ space-time code using interference cancellation techniques with performance virtually identical to that of ML decoding. Also, the decoding complexity of the proposed algorithm is significantly reduced compared to the conventional simple ML decoding, especially for large modulation orders.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.1
• /
• pp.98-105
• /
• 2011

Reduced complexity codebook searching for Quantized Equal Gain Transmission(QEGT) is proposed over MIMO-OFDM systems. QEGT codebook is divided into M groups of Q index members. Each group has a representative index. At the 1st stage only the representative indices are searched then the best index is selected. At the 2nd stage the optimum index is determined only among the group of the selected representative index. This strategy reduces the overall index search algorithm comparing to the conventional methods. Monte-Carlo simulation shows that the searching complexity is reduced, but the link-level performance is still almost the same as the conventional methods when the number of transmission antennas are 3 to 7.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.2
• /
• pp.131-140
• /
• 2014

Customer networks go through constant changes. They may expand or shrink once they are formed. In dynamic environments, it is a critical corporate challenge to identify and manage influential customer groups in a cost effective way. In this context, we apply inverse optimization theory to suggest an efficient method to manage customer networks. In this paper, we assume that there exists a subset of nodes that might have a large effect on the network and that the network can be modified via some strategic actions. Rather than making efforts to find influential nodes whenever the network changes, we focus on a subset of selective nodes and perturb as little as possible the interaction between nodes in order to make the selected nodes influential in the given network. We define the following problem based on the inverse optimization. Given a graph and a prescribed node subset, the objective is to modify the structure of the given graph so that the fixed subset of nodes becomes a minimum dominating set in the modified graph and the cost for modification is minimum under a fixed norm. We call this problem the inverse dominating set problem and investigate its computational complexity.

• Proceedings of the Safety Management and Science Conference
• /
• 2004.11a
• /
• pp.277-287
• /
• 2004

This study presents a method of quality category classification by safety, maturity, complexity, and what types and extent of controls and verifications are applied to specific products and services during the various stages of a nuclear facility life cycle. All products, services and processes have various controls and verifications built in to ensure they perform their functions satisfactorily. The highest grade should require the most stringent application of the quality assurance requirements ; while, the lowest grade should require the least stringent. When products or services are modified, the assigned grade of quality assurance requirements could become more stringent or less stringent depending on the significance in nuclear safety. Applying QA program always costs money, and they should be applied and focused to the extent where necessary and not applied or applied to a lesser degree for less important activities. An efficient QA program should be developed to satisfy the necessary requirements and to ensure the required confidence in quality, but without unnecessary stipulations. Not all the requirements of QA standard must be applied identically to all products and services which are to be provided.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3266-3285
• /
• 2014

With limited computing and storage resources, many network applications of encryption algorithms require low power devices and fast computing components. CHESS-64 is designed by employing simple key scheduling and Data-Dependent operations (DDO) as main cryptographic components. Hardware performance for Field Programmable Gate Arrays (FPGA) and for Application Specific Integrated Circuits (ASIC) proves that CHESS-64 is a very flexible and powerful new cipher. In this paper, the security of CHESS-64 block cipher under related-key differential cryptanalysis is studied. Based on the differential properties of DDOs, we construct two types of related-key differential characteristics with one-bit difference in the master key. To recover 74 bits key, two key recovery algorithms are proposed based on the two types of related-key differential characteristics, and the corresponding data complexity is about $2^{42.9}$ chosen-plaintexts, computing complexity is about $2^{42.9}$ CHESS-64 encryptions, storage complexity is about $2^{26.6}$ bits of storage resources. To break the cipher, an exhaustive attack is implemented to recover the rest 54 bits key. These works demonstrate an effective and general way to attack DDO-based ciphers.

• Journal of Broadcast Engineering
• /
• v.26 no.5
• /
• pp.652-655
• /
• 2021

Among various inter prediction techniques of Versatile Video Coding (VVC), adaptive motion vector resolution (AMVR) technology has been adopted. However, for AMVR, various MVs should be tested per each coding unit, which needs a computation of rate-distortion cost and results in an increase in encoding complexity. Therefore, in order to reduce the encoding complexity of AMVR, it is necessary to effectively find an optimal AMVR mode. In this paper, we propose a lightweight neural network-based AMVR decision algorithm based on more diverse datasets.

• Journal of electromagnetic engineering and science
• /
• v.11 no.2
• /
• pp.71-75
• /
• 2011

The sum-rate maximization rule can find an optimal user set that maximizes the sum capacity in multiple input multiple output (MIMO) broadcast channels (BCs), but the search space for finding the optimal user set becomes prohibitively large as the number of users increases. The proposed algorithm selects a user set of the largest effective channel norms based on statistical channel state information (CSI) for reducing the computational complexity, and uses Tomlinson-Harashima precoding (THP) for minimizing the interference between selected users in time-varying MIMO BCs.