• Title/Summary/Keyword: 이진 코드 분석

Search Result 72, Processing Time 0.024 seconds

The Study of the Equation $(x+1)^d=x^d+1$ over Finite Fields (유한체위에서 방정식 $(x+1)^d=x^d+1$에 대한 연구)

  • Cho, Song-Jin;Kim, Han-Doo;Choi, Un-Sook;Kwon, Sook-Hee;Kwon, Min-Jeong;Kim, Jin-Gyoung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.237-240
    • /
    • 2012
  • Binary sequences of period $N=2^k-1$ are widely used in many areas of engineering and sciences. Some well-known applications include code-division multiple-access (CDMA) communications and stream cipher systems. In this paper, we analyze the equation $(x+1)^d=x^d+1$ over finite fields. The $d$ of the equation is used to analyze cross-correlation of binary sequences.

  • PDF

A Research of Anomaly Detection Method in MS Office Document (MS 오피스 문서 파일 내 비정상 요소 탐지 기법 연구)

  • Cho, Sung Hye;Lee, Sang Jin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.2
    • /
    • pp.87-94
    • /
    • 2017
  • Microsoft Office is an office suite of applications developed by Microsoft. Recently users with malicious intent customize Office files as a container of the Malware because MS Office is most commonly used word processing program. To attack target system, many of malicious office files using a variety of skills and techniques like macro function, hiding shell code inside unused area, etc. And, people usually use two techniques to detect these kinds of malware. These are Signature-based detection and Sandbox. However, there is some limits to what it can afford because of the increasing complexity of malwares. Therefore, this paper propose methods to detect malicious MS office files in Computer forensics' way. We checked Macros and potential problem area with structural analysis of the MS Office file for this purpose.

Machine-printed Numeral Recognition using Weighted Template Matching with Chain Code Trimming (체인 코드 트리밍과 가중 원형 정합을 이용한 인쇄체 숫자 인식)

  • Jung, Min-Chul
    • Journal of Intelligence and Information Systems
    • /
    • v.13 no.4
    • /
    • pp.35-44
    • /
    • 2007
  • This paper proposes a new method of weighted template matching for machine-printed numeral recognition. The proposed weighted template matching, which emphasizes the feature of a pattern using adaptive Hamming distance on local feature areas, improves the recognition rate while template matching processes an input image as one global feature. Template matching is vulnerable to random noises that generate ragged outlines of a pattern when it is binarized. This paper offers a method of chain code trimming in order to remove ragged outlines. The method corrects specific chain codes within the chain codes of the inner and the outer contour of a pattern. The experiment compares confusion matrices of both the template matching and the proposed weighted template matching with chain code trimming. The result shows that the proposed method improves fairly the recognition rate of the machine-printed numerals.

  • PDF

Malicious Script Detection By Static Analysis (정적 분석 기법을 이용한 악성 스크립트 탐지)

  • 배병우;이성욱;조은선;홍만표
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 2001.11a
    • /
    • pp.91-95
    • /
    • 2001
  • 본 논문은 현재 컴퓨터 사용자들에게 많은 피해를 입히고 있는 악성 스크립트 코드에 대한 탐지기법을 제시하고자 한다. 스크립트 언어는 타 언어에 비해서 단순하며, 상위 수준의 언어로 작성된 소스를 직접 분석가능하기 때문에 기존의 이진 파일 형태의 바이러스 비해 정적 분석 기법 적용이 용이하다. 제안하는 탐지 기법은 기존의 스코어링 방식을 기반으로 한 패턴 매칭과는 달리 스크립트가 수행하는 악성 행위의 분석을 통해 행위 패턴을 생성하고, 이 패턴들을 정적 분석 기법을 통해 패턴간의 관계 분석을 통해 보다 확실한 악성 행위를 탐지하여 스크립트에 포함된 악성행위들을 보고한다. 기존 대부분의 바이러스 탐지 도구들은 이미 알려진 바이러스들만을 탐지 할 수 있다. 정적 분석 기법을 이용한 악성 스크립트 탐지 방법은 악성 행위 별 패턴 존재 여부를 판단하므로 이미 알려진 바이러스는 물론 알려지지 않은 바이러스를 탐지 할 수 있는 방안을 제시한다.

  • PDF

Optimum Beamforming Vector Indexing Scheme for Codebook based MISO System over Feedback Error Channel (피드백 오류 채널에서 코드북 기반 MISO 시스템의 최적에 빔포밍 벡터 인덱싱 기법)

  • Lee, Jin-Hee;Ko, Young-Chai
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12A
    • /
    • pp.991-997
    • /
    • 2009
  • Transmit beamforming is simple method to achieve the full diversity gain that is available in multiple antenna(MIMO) wireless systems. Unfortunately, the prior condition to achieve this gain requires perfect channel knowledge at both transmitter and receiver, which is impractical on account of limited feedback link. Therefore, for the practical system, codebook based feedback scheme is often employed, where the beamforming vector is selected from the codebook to maximize the output signal-to-noise ratio (SNR) at receiver, and the receiver only sends back the index of the best beamforming vector to the transmitter. In this paper we derive analytical expression of average bit error rate (BER) for the codebook based transmit beamforming MISO system over the feedback error channel. Using this analytical result, we present optimum codebook indexing scheme to improve the performance of this system. From some selected numerical examples we show that our proposed codebook indexing scheme can provide nonnegligible performance improvements in terms of average BER over the severe feedback error channel.

Power Consumption Analysis of High-Level Obfuscation for Mobile Software (모바일 소프트웨어를 위한 고급수준 난독처리 기법의 전력 소모량 분석)

  • Lee, Jin-Young;Chang, Hye-Young;Cho, Seong-Je
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.12
    • /
    • pp.1008-1012
    • /
    • 2009
  • Obfuscation is known as one of the most effective methods to protect software against malicious reverse engineering transforming the software into more complicated one with still preserving the original semantic. However, obfuscating a program can increase both code size of the program and execution time compared to the original program. In mobile devices, the increases of code size and execution time incur the waste of resources including the increase of power consumption. This paper has analyzed the effectiveness of some high-level obfuscation algorithms as well as their power consumption with implementing them under an embedded board equipped with ARM processor. The analysis results show that there is (are) an efficient obfuscation method(s) in terms of execution time or power consumption according to characteristics of a given program.

Analyzing Differences of Binary Executable Files using Program Structure and Constant Values (프로그램의 구조와 상수 값을 이용하는 바이너리 실행 파일의 차이점 분석)

  • Park, Hee-Wan;Choi, Seok-Woo;Seo, Sun-Ae;Han, Tai-Sook
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.7
    • /
    • pp.452-461
    • /
    • 2008
  • Binary diffing is a method to find differences in similar binary executables such as two different versions of security patches. Previous diffing methods using flow information can detect control flow changes, but they cannot track constant value changes. Biffing methods using assembly instructions can detect constant value changes, but they give false positives which are due to compiling methods such as instruction reordering. We present a binary diffing method and its implementation named SCV which utilizes both structure and value information. SCV summarizes structure and constant value information from disassembled code, and matches the summaries to find differences. By analyzing a Microsoft Windows security patches, we showed that SCV found necessary differences caused by constant value changes which the state-of-the-art binary diffing tool BinDiff failed to find.

The Composition and Analytical Classification of Cyber Incident based Hierarchical Cyber Observables (계층적 침해자원 기반의 침해사고 구성 및 유형분석)

  • Kim, Young Soo;Mun, Hyung-Jin;Cho, Hyeisun;Kim, Byungik;Lee, Jin Hae;Lee, Jin Woo;Lee, Byoung Yup
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.11
    • /
    • pp.139-153
    • /
    • 2016
  • Cyber incident collected from cyber-threat-intelligence sharing Center is growing rapidly due to expanding malicious code. It is difficult for Incident analysts to extract and classify similar features due to Cyber Attacks. To solve these problems the existing Similarity Analysis Method is based on single or multiple cyber observable of similar incidents from Cyber Attacks data mining. This method reduce the workload for the analysis but still has a problem with enhancing the unreality caused by the provision of improper and ambiguous information. We propose a incident analysis model performed similarity analysis on the hierarchically classified cyber observable based on cyber incident that can enhance both availability by the provision of proper information. Appling specific cyber incident analysis model, we will develop a system which will actually perform and verify our suggested model.

A Study on Minimum Separation Distance for Aboveground High-pressure Natural Gas Pipelines (지상 고압 천연가스 배관의 최소 이격거리 기준에 관한 연구)

  • Lee, Jin-Han;Jo, Young-Do
    • Korean Chemical Engineering Research
    • /
    • v.57 no.2
    • /
    • pp.225-231
    • /
    • 2019
  • In Korea, the minimum separation distance between aboveground high-pressure natural gas pipeline and buildings is regulated by Korea gas safety (KGS) code. In this paper, The technical backgrounds for the revision of the KGS code related to the minimum separation distance was presented. A consequence-based approach was adopted to determine the minimum separation distance by a reasonable accident scenario, which was a jet fire caused by the rupture of one inch branch line attached the gas pipeline. Where, the higher thermal radiation flux threshold was selected for workers in industrial area than for people in non-industrial area, because the workers in industrial area were able to escape in a shorter time than the people in public. As result of consequence analysis for the accident scenario, we suggested the KGS code revision that the minimum separation distances between high-pressure natural gas pipeline installed above ground and buildings should be 30 meter in non-industrial area and 15 meter in industrial area. The revised code was accepted by the committee of the KGS code and now in effect.

The study on Lightness and Performance Improvement of Universal Code (BL-beta code) for Real-time Compressed Data Transferring in IoT Device (IoT 장비에 있어서 실시간 데이터 압축 전송을 위한 BL-beta 유니버설 코드의 경량화, 고속화 연구)

  • Jung-Hoon, Kim
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.15 no.6
    • /
    • pp.492-505
    • /
    • 2022
  • This study is a study on the results of improving the logic to effectively transmit and decode compressed data in real time by improving the encoding and decoding performance of BL-beta codes that can be used for lossless real-time transmission of IoT sensing data. The encoding process of BL-beta code includes log function, exponential function, division and square root operation, etc., which have relatively high computational burden. To improve them, using bit operation, binary number pattern analysis, and initial value setting of Newton-Raphson method using bit pattern, a new regularity that can quickly encode and decode data into BL-beta code was discovered, and by applying this, the encoding speed of the algorithm was improved by an average of 24.8% and the decoding speed by an average of 5.3% compared to previous study.