• Title/Summary/Keyword: 컴퓨터 대수시스템

Search Result 92, Processing Time 0.026 seconds

A Design of Smart Home IoT Device Remote Control Policy Management System based on CEP (CEP 기반의 스마트 홈 IoT 디바이스 원격 제어 정책 관리 시스템 설계)

  • Kim, KyeYoung;Moon, Daejin;Cho, Dae-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.576-578
    • /
    • 2016
  • Various smart home IoT devices and services while the Internet of things is the development has been provided. The core of the smart home IoT service is that user control the device via the Internet communication. Communication of IoT devices, because most with an IP address within the private network, there is a difficulty in the remote control to control access from outside the network. Any of the methods for remote control, to determine the IP address of each other, there is a UDP hole punching for communication. To ensure the data communication success rate closed to 100%, the UDP hole punching must undergo a process of three stages in some cases. In this paper, to provide a system for managing the remote control policy based on the CEP in order to omit the unnecessary steps on the remote control of IoT devices using UDP hole punching.

  • PDF

Secret Group Key Re-sharing Method Suitable for Digital Mobile Communication (디지털 이동통신 시스템에 적합한 그룹 공유키 경신 방식)

  • 심주걸
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.10 no.3
    • /
    • pp.69-76
    • /
    • 2000
  • In this paper we propose a new group key renewal scheme suitable for secure mobile communications in which all members of the group can re-share the new group common key excepted a revoked member using a key distribution center(a trusted center). A renewal group key in the proposed scheme can be shared many times using pre-distributed data by a smart card without a preparation stage. This scheme is also avaliable for a large group network because the transmitted data amount after identifying the revoked member does not depend on a size of group. The secuirty of this scheme is based on the difficulty of the discrete logarithm problem.

Synthesis of Symmetric 1-D 5-neighborhood CA using Krylov Matrix (Krylov 행렬을 이용한 대칭 1차원 5-이웃 CA의 합성)

  • Cho, Sung-Jin;Kim, Han-Doo;Choi, Un-Sook;Kang, Sung-Won
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.6
    • /
    • pp.1105-1112
    • /
    • 2020
  • One-dimensional 3-neighborhood Cellular Automata (CA)-based pseudo-random number generators are widely applied in generating test patterns to evaluate system performance and generating key sequence generators in cryptographic systems. In this paper, in order to design a CA-based key sequence generator that can generate more complex and confusing sequences, we study a one-dimensional symmetric 5-neighborhood CA that expands to five neighbors affecting the state transition of each cell. In particular, we propose an n-cell one-dimensional symmetric 5-neighborhood CA synthesis algorithm using the algebraic method that uses the Krylov matrix and the one-dimensional 90/150 CA synthesis algorithm proposed by Cho et al. [6].

Analysis of Attacks and Security Level for Multivariate Quadratic Based Signature Scheme Rainbow (다변수 이차식 기반 서명 기법 Rainbow의 공격 기법 및 보안강도 분석)

  • Cho, Seong-Min;Kim, Jane;Seo, Seung-Hyun
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.31 no.3
    • /
    • pp.533-544
    • /
    • 2021
  • Using Shor algorithm, factoring and discrete logarithm problem can be solved effectively. The public key cryptography, such as RSA and ECC, based on factoring and discrete logarithm problem can be broken in polynomial time using Shor algorithm. NIST has been conducting a PQC(Post Quantum Cryptography) standardization process to select quantum-resistant public key cryptography. The multivariate quadratic based signature scheme, which is one of the PQC candidates, is suitable for IoT devices with limited resources due to its short signature and fast sign and verify process. We analyzes classic attacks and quantum attacks for Rainbow which is the only multivatiate quadratic based signature scheme to be finalized up to the round 3. Also we compute the attack complexity for the round 3 Rainbow parameters, and analyzes the security level of Rainbow, one of the PQC standardization candidates.

Analysis of the Single Event Effect of the Science Technology Satellite-3 On-Board Computer under Proton Irradiation (과학기술위성 3호 온보드 컴퓨터의 양성자 빔에 의한 Single Event Effect 분석)

  • Kang, Dong-Soo;Oh, Dae-Soo;Ko, Dae-Ho;Baik, Jong-Chul;Kim, Hyung-Shin;Jhang, Kyoung-Son
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.39 no.12
    • /
    • pp.1174-1180
    • /
    • 2011
  • Field Programmable Gate Array(FPGA)s are replacing traditional integrated circuits for space applications due to their lower development cost as well as reconfigurability. However, they are very sensitive to single event upset (SEU) caused by space radiation environment. In order to mitigate the SEU, on-board computer of STSAT-3 employed a triple modular redundancy(TMR) and scrubbing scheme. Experimental results showed that upset threshold energy was improved from 10.6 MeV to 20.3 MeV when the TMR and the scrubbing were applied to the on-board computer. Combining the experimental results with the orbit simulation results, calculated bit-flip rate of on-board computer is 1.23 bit-flips/day assuming in the worst case of STSAT-3 orbit.

Fast Fuzzy Inference Algorithm for Fuzzy System constructed with Triangular Membership Functions (삼각형 소속함수로 구성된 퍼지시스템의 고속 퍼지추론 알고리즘)

  • Yoo, Byung-Kook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.1
    • /
    • pp.7-13
    • /
    • 2002
  • Almost applications using fuzzy theory are based on the fuzzy inference. However fuzzy inference needs much time in calculation process for the fuzzy system with many input variables or many fuzzy labels defined on each variable. Inference time is dependent on the number of arithmetic Product in computation Process. Especially, the inference time is a primary constraint to fuzzy control applications using microprocessor or PC-based controller. In this paper, a simple fast fuzzy inference algorithm(FFIA), without loss of information, was proposed to reduce the inference time based on the fuzzy system with triangular membership functions in antecedent part of fuzzy rule. The proposed algorithm was induced by using partition of input state space and simple geometrical analysis. By using this scheme, we can take the same effect of the fuzzy rule reduction.

Design and Implementation of a Concentration-based Review Support Tool for Real-time Online Class Participants (실시간 온라인 수업 수강자들의 집중력 기반 복습 지원 도구의 설계 및 구현)

  • Tae-Hwan Kim;Dae-Soo Cho;Seung-Min Park
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.3
    • /
    • pp.521-526
    • /
    • 2023
  • Due to the recent pandemic, most educational systems are being conducted through online classes. Unlike face-to-face classes, it is even more difficult for learners to maintain concentration, and evaluating the learners' attitude toward the class is also challenging. In this paper, we proposed a real-time concentration-based review support system for learners in real-time video lectures that can be used in online classes. This system measured the learner's face, pupils, and user activity in real-time using the equipment used in the existing video system, and delivers real-time concentration measurement values to the instructor in various forms. At the same time, if the concentration measurement value falls below a certain level, the system alerted the learner and records the timestamp of the lecture. By using this system, instructors can evaluate the learners' participation in the class in real-time and help to improve their class abilities.

A Study of Closed OTEC Power Plants (폐쇄형 해양온도차발전 사이클에 관한 연구)

  • Shin, Sang-Ho;Jung, Dong-Soo;Kim, Chong-Bo;Seo, Tae-Beom;Chun, Won-Gee;Auh, P. Chung-Moo
    • Solar Energy
    • /
    • v.17 no.4
    • /
    • pp.23-33
    • /
    • 1997
  • In this paper, performance of various working fluids is evaluated for the closed Ocean Thermal Energy Conversion(OTEC) power plant operating on Rankine cycle. The evaporator and condenser are modeled via UA and LMTD method while turbine and pump are modeled by specifying isentropic efficiencies. R22, Propane, Propylene, R134a, R125, R143a, R32, R410A and Ammonia are used as working fluids. Results show that newly developed fluids such as R410A and R32 that do not cause stratospheric ozone layer depletion perform as well as R22 and ammonia. The superheat at the evaporator exit and subcooling at the condenser exit do not affect the performance of the simple OTEC power cycle. Turbine efficiency and heat exchanger size influence greatly the performance of the Rankine cycle. Finally, it was shown that closed OTEC power plants can practically generate electricity when the difference in warm and cold sea water inlet temperatures is greater than $20^{\circ}C$.

  • PDF

An Optimal Parallel Algorithm for Generating Computation Tree Form on Linear Array with Slotted Optical Buses (LASOB 상에서 계산 트리 형식을 생성하기 위한 최적 병렬 알고리즘)

  • Kim, Young-Hak
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.5
    • /
    • pp.475-484
    • /
    • 2000
  • Recently, processor arrays to enhance the banRecently, processor arrays to enhance the bandwidth of buses and to reduce the complexity of hardwares, using optical buses instead of electronic buses, have been proposed in manyliteratures. In this paper, we first propose a constant-time algorithm for parentheses matching problemon a linear array with slotted optical buses (LASOB).Then, given an algebraic expression of length n, we also propose a cost optimal parallel algorithmthat constructs computational tree form in the steps of constant time on LASOB with n processorsby using parentheses matching algorithm. A cost optimal parallel algorithm for this problem that runsin constant time has not yet been known on any parallel computation models.

  • PDF

A Method for Specifying the Access Control of XML Document using Process Algebra (프로세스 대수를 이용한 XML 문서의 접근권한 표현법)

  • Lee, Ji-Yeon;Kim, Il-Gon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.3
    • /
    • pp.251-258
    • /
    • 2007
  • With the increase of a web service technology, a new access control mechanism has developed for XML documents. As a result, as legacy access control systems, access control systems has become an active research topic. In this paper, we propose a methodology to translate access control policies for XML documents into formal specification language CSP. To do this, first, we introduce a method to translate a hierarchical access to XML documents using XPath language into CSP process algebra. Second, we explain a method to represent a XML schema as a formal model like automata. Third, we present a method for representing the semantics of access control policies such as the scope of rules and confliction resolution into a process algebra language. Finally, a CSP specification example of an XML schema and path expressions aye shown to illustrate the validity of our approach.

  • PDF