• Title/Summary/Keyword: 선형 근사

Search Result 774, Processing Time 0.028 seconds

Multiple Linear Cryptanalysis-Revisited (블록 암호에 대한 효율적인 선형 공격 방법)

  • Choi, Jun;Hong, Deuk-Jo;Hong, Seok-Hee;Lee, Sang-Jin;Im, Jong-In
    • 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.

Linear Complexity and 1-Error Linear Complexity over $F_p$ of M-ary Sidel'nikov Sequences (M진 Sidel'nikov 수열의 $F_p$ 상에서의 선형복잡도와 1-오류 선형복잡도)

  • Chung, Jin-Ho;Yang, Kyeong-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12C
    • /
    • pp.1150-1156
    • /
    • 2006
  • In this paper we derive some lower bounds on the linear complexity and upper bounds on the 1-error linear complexity over $F_p$ of M-ary Sidel'nikov sequences of period $p^m-1$ when $M\geq3$ and $p\equiv{\pm}1$ mod M. In particular, we exactly compute the 1-error linear complexity of ternary Sidel'nikov sequences when $p^m-1$ and $m\geq4$. Based on these bounds we present the asymptotic behavior of the normalized linear complexity and the normalized 1-error linear complexity with respect to the period.

Ballistic Performance Variation Prediction of Continuously Variable Thrust Solid Rocket Motor by the Linear Approximation (선형 근사화에 의한 가변추진시스템 내탄도 성능 변화 예측)

  • Kim, Joung-Keun;Park, Jong-Ho
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.36 no.1
    • /
    • pp.79-85
    • /
    • 2008
  • Generally Solid Rocket Motor(SRM) has advantages like this - safety, simplicity and flexibility in design and manufacturing process. However, once propellant grain shape and nozzle throat area are determined, modification of thrust magnitude is nearly impossible. Recently, methods for controlling the thrust magnitude of SRM are vigorously developed. This paper predicts internal ballistic performance variation, especially thrust of SRM by means of Linear Approximation according as chamber pressure or nozzle throat area is changed. The results predicted by the proposed method are good agreement with the those of exclusive Ballistic Performance Prediction Program(SPP).

Mathematical Review on the Local Linearizing Method of Drift Coefficient (추세계수 국소선형근사법의 특성과 해석)

  • Yoon, Min;Choi, Young-Soo;Lee, Yoon-Dong
    • The Korean Journal of Applied Statistics
    • /
    • v.21 no.5
    • /
    • pp.801-811
    • /
    • 2008
  • Modeling financial phenomena with diffusion processes is a commonly used methodology in the area of modern finance. Recently, various types of diffusion models have been suggested to explain the specific financial processes, and their related inference methodology have been also developed. In particular, likelihood methods for the efficient and accurate inference have been explored in various ways. In this paper, we review the mathematical properties of an approximated likelihood method, which is obtained by linearizing the drift coefficient of a diffusion process.

A Study on the Current-Voltage Characteristics of a Short-Channel GaAs MESFET Using a New Linearly Graded Depletion Edge Approximation (선형 공핍층 근사를 사용한 단채널 GaAs MESFET의 전류 전압 특성 연구)

  • 박정욱;김재인;서정하
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.37 no.2
    • /
    • pp.6-11
    • /
    • 2000
  • In this paper, suggesting a new linearly -graded depletion edge approximation, the current-voltage characteristics of an n-type short-channel GaAs MESFET device has been analyzed by solving the two dimensional Poisson's equation in the depletion region. In this model, the expressions for the threshold voltage, the source and the drain ohmic resistance, and the drain current were derived. As a result, typical Early effect of a short channel device was shown and the ohmic voltage drop by source and drain contact resistances could be explained. Furthermore our model could analyze both the short-channel device and the long-channel device in a unified manner.

  • PDF

Adaptive Output Feedback Control of Unmanned Helicopter Using Neural Networks (신경회로망을 이용한 무인헬리콥터의 적응출력피드백제어)

  • Park, Bum-Jin;Hong, Chang-Ho;Suk, Jin-Young
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.35 no.11
    • /
    • pp.990-998
    • /
    • 2007
  • Adaptive output feedback control technique using Neural Networks(NN) is proposed for uncertain nonlinear Multi-Input Multi-Output(MIMO) systems. Modified Dynamic Inversion Model(MDIM) is introduced to decouple uncertain nonlinearities from inversion-based control input. MDIM consists of approximated dynamic inversion model and inversion model error. One NN is applied to compensate the MDIM of the system. The output of the NN augments the tracking controller which is based upon a filtered error approximation with online weight adaptation laws which are derived from Lyapunov's direct method to guarantee tracking performance and ultimate boundedness. Several numerical results are illustrated in the simulation of Van der Pol system and unmanned helicopter with model uncertainties.

An Iterative Linear Approximation Algorithm for a Unified Model of Traffic Assignment and Line Planning in Railway Networks (통행배정-노선계획 통합 모형을 위한 선형 근사화 알고리듬 개발)

  • Park, Bum Hwan
    • Journal of the Korean Society for Railway
    • /
    • v.17 no.2
    • /
    • pp.140-147
    • /
    • 2014
  • Line planning is an important step to determine the optimal frequencies of trains given the forecasted demand for each train type. The main input data for line planning is the leg traffic demand which can be derived using suitable traffic assignment models. However most assignment models require a line plan, in other words, train frequencies or headways, so that inconsistent results just by the procedural approach to find an optimal line plan after determining leg traffic can be avoided. This paper suggests a unified model that can consider the traffic assignment and line planning, simultaneously. We further provide an elaborated approximation algorithm and, finally, provide experimental results determined for the Korean railway network.

Earth Mover's Distance Approximate Earth Mover's Distance for the Efficient Content-based Image Retreival (효율적인 내용 기반 이미지 검색을 위한 근사 Earth Mover's Distance)

  • Jang, Min-Hee;Kim, Sang-Wook
    • The KIPS Transactions:PartD
    • /
    • v.18D no.5
    • /
    • pp.323-328
    • /
    • 2011
  • For content-based image retrieval, the earth mover's distance and the optimal color composition distance are proposed to measure the dissimilarity. Although providing good retrieval results, both methods are too time-consuming to be used in a large image database. To solve the problem, we propose a new distance function that calculates an approximate earth mover's distance in linear time. To calculate the dissimilarity in linear time, the proposed approach employs the space-filling curve. We have performed extensive experiments to show the effectiveness and efficiency of the proposed approach. The results reveal that our approach achieves almost the same results with the EMD in linear time.

Almost linear-phase compensator for Cascaded Integrator-Comb filter (Cascaded Integrator-Comb 필터를 위한 근사 선형 위상 보상기)

  • Lee Kyu-Ha;Lee Chung-yong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.4 s.304
    • /
    • pp.153-158
    • /
    • 2005
  • In this paper, a filter is proposed to compensate droop of the CIC filter for SDR. The proposed compensation filter has almost linear-phase characteristic, requires low operational complexity, and is cost-effective due to its second-order characteristic and lowest operational rate in the baseband.. Especially, it compensates droop in the passband with little performance degradation in the stopband. It is shown, by a design example and its performance analysis, that the proposed compensation method gives performance enhancement in communication systems. It is also shown that the proposed method is superior to conventional ones in view of memory usage and computational load.

Bussgang Blind Equalization Using Nonlinear Estimators with Reduced Computational Complexity (계산 복잡성이 단순화된 비선형 추정기를 사용한 Bussgang 블라인드 등화)

  • Oh, Kil-Nam
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.6
    • /
    • pp.177-186
    • /
    • 2005
  • This paper introduces nonlinear estimators with reduced complexity, and proposes the Bussgang blind equalization algorithm employing the nonlinear estimators. The proposed algorithm utilized the facts that the Bayesian estimator is well approximated to the sigmoid estimator in initial stage of equalization with closed eye and is well approximated to the threshold estimator under open eye condition. The proposed method adopts selectively one of the two nonlinear estimators, i.e., the sigmoid estimator and the threshold estimator, according to channel distortion level at each iteration. As a result, by using the sigmoid estimator with reduced constellation, the proposed scheme, as it is applied to blind equalization of high-order QAM signals, simplifies the computational complexity extremely, and enhances the blind convergence capability and steady-state performance.