• Title/Summary/Keyword: binary system

Search Result 1,885, Processing Time 0.031 seconds

Detecting TOCTOU Race Condition on UNIX Kernel Based File System through Binary Analysis (바이너리 분석을 통한 UNIX 커널 기반 File System의 TOCTOU Race Condition 탐지)

  • Lee, SeokWon;Jin, Wen-Hui;Oh, Heekuck
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.31 no.4
    • /
    • pp.701-713
    • /
    • 2021
  • Race Condition is a vulnerability in which two or more processes input or manipulate a common resource at the same time, resulting in unintended results. This vulnerability can lead to problems such as denial of service, elevation of privilege. When a vulnerability occurs in software, the relevant information is documented, but often the cause of the vulnerability or the source code is not disclosed. In this case, analysis at the binary level is necessary to detect the vulnerability. This paper aims to detect the Time-Of-Check Time-Of-Use (TOCTOU) Race Condition vulnerability of UNIX kernel-based File System at the binary level. So far, various detection techniques of static/dynamic analysis techniques have been studied for the vulnerability. Existing vulnerability detection tools using static analysis detect through source code analysis, and there are currently few studies conducted at the binary level. In this paper, we propose a method for detecting TOCTOU Race Condition in File System based on Control Flow Graph and Call Graph through Binary Analysis Platform (BAP), a binary static analysis tool.

A Photometric Investigation of KIC6118779 with Phase Smearing Effect

  • Jeong, Min-ji;Kim, Chun-Hwey
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.42 no.2
    • /
    • pp.63.3-64
    • /
    • 2017
  • KIC6118779 is an over-contact binary system having a short orbital period of about 0.36 days. The photometric data for this system are acquired by the observations of Kepler mission in the long cadence mode having a time resolution of about 30 minutes. It means that the Kepler light curves of the system may be strongly affected by phase smearing effect and the analysis of them without consideration of the phase smearing effect may result in wrong stellar properties. Additionally, this system also shows dynamical variation of light curve resulting from spot activity. For all those reasons, it is difficult to investigate KIC6118779, and the investigation should be carried out carefully. In this presentation, we introduce the phase smearing effect and carry out the light curve modeling with the 2015 version of the Wilson-Devinney binary code considering the phase smearing effect. Our results show that the system is a deep over contact binary system and has extremely low mass ratio of about 0.12. Moreover our spot modeling implies the cyclic migration of a big cool spot on the massive component.

  • PDF

Performance of Tactics Mobile Communication System Based on UWB with Double Binary Turbo Code in Multi-User Interference Environments (다중 사용자 간섭이 존재하는 환경에서 이중이진 터보부호를 이용한 UWB 기반의 전술이동통신시스템 성능)

  • Kim, Eun-Cheol;Seo, Sung-Il;Kim, Jin-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.1
    • /
    • pp.39-50
    • /
    • 2010
  • In this paper, we analyze and simulate the performance of a tactics mobile communication system based on ultra wide band (UWB) in multi-user interference (MUI) environments. This system adopts a double binary turbo code for forward error correction (FEC). Wireless channel is modeled a modified Saleh and Valenzuela (SV) model. We employ a space time block coding (STBC) scheme for enhancing system performance. System performance is evaluated in terms of bit error probability. From the simulation results, it is confirmed that the tactics mobile communication system based on UWB, which is encoded with the double binary turbo code, can achieve a remarkable coding gain with reasonable encoding and decoding complexity in multi-user interference environments. It is also known that the bit error probability performance of the tactics mobile communication system based on UWB can be substantially improved by increasing the number of iterations in the decoding process for a fixed cod rate. Besides, we can demonstrate that the double binary turbo coding scheme is very effective for increasing the number of simultaneous users for a given bit error probability requirement.

A Study on Breakthrough of Respirator Cartridge Using Multi-Organic Vapor Mixtures (복합유기용제에 노출된 호흡보호구용 정화통의 파과에 관한 연구)

  • Chung, Hai-Dong;Paik, Nam Won
    • Journal of Korean Society of Occupational and Environmental Hygiene
    • /
    • v.6 no.1
    • /
    • pp.55-66
    • /
    • 1996
  • This study was conducted to evaluate breakthrough characteristics of respirator cartridge using multi-organic vapors, including carbon tetrachloride, trichloroethylene, and toluene. The organic vapors were used as single phase, binary system, and ternary system. The results are summarized as follows. 1. Organic vapors studied were 1,000 ppm, 750 ppm, 500 ppm and 250 ppm in single phase. Carbon tetrachloride having the highest molecular weight showed the breakthrough first, and breakthrough sequency by organic vapor was dependent on its molecular weight. The 10% breakthrough times at 1,000 ppm of organic vapor were 97 minutes for carbon tetrachloride, 129 minutes for trichloroethylene and 135 minutes for toluene. 2. When concentrations of organic vapors were at levels of the Threshold Limit Values, the lives of the respirator cartridges were 122 hours in carbon tetrachloride, 18 hours in trichloroethylene and 28 hours in toluene. 3. In the binary system at a total concentration of 1,000 ppm with carbon tetrachloride and trichloroethylene, breakthrough times ranged from 104 minutes to 125 minutes, which were longer than 97 minutes in a single phase (1,000 ppm) for carbon tetrachloride, but shorter than breakthrough times for TCE and Toluene. 4. Breakthrough times in the binary system with carbon tetrachloride and toluene were 131~132 minutes. 5. Breakthrough times in the ternary system with carbon tetrachloride, toluene, and trichloroethyl ene were $120{\pm}8$ minutes, which were longer than 97 minutes in the single phase (1,000 ppm) for carbon tetrachloride, equal to 129 minutes for trichloroethylene, and shorter than 135 minutes for toluene. Those were almost similar to $124{\pm}9$ minutes of breakthrough times in the binary systems.

  • PDF

Unbounded Binary Search Method for Fast-tracking Maximum Power Point of Photovoltaic Modules

  • Hong, Yohan;Kim, Yong Sin;Baek, Kwang-Hyun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.6
    • /
    • pp.454-461
    • /
    • 2016
  • A maximum power point tracking (MPPT) system with fast-tracked time and high power efficiency is presented in this paper. The proposed MPPT system uses an unbounded binary search (UBS) algorithm that continuously tracks the maximum power point (MPP) with a binary system to follow the MPP under rapid-weather-change conditions. The proposed algorithm can decide the correct direction of the MPPT system while comparing the previous power point with the present power point. And then, by fixing the MPP until finding the next MPP, there is no oscillation of voltage MPP, which maximizes the overall power efficiency of the photovoltaic module. With these advantages, this proposed UBS is able to detect the MPP more effectively. This MPPT system is based on a boost converter with a micro-control unit to control analog-to-digital converters and pulse width modulation. Analysis of this work and experimental results show that the proposed UBS MPPT provides fast, accurate tracking with no oscillation in situations where weather rapidly changes and shadow is caused by all sorts of things. The tracking time is reduced by 87.3% and 66.1% under dynamic-state and steady-state operation, respectively, as compared with the conventional 7-bit perturb and observe technique.

A study on Iris Recognition using Wavelet Transformation and Nonlinear Function

  • Hur, Jung-Youn;Truong, Le Xuan
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2004.10a
    • /
    • pp.553-559
    • /
    • 2004
  • In todays security industry, personal identification is also based on biometric. Biometric identification is performed basing on the measurement and comparison of physiological and behavioral characteristics, Biometric for recognition includes voice dynamics, signature dynamics, hand geometry, fingerprint, iris, etc. Iris can serve as a kind of living passport or living password. Iris recognition system is the one of the most reliable biometrics recognition system. This is applied to client/server system such as the electronic commerce and electronic banking from stand-alone system or networks, ATMs, etc. A new algorithm using nonlinear function in recognition process is proposed in this paper. An algorithm is proposed to determine the localized iris from the iris image received from iris input camera in client. For the first step, the algorithm determines the center of pupil. For the second step, the algorithm determines the outer boundary of the iris and the pupillary boundary. The localized iris area is transform into polar coordinates. After performing three times Wavelet transformation, normalization was done using sigmoid function. The converting binary process performs normalized value of pixel from 0 to 255 to be binary value, and then the converting binary process is compare pairs of two adjacent pixels. The binary code of the iris is transmitted to the by server. the network. In the server, the comparing process compares the binary value of presented iris to the reference value in the University database. Process of recognition or rejection is dependent on the value of Hamming Distance. After matching the binary value of presented iris with the database stored in the server, the result is transmitted to the client.

  • PDF

Data Acquisition System Using the Second Binary Code (2차원 부호를 이용한 정보 획득 시스템)

  • Kim, In-Kyeom
    • The Journal of Information Technology
    • /
    • v.6 no.1
    • /
    • pp.71-84
    • /
    • 2003
  • In this paper, it is presented the efficient system for data recognition using the proposed binary code images. The proposed algorithm finds the position of binary image. Through the process of the block region classification, it is classified each block with the edge region using the value of gray level only. Each block region is divided horizontal and vertical edge region. If horizontal edge region blocks are classified over six blocks in any region, the proposed algorithm should search the vertical edge region in the start point of the horizontal edge region. If vertical edge region blocks were found over ten blocks in vertical region, the code image would found. Practical code region is acquired from the rate of the total edge region that is computed from the binary image that is processed with the average value. In case of the wrong rate, it is restarted the code search in the point after start point and the total process is followed. It has a short time than the before process time because it had classified block information. The block processing is faster thant the total process. The proposed system acquires the image from the digital camera and makes binary image from the acquired image. Finally, the proposed system extracts various characters from the binary image.

  • PDF

THE SEMIGROUPS OF BINARY SYSTEMS AND SOME PERSPECTIVES

  • Kim, Hee-Sik;Neggers, Joseph
    • Bulletin of the Korean Mathematical Society
    • /
    • v.45 no.4
    • /
    • pp.651-661
    • /
    • 2008
  • Given binary operations "*" and "$\circ$" on a set X, define a product binary operation "$\Box$" as follows: $x{\Box}y\;:=\;(x\;{\ast}\;y)\;{\circ}\;(y\;{\ast}\;x)$. This in turn yields a binary operation on Bin(X), the set of groupoids defined on X turning it into a semigroup (Bin(X), $\Box$)with identity (x * y = x) the left zero semigroup and an analog of negative one in the right zero semigroup (x * y = y). The composition $\Box$ is a generalization of the composition of functions, modelled here as leftoids (x * y = f(x)), permitting one to study the dynamics of binary systems as well as a variety of other perspectives also of interest.

A Novel Binary-to-Residue Conversion Algorithm for Moduli ($2^n$ - 1, $2^n$, $2^n + 2^{\alpha}$)

  • Syuto, Makoto;Satake, Eriko;Tanno, Koichi;Ishizuka, Okihiko
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.662-665
    • /
    • 2002
  • This paper describes a novel converter to implement high-speed binary-to-residue conversion for moduli 2$^{n}$ - 1, 2$^{n}$ , 2$^{n}$ +2$^{\alpha}$/($\alpha$$\in${0,1,…,n-1}) without using look-up table. In our implementation, the high-speed converter can be achieved, because of the modulo addition time is independent of the word length of operands by using the Signed-Digit (SD) adders inside the modulo adders. For a LSI implementation of residue SD number system with ordinary binary system, the proposed binary-to-residue converter is the efficient circuit.cient circuit.

  • PDF