• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.2
• /
• pp.335-344
• /
• 2016

It is known that power analysis is one of the most powerful attack in side channel analysis. Among power analysis single trace attack is widely studied recently since it uses one power consumption trace to recover secret key of public cryptosystem. Recently Sim et al. proposed new exponentiation algorithm for RSA cryptosystem with higher attack complexity to prevent single trace attack. In this paper we analyze the vulnerability of exponentiation algorithm described by Sim et al. Sim et al. applied message blinding and random exponentiation splitting method on $2^t-ary$ for higher attack complexity. However we can reveal private key using information exposed during pre-computation generation. Also we describe modified algorithm that provides higher attack complexity on collision attack. Proposed algorithm minimized the reuse of value that are used during exponentiation to provide security under single collision attack.

• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.43-54
• /
• 2004

This study analyzes characteristics and applicability of genetic algorithms and genetic operators to optimize highway alignments. Genetic algorithms, one of artificial intelligence techniques, are fast and efficient search algorithms for generating, evaluation and finding optimal highway alignment alternatives. The performance of genetic algorithms as an optimal search tool highly depends on genetic operators that are designed as a problem-specific. This study adopts low mutation operators(uniform mutation operator, straight mutation operator, non-uniform mutation operator whole non-uniform mutation operator) to explore whole search spaces, and four crossover operators(simple crossover operator, two-point crossover operator, arithmetic crossover operator, heuristic crossover operator) to exploit food characteristics of the best chromosome in previous generations. A case study and a sensitivity analysis have shown that the eight problem-specific operators developed for optimizing highway alignments enhance the search performance of genetic algorithms, and find good solutions(highway alignment alternatives). It has been also found that a mixed and well-combined use of mutation and crossover operators is very important to balance between pre-matured solutions when employing more crossover operators and more computation time when adopting more mutation operators.

• Journal of Korea Multimedia Society
• /
• v.14 no.10
• /
• pp.1229-1237
• /
• 2011

The volume ray-casting method is one of the direct volume rendering methods that produces high-quality images as well as manipulates semi-transparent object. Although the volume ray-casting method produces high-quality image by sampling in the region of interest, its rendering speed is slow since the color acquisition process is complicated for repetitive memory reference and accumulation of sample values. Recently, the GPU-based acceleration techniques are introduced. However, they require pre-processing or additional memory. In this paper, we propose efficient point-primitive based method to overcome complicated computation of GPU ray-casting. It presents semi-transparent objects, however it does not require preprocessing and additional memory. Our method is fast since it generates point-primitives from volume dataset during sampling process and it projects the primitives onto the image plane. Also, our method can easily cope with OTF change because we can add or delete point-primitive in real-time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1285-1296
• /
• 2011

Packet classification is one of the basic and important functions of the Internet routers, and it became more important along with new emerging application programs requiring real-time transmission. Since packet classification should be accomplished in line-speed on each incoming input packet for multiple header fields, it becomes one of the challenges in designing Internet routers. Various packet classification algorithms have been proposed to provide the high-speed packet classification. Hierarchical approach achieves effective packet classification performance by significantly narrowing down the search space whenever a field lookup is completed. However, hierarchical approach involves back-tracking problem. In order to solve the problem, set-pruning trie and grid-of-trie algorithms are proposed. However, the algorithm either causes excessive node duplication or heavy pre-computation. In this paper, we propose a smart set-pruning trie which reduces the number of node duplication in the set-pruning trie by the simple merging of the lower-level tries. Simulation result shows that the proposed trie has the reduced number of copied nodes by 2-8% compared with the set-pruning trie.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.759-764
• /
• 2005

In this paper we describe a face recognition using EBGM(Elastic Bunch Graph Matching) method. Usally, the PCA and LDA based face recognition method with the low-dimensional subspace representation use holistic image of faces, but this study uses local features such as a set of convolution coefficients for Gabor kernels of different orientations and frequencies at fiducial points including the eyes, nose and mouth. At pre-recognition step, all images are represented with same size face graphs and they are used to recognize a face comparing with each similarity for all images. The proposed algorithm has less computation time due to simplified face graph than conventional EBGM method and the fuzzy matching method for calculating the similarity of face graphs renders more face recognition results.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.2
• /
• pp.39-44
• /
• 2020

In this paper, we show a modified Diffie-Hellman key exchange protocol that can exchange keys by exposing only minimal information using pre-computable session key pairs. The discrete logarithm problem, which provides the safety of existing Diffie-Hellman and Diffie-Hellman based techniques, is modified to prevent exposure of primitive root. We prove the algorithm's operation by applying the actual value to the proposed scheme and compare the execution time and safety with the existing algorithm, shown that the security of the algorithm is improved more than the product of the time complexity of the two base algorithms while maintaining the computation amount at the time of key exchange. Based on the proposed algorithm, it is expected to provide a key exchange environment with improved security.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.34 no.5
• /
• pp.449-456
• /
• 2010

The HCCI engine is a prospective internal combustion engine with which high diesel-like efficiencies and very low NOx and particulate emissions can be achieved. However, several technical issues must be resolved before HCCI engines can be used for different applications. One of the issues concerning the HCCI engine is that the operating range of this engine is limited by the rapid pressure rise caused by the release of excessive heat. This heat release is because of the self-accelerated combustion reaction occurring in the engine and the resulting engine knock in the high-load region. The purpose of this study is to evaluate the role of thermal stratification and fuel stratification in reducing the pressure rise rate in an HCCI engine. The concentrations of NOx and CO in the exhaust gas are also evaluated to confirm combustion completeness and NOx emission. The computation is carried out with the help of a multizone code, by using the information on the detailed chemical kinetics and the effect of thermal and fuel stratification on the onset of ignition and rate of combustion. The engine is fueled with dimethyl ether (DME), which allows heat release to occur in two stages, as opposed to methane, which allows for heat release in a single stage.

• Korean Journal of Community Nutrition
• /
• v.12 no.3
• /
• pp.322-332
• /
• 2007

The purposes of this research were to examine the effect of the catering company's dietetic internship program through a self-evaluating ability test about management performance between pre and post internship programs and consequently to suggest improvement in the internship program. In this study, two types of questionnaires were conducted in July and October 2006, targeting 41 dietetic interns who trained in a 6 months internship program. Except the 4 dropped interns, data from 37 interns were collected and used for statistical analysis, using the SPSS Win 11.0 version. The results of this study were as follows: First of all, the analysis on the effect of the internship program according to classified management segments showed significant improvements in the following order: purchase management (p<0.001), computer program management (p<0.001), facilities management (p<0.001), accounting management (p<0.01), personnel management (p<0.01), retention management (p<0.01), sanitation management (p<0.01), service management (p<0.01) and foodservice management (p<0.01). However, there was no significantly improvement in management of clients. Secondly, the result of the analysis on the details of each management segment that were significant improvement and changing score was the top 5 duties were as follows: In the purchase management, the score of weekly and daily order management was increased 1.0 (p<0.001), the score of weekly inventory management was 0.81 (p<0.001). In the computation office management, expenses handling through a computer program was 0.65 (p<0.01). In the personnel management, the score of work schedule management increased 0.81 (p<0.001). In the accounting management, the score of monthly profit and loss account management was 0.65 (p<0.001). Furthermore, qualified educational programs connected with the internship program will have to be systematically developed and continually carried out in order to improve service and management abilities of branch managers.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.26 no.1
• /
• pp.88-93
• /
• 2015

To estimate RCS(Radar Cross Section) at arbitrary incident angles for large objects, an interpolation method is required based on the pre-calculated RCS database at finite discrete sampling points. It is numerically difficult to compute the RCS by a large object at all required sampling points, since the computation time may be very long for one sampling point and many sampling points are required to satisfy the exact sampling condition. Therefore, it may be required to accurately estimate the RCS at any incident angles based on a database whose size is as small as possible. In this paper, the accuracy of two interpolation methods base on the sinc-and VSH(Vector Spherical Harmonics) functions are numerically compared.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.1
• /
• pp.185-192
• /
• 2008

The crosstalk is the most serious problem in playing audio signals with more than two speakers. Usually an inverse filter is employed to remove such a Phenomenon. The LNS method, one of most effective design techniques for an inverse filter, has some advantages such as easy implementation and quick computation. However, the inverse filter designed by the LNS method is not easy to adapt immediately for the delivery system change since the pre-measured impulse response is used to design the filter. In this work, we present an adaptive algorithm for the inverse filter design. With the present algorithm. the inverse filter is initially designed by the LNS methods and continuously adjusted to cope with the delivery system changes. To verify the proposed method. some simulations were carried out and the results confirmed that the performance of the crosstalk calculation can be improved in entire frequency range.