• Title/Summary/Keyword: 임종과정

Search Result 241, Processing Time 0.026 seconds

A Case Study on EA Actualizing and Structure improvement Based on Organizational Innovation in Public Agencies (공공부문 조직변화에 따른 EA 현행화 및 구조개선 사례 연구)

  • Shim, Jang-Sup;Mun, Byoung-Ju;Kim, Seon-Bong;Jo, Eun-Hee;Lim, Chong-Sok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.11a
    • /
    • pp.5-8
    • /
    • 2013
  • 전 산업분야의 변화 사이클이 짧은 격변의 시대에 공공부문의 IT는 "정보시스템의 효율적 도입 및 운영 등에 관한 법률"에 따라 구축되고 운영되고 있으며, 정부의 국정기조 아래 각 기관 조직의 전략실행 수단으로 활용되고 있으며 조직목표 달성에 기여하고자 EA를 구축하고 있다. 또한 조직의 통 폐합 등 변화에 따라 기존에 운영되고 있는 시스템 및 서비스들을 효율적으로 관리하기 위해서는 작은 예산을 통하여 적기에 빠르게 모형이 표준화되고 EA 지원시스템에 목표 아키텍처로 등록되며 현행화 되는 구조개선 작업이 필요하다. 본 연구에서는 새 정부 출범시마다 변화되는 주변 환경에 따라 해당조직의 통 폐합 과정에서 추진한 지난 정부에서의 사례 제시를 통하여, 민간과 다른 특성을 가지고 프로세스의 변화에 능동적으로 대응이 어려우며 현업의 참여가 소극적인 특성을 가진 공공기관에 적합한 EA 현행화와 구조개선 사례를 제공하고 이것을 바탕으로 다른 유사 공공기관들의 업무에 활용이 가능하도록 제안 한다.

Quantum Authentication and Key Distribution protocol based on one-time ID (일회용 ID 기반 양자 인증 및 키 분배 프로토롤)

  • Lee Hwa-Yean;Hong Chang-Ho;Lim Jong-in;Yang Hyung-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.15 no.2
    • /
    • pp.73-80
    • /
    • 2005
  • We propose a Quantum Authentication and Key distribution protocol based on one-time n using one-way Hash function. The designated users can authenticate each other and the arbitrator using their one-time ID and distribute a quantum secret key using remained GHZ states after authentication procedure. Though the help of the arbitrator is needed in the process of authentication and key distribution, our protocol prevents the arbitrator from finding out the shared secret key even if the arbitrator becomes an active attacker. Unconditional security can be proved in our protocol as the other QKD protocols.

A Study of Memory Information Collection and Analysis in a view of Digital Forensic in Window System (윈도우 시스템에서 디지털 포렌식 관점의 메모리 정보 수집 및 분석 방법에 관한 고찰)

  • Lee Seok-Hee;Kim Hyun-Sang;Lim JongIn;Lee SangJin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.16 no.1
    • /
    • pp.87-96
    • /
    • 2006
  • In this paper, we examine general digital evidence collection process which is according to RFC3227 document[l], and establish specific steps for memory information collection. Besides, we include memory dump process to existing digital evidence collection process, and examine privacy information through dumping real user's memory and collecting pagefile which is part of virtual memory system. Especially, we discovered sensitive data which is like password and userID that exist in the half of pagefiles. Moreover, we suggest each analysis technique and computer forensic process for memory information and virtual memory.

A Study on Digital Evidence Transmission System for E-Discovery (E-Discovery를 위한 디지털 증거 전송시스템에 대한 연구)

  • Lee, Chang-Hoon;Baek, Seung-Jo;Kim, Tae-Wan;Lim, Jong-In
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.5
    • /
    • pp.171-180
    • /
    • 2008
  • This paper also suggests the Digital Evidence Transmission System for E-Discovery which is suited to domestic environments in order to solve these problems and promote safe and convenient transmission of the electronic evidences. The suggested Digital Evidence Transmission System for E-Discovery is the system that submit digital evidences to Court's Sever through the Internet using Public Key Infrastructure and Virtual Private Network, and solves the problems - such as privileged and privacy data, trade secret of company, etc.

Improving The Security Of Quantum Key Distribution And Quantum Authentication By Using CHSH Inequality (CHSH 부등식을 이용하여 양자 키 분배와 양자 인증의 안전성을 개선한 프로토콜)

  • Heo, Jin-O;Hong, Chang-Ho;Lim, Jong-In;Yang, Hyoung-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.4
    • /
    • pp.69-78
    • /
    • 2008
  • We propose to analyze a weakness of quantum key distribution and quantum authentication which use entangled state were proposed by Bao-sen Shi(2001) and to improve the security of the protocol. The existing protocol had a weakness against an impersonation attack of an eavesdropper, because of a only process which authenticated a third party(Center) by users. In this paper, we propose improving the security of the protocol that authenticates users by a third party using check mode which applies CHSH inequality.

Development of New Settlement Model for Prediction of Settlement Characteristics of SCP Composite Ground (SCP 복합지반 침하거동예측을 위한 새로운 침하모델의 개발)

  • You, Sang-Ho;Park, Hyun-Il;Im, Jong-Chul;Park, Lee-Keun
    • Journal of the Korean Geotechnical Society
    • /
    • v.25 no.8
    • /
    • pp.23-32
    • /
    • 2009
  • In this study, the reliable and simple analysis method was proposed to predict the settlement characteristic of composite ground in stage of design and construction of sand compaction pile (SCP). Model parameters could be obtained by the optimization process based on genetic algorithm. In order to examine the proposed method, laboratory consolidation tests on the settlement characteristic of SCP composite ground were performed for various replacement ratio of sand such as 0 (no replacement), 20, 36, and 56%. The proposed model showed very good agreements with measured data in the relation of void ratio-log scaled stress and time-compression far each replacement ratio.

A Study on Authentication Process in Smartphone Electronic Financial Services (스마트폰 전자금융서비스에서의 인증과정에 관한 연구(앱카드를 중심으로))

  • Kim, Hanwoo;Lee, Keun Young;Lim, Jong In;Kwon, Hun Yeong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.28 no.3
    • /
    • pp.579-590
    • /
    • 2018
  • In May 2014, AppCard(Which is a smartphone application designed to register and use a credit card in a mobile phone by credit card company.) was attacked by smshing and a vulnerability which could not obtainable phone number. After that, credit card companies have supplemented and operated by introducing additional authentication methods to supplement the vulnerability. However, The analysis of the authentication environments, purposes and methods is not enough to lower the level of vulnerability and risk from existing accidents. This study analyzes the authentication process of the AppCard in the electronic financial service by applying the NIST's authentication guidelines, identifies the problems and suggests improvement directions. The method analyzed in this study can be applied to the analysis of the authentication method in addition to the application card, so that it will be highly utilized.

A Study On The Eigen-properties of A 2-D Square Waveguide by the Krylov-Schur Iteration Method (Krylov-Schur 순환법에 의한 2차원 사각도파관에서의 고유치 문제에 관한 연구)

  • Kim, Yeong Min;Kim, Dongchool;Lim, Jong Soo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.11
    • /
    • pp.28-35
    • /
    • 2013
  • The Krylov-Schur algorithm has been applied to reveal the eigen-properties of the wave guide having the square cross section. The eigen-matrix equation has been constructed from FEM with the basis function of the tangential edge-vectors of the triangular element. This equation has been treated firstly with Arnoldi decomposition to obtain a upper Hessenberg matrix. The QR algorithm has been carried out to transform it into Schur form. The several eigen values satisfying the convergent condition have appeared in the diagonal components. The eigen-modes for them have been calculated from the inverse iteration method. The wanted eigen-pairs have been reordered in the leading principle sub-matrix of the Schur matrix. This sub-matrix has been deflated from the eigen-matrix equation for the subsequent search of other eigen-pairs. These processes have been conducted several times repeatedly. As a result, a few primary eigen-pairs of TE and TM modes have been obtained with sufficient reliability.

Differentiation of mixed bacterial populations by modified gram stain (수정된 Gram 염색법에 의한 혼합세균 개체군의 분별 측정)

  • 장진경;임종락;정계효;한홍의
    • Korean Journal of Microbiology
    • /
    • v.25 no.3
    • /
    • pp.244-248
    • /
    • 1987
  • Attempts were made to enumerate the number of Gram positive and negative bacteria in the development of natural fermentation rapidly and simultaneously. A general Gram stain was applied to this study. The number of cells by Gram stain was proportional to the cell turbidity by spectrophotometer within a range of 0.7 absorbance at 610nm. The cells washed out during procedures were not exceeded about 8 percentage. The standard error of separate counts in the mixture of Cscherichia coli and Micrococcus luteus was $5.1\pm2.3$%. The possible range of counting was $5.5\times 10^{7}-1.0\times 10^{9}$ cells/ml. Therefore, it is believed that a general Gram stain could be applied to the separate counting of mixture of Fram positive and negative bacterial populations too. In practice, growth kinetics of hemp retting and Kimchi fermentation were presented.

  • PDF

Impossible Differential Cryptanalysis of Reduced Round XTEA and TEA (XTEA와 TEA의 축소된 라운드에 대한 불능 차분 공격)

  • 문덕재;황경덕;이원일;이상진;임종인
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.12 no.4
    • /
    • pp.77-85
    • /
    • 2002
  • We present the impossible differential cryptanalysis of the block cipher XTEA[7] and TEA[6]. The core of the design principle of these block ciphers is an easy implementation and a simplicity. But this simplicity dose not offer a large diffusion property. Our impossible differential cryptanalysis of reduced-round versions of XTEA and TEA is based on this fact. We will show how to construct a 12-round impossible characteristic of XTEA. We can then derive 128-bit user key of the 14-round XTEA with $2^{62.5}$ chosen plaintexts and $2^{85}$ encryption times using the 12-round impossible characteristic. In addition, we will show how to construct a 10-round impossible characteristic or TEA. Then we can derive 128-bit user key or the 11-round TEA with $2^{52.5}$ chosen plaintexts and $2^{84}$ encryption times using the 10-round impossible characteristic.