• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.1
• /
• pp.47-57
• /
• 2003

In this paper, we firstly evaluate the resistance of the reduced 5-round version of the block cipher CIKS-1 against linear cryptanalysis(LC) and show that we can attack full-round CIKS-1 with \ulcorner56-bit key through the canonical extension of our attack. A feature of the CIKS-1 is the use of both Data-Dependent permutations(DDP) and internal key scheduling which consist in data dependent transformation of the round subkeys. Taking into accout the structure of CIKS-1 we investigate linear approximation. That is, we consider 16 linear approximations with p=3/4 for 16 parallel modulo $2^2$ additions to construct one-round linear approximation and derive one-round linear approximation with the probability P=1/2+$2^{-17}$ by Piling-up lemma. Then we present 3-round linear approximation with 1/2+$2^{-17}$ using this one-round approximation and attack the reduced 5-round CIKS-1 with 64-bit block by LC. In conclusion we present that our attack requires $2^{38}$chosen plaintexts with a probability of success of 99.9% and about $2^{67-7}$encryption times to recover the last round key.(But, for the full-round CIKS-1, our attack requires about $2^{166}$encryption times)

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.13 no.4
• /
• pp.427-436
• /
• 2000

This study presents the nonlinear responses of a hinged-clamped beam under broadband random excitation. By using Galerkin's method the governing equation is reduced to a system or nonautonomous nonlinear ordinary differential equations. The Fokker-Planck equation is used to generate a general first-order differential equation in the joint moments of response coordinates. Gaussian and non-Gaussian closure schemes are used to close the infinite coupled moment equations. The closed equations are then solved for response statistics in terms of system and excitation parameters. The case of two mode interaction is considered in order to compare it with the case of three mode interaction. Monte Carlo simulation is used for numerical verification.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.05a
• /
• pp.289-292
• /
• 2002

2계 선형 상미분방정식의 경계치 문제는 보통 해를 구하고자 하는 구간의 양 끝점에서 도함수의 값을 임의로 선정한 후 각 점에서 초기치 문제의 해를 구한 다음 적절한 1차 결합을 이용하여 구하게 된다. 이 경우 초기값과 도함수 값을 사용한 반복연산이 수반되며 따라서 오차의 누적이 불가피 하게 된다. 이 논문에서는 이같은 오차의 누적을 피할 뿐 아니라 3차 Spline 함수를 사용함으로써 오차가 O( $h^2$)인 해를 구하는 방법에 대하여 기술한다 두 개의 경계조건과 근사값을 구하고자 하는 점에서의 함수 값을 "If x is $B_{i}$, then f is $C_{i}$"와 같은 Fuzzy Rule들로 변형하고 주어진 미분방정식을 상수 $C_{i}$들의 관계식으로 변형하여 해를 구하였다. 산출된 결과로부터의 보간 연산은 Fuzzy System사용에 의하여 대체되었다. 이상의 방법으로 산출한 해의 근사오차가 O( $h^2$).임을 증명하였으며 3개의 예제에 대한 계산결과를 4계 Runge-Kutta 방법에 의한 해와 비교하여 기술하였다였다였다였다

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.718-720
• /
• 2004

n개의 점과 이를 포함하는 직사각형 B가 주어졌을 때 B내에서 어떤 점도 포함하지 않는 가장 큰 직사각형을 찾는 선형 근사 알고리즘을 제시한다. 찾게 되는 직사각형은 좁고 긴 모양의 것은 피하며 직사각형 B의 변에 평행해야 할 필요는 없다. 모든 방향을 고려하여 가장 큰 직사각형을 근사율 (1+$\alpha$)로 O(n + (area(B)/($\alpha$l)$^2$) log$^2$($\alpha$/$\varepsilon$)) 시간 내에 구한다.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.40 no.4
• /
• pp.415-422
• /
• 2016

When shock acceleration is applied to a mechanical system, it may cause malfunctioning and damage to the system. Hence, to prevent these problems when developing a gimbal structure system for observation reconnaissance, the MIL-STD-810G shock standard must be satisfied as a design specification. Rubber vibration isolators are generally assembled on the base of the system in order to reduce the shock transferred from the aircraft. It is difficult to analyze the transient behavior of the system accurately, because rubber has a nonlinear load-deformation curve. To treat the nonlinear characteristic of the rubber, bilinear approximation was introduced. Using this assumption, transient responses of the system under base shock acceleration were calculated by the finite element method. In addition, experiments with a true prototype were performed using the same conditions as the analytical model. Compared with experimental data, the proposed numerical method is useful for the transient analysis of gimbal structure systems, including rubber vibration isolators with nonlinear stiffness and damping.

• Computational Structural Engineering
• /
• v.10 no.2
• /
• pp.255-263
• /
• 1997

The optimum design of most structural systems used in practice requires considering design variables as discrete quantities. The present paper shows that the linear approximation method is very effective as a tool for the discrete optimum designs of unsymmetric composite laminates. The formulated design problem is subjected to a multiple in-plane loading condition due to shear and axial forces, bending and twisting moments, which is controlled by maximum strain criterion for each of the plys of a composite laminate. As an initial approach, the process of continuous variable optimization by FDM is required only once in operating discrete optimization. The nonlinear discrete optimization problem that has the discrete and continuous variables is transformed into the mixed integer programming problem by SLDP. In numerical examples, the discrete optimum solutions for the unsymmetric composite laminates consisted of six plys according to rotated stacking sequence were found, and then compared the results with the nonlinear branch and bound method to verify the efficiency of present method.

• Proceedings of the Optical Society of Korea Conference
• /
• 1988.06a
• /
• pp.47-54
• /
• 1988

아홉 개의 TEA Co 레이저선에 대한 암모니아 매질의 비선형 굴절계수 (n%)를, 매질을 통과한 광속이 self-focusing 또는 self-defocusing 에의해 겪게되는 공간적 광속 변화를 측정함으로써 결정하였다. 암모니아 매질을 통과하여 변형된 광속의 전장은 가우스 함수의 금수로 주어지는 스미스의 표현(5)으로 근사할수 있었으며, 실험치와 비교하여 보았다. 아홉 개의 레이저선중 여덟 개의 레이저선은 self-focusing 현상을 나타애렀으며9R(16) line은 self-defocusing 현상을 나타내었다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.6
• /
• pp.59-69
• /
• 2002

Many Linear attacks have introduced after M. Matsui suggested Linear Cryptanalysis in 1993. The one of them is the method suggested by B. Kaliski and M. Robshaw. It was a new method using multiple linear approximations to attack for block ciphers. It requires less known plaintexts than that of Linear Cryptanalysis(LC) by Matsui, but it has a problem. In this paper, we will introduce the new method using multiple linear approximation that can solve the problem. Using the new method, the requirements of the known plaintexts is 5(1.25) times as small as the requirements in LC on 8(16) round DES with a success rate of 95%(86%) respectively. We can also adopt A Chosen Plaintext Linear Attack suggested by L. R. Knudsen and J. E. Mathiassen and then our attack requires about $2^{40.6}$ chosen plaintexts to recover 15 key bits with 86% success rate. We believe that the results in this paper contain the fastest attack on the DES full round reported so far in the open literature.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.99-104
• /
• 2024

In the deficiency of an exact solution yielding algorithm, approximate algorithms remain as a solely viable option to the Minimum Linear Arrangement(MinLA) problem of Binary tree. Despite repeated attempts by a number of algorithm on k = 10, only two of them have been successful in yielding the optimal solution of 3,696. This paper therefore proposes an algorithm of O(n) complexity that delivers the exact solution to the binary tree. The proposed algorithm firstly employs an In-order search method by which n = 2^k - 1 number of nodes are assigned with a distinct number. Then it reassigns the number of all nodes that occur on level 2 ≤ 𝑙 ≤ k-2, (k = 5) and 2 ≤ 𝑙 ≤ k-3, (k = 6), including that of child of leaf node. When applied to k=5,6,7, the proposed algorithm has proven Chung[14]'s S^(k)_min=2^k-1+4+S^(k-1)_min+2S^(k-2)_min conjecture and obtained a superior result. Moreover, on the contrary to existing algorithms, the proposed algorithm illustrates a detailed assignment method. Capable of expeditiously obtaining the optimal solution for the binary tree of k > 10, the proposed algorithm could replace the existing approximate algorithms.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.21 no.2
• /
• pp.169-187
• /
• 2008

Performance-based approaches as an alternative method of the existing force-based approach have gradually become recognized tools for the seismic design and evaluation. The maximum inelastic displacement response using capacity spectrum method (CSM) with elastic response spectrum is estimated from seismic response of equivalent linear system converted from nonlinear system. The purpose of this paper is to evaluate accuracy of capacity spectrum method using the equivalent SDOF methods of 4 types and the equivalent damping methods of 5 types for RC wall structure. In order to evaluate accuracy of capacity spectrum analysis, the shaking table test results for RC wall structures are compared with those by the capacity spectrum analysis. Also, the effect of bilinear capacity curves by two bilinear approximation methods for capacity spectrum analysis is compared.