• Title/Summary/Keyword: 연산 효율

Search Result 2,610, Processing Time 0.025 seconds

Mutual Authentication Protocol for Preserving Privacy of Mobile RFID User using Random Key Division (랜덤 키 분할을 이용한 모바일 RFID 사용자의 프라이버시를 보호하는 상호 인증 프로토콜)

  • Jeong, Yoon-Su;Kim, Yong-Tae;Park, Gil-Cheol;Lee, Sang-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.3B
    • /
    • pp.220-230
    • /
    • 2011
  • Mobile RFID which integrates mobile network with RFID technique is the technique to get the information of products by transmitting the identifier through mobile network after reading the identifier of RFID tag. It attached on the equipment as the mobile phone. However, mobile RFID has the privacy-related problem among requested secure problems required from the existing RFID. In this paper, the random key created by mobile RFID reader and Tag during the inter-certificating and initialization procedure for mobile RFID users to receive tag information from backend server securely is divided into random sizes and any information on the tag which requires the protection of privacy shouldn't be provided to anyone. In performance analysis, previous protocol used modulo operation in registration and login computation. But the proposed protocol has higher efficiency in saving space and computation volume than MARP scheme and Kim. et. al scheme because our protocol is accomplished by mutual authentication and registering user information through one-way hash function.

A Study on Complex Field Network Coding Scheme for Wireless Relay System (무선 릴레이 시스템에서의 Complex Field Network Coding 기법 적용에 관한 연구)

  • Hwang, Won-Jun;Jang, Jun-Hee;Choi, Hyung-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4C
    • /
    • pp.241-253
    • /
    • 2011
  • In this paper, a CFNC (Complex Field Network Coding) scheme is presented, which focuses on improving transmission efficiency by reducing time slots that are needed to exchange data frames. Conventional CFNC scheme has the advantage of minimizing the number of time slots required for information exchanges. However, there exists serious performance deterioration because the transmit signals are interfered with each other. Moreover, when CFNC scheme is applied, the estimation and compensation performance of fine frequency offset severely deteriorates due to the multiple frequency offsets in received signal of relay node. In order to overcome these critical problems, we propose an improved CFNC scheme with modified maximum likelihood decision method which uses uplink transmit diversity. Also, we propose an enhanced fine frequency offset estimation method and a corresponding compensation method to deal with the multiple frequency offsets. Corresponding simulation results verify that the proposed methods are able to effectively solve the problems of CFNC scheme.

Design of an Automatic Generation System for Cycle-accurate Instruction-set Simulators for DSP Processors (DSP 프로세서용 인스트럭션 셋 시뮬레이터 자동생성기의 설계에 관한 연구)

  • Hong, Sung-Min;Park, Chang-Soo;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9A
    • /
    • pp.931-939
    • /
    • 2007
  • This paper describes the system which automatically generates instruction-set simulators cores using the SMDL. SMDL describes structure and instruction-set information of a target DSP machine. Analyzing behavioral information of each pipeline stage of all instructions on a target ASIPS, the proposed system automatically generates a cycle-accurate instruction set simulator in C++ for a target processor. The proposed system has been tested by generating instruction-set simulators for ARM9E-S, ADSP-TS20x, and TMS320C2x architectures. Experiments were performed by checking the functions of the $4{\times}4$ matrix multiplication, 16-bit IIR filter, 32-bit multiplication, and the FFT using the generated simulators. Experimental results show the functional accuracy of the generated simulators.

RFID Distance Bounding Protocol Secure Against Mafia and Terrorist Fraud (테러리스트 공격과 마피아 공격에 안전한 RFID 거리 제한 프로토콜)

  • Kwon, Hye Jin;Kim, Soon Ja
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.11
    • /
    • pp.660-674
    • /
    • 2014
  • RFID system has been used in a variety of services. So, a lot of attacks like a free ride on the service, leakage of property or personal information are known. Therefore, the solutions that address these attacks have been proposed. Among the attacks, mafia fraud, a kind of relay attack, can not be addressed by common authentication protocol. So, Hancke and Kuhn used distance bounding protocol for RFID authentication. After that, Munilla and Peinado modified HK protocol by adding void challenge. So the mafia fraud success probability of adversary is lower than probability of HK protocol. Ahn et al. proposed a protocol that reduces number of a hash computation and traffic than MP protocol. Here, we show that MP protocol can not defend the terrorist fraud and is vulnerable to noise. And we show that also AYBN protocol is vulnerable to mafia fraud and key leakage. Moreover, we propose a new protocol and our experimental results show that our protocol is secure to terrorist and mafia fraud.

Intermixing Surface and Volume Visualization Using Layered Depth Images (다중 깊이 영상을 이용한 볼륨-표면 혼합 가시화)

  • Kye, Heewon
    • Journal of Korea Game Society
    • /
    • v.13 no.2
    • /
    • pp.99-110
    • /
    • 2013
  • As volume rendering has been applied for computer game, the visualization of volume data with surface data in one scene has been required. Though a hybrid rendering of volume and surface data have been developed using the GPGPU functionality, computer games which run on low-level hardware are difficult to perform the hybrid rendering. In this paper, we propose a new hybrid rendering based on DirectX 9.0 and general hardware. We generate the layered depth images from surface data using a new method to reduce the depth complexity and generation time. Then, we perform the hybrid rendering using the layered depth images. In the rendering process, we suggest a new method to transform the coordinate system from a surface coordinate to a volume coorinate and propose an accelerated rendering technique. As the result, we can perform volume-surface hybrid rendering in an efficient way.

A Speed Control of Switched Reluctance Motor using Fuzzy-Neural Network Controller (퍼지-신경망 제어기를 이용한 스위치드 리럭턴스 전동기의 속도제어)

  • 박지호;김연충;원충연;김창림;최경호
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.13 no.4
    • /
    • pp.109-119
    • /
    • 1999
  • Switched Reluctance Motor(SRM) have been expanding gradually their awlications in the variable speed drives due to their relatively low cost, simple and robust structure, controllability and high efficiency. In this paper neural network theory is used to detemrine fuzzy-neural network controller's membership ftmctions and fuzzy rules. In addition neural network emulator is used to emulate forward dynamics of SRM and to get error signal at fuzzy-neural controller output layer. Error signal is backpropagated through neural network emulator. The backpropagated error of emulator offers the path which reforms the fuzzy-neural network controller's mmbership ftmctions and fuzzy rules. 32bit Digital Signal Processor(TMS320C31) was used to achieve the high speed control and to realize the fuzzy-neural control algorithm. Simulation and experimental results show that in the case of load variation the proposed control rrethcd was superior to a conventional rrethod in the respect of speed response.sponse.

  • PDF

A Study for searching optimized combination of Spent light water reactor fuel to reuse as heavy water reactor fuel by using evolutionary algorithm (진화 알고리즘을 이용한 경수로 폐연료의 중수로 재사용을 위한 최적 조합 탐색에 관한 연구)

  • 안종일;정경숙;정태충
    • Journal of Intelligence and Information Systems
    • /
    • v.3 no.2
    • /
    • pp.1-9
    • /
    • 1997
  • These papers propose an evolutionary algorithm for re-using output of waste fuel of light water reactor system in nuclear power plants. Evolutionary algorithm is useful for optimization of the large space problem. The wastes contain several re-useable elements, and they should be carefully selected and blended to satisfy requirements as input material to the heavy water nuclear reactor system. This problem belongs to a NP-hard like the 0/1 Knapsack problem. Two evolutionary strategies are used as a, pp.oximation algorithms in the highly constrained combinatorial optimization problem. One is the traditional strategy, using random operator with evaluation function, and the other is heuristic based search that uses the vector operator reducing between goal and current status. We also show the method, which performs the feasible teat and solution evaluation by using the vectorized data in problem. Finally, We compare the simulation results of using random operator and vector operator for such combinatorial optimization problems.

  • PDF

Side-Channel Analysis Based on Input Collisions in Modular Multiplications and its Countermeasure (모듈라 곱셈의 충돌 입력에 기반한 부채널 공격 및 대응책)

  • Choi, Yongje;Choi, Dooho;Ha, Jaecheol
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.24 no.6
    • /
    • pp.1091-1102
    • /
    • 2014
  • The power analysis attack is a cryptanalytic technique to retrieve an user's secret key using the side-channel power leakage occurred during the execution of cryptographic algorithm embedded on a physical device. Especially, many power analysis attacks have targeted on an exponentiation algorithm which is composed of hundreds of squarings and multiplications and adopted in public key cryptosystem such as RSA. Recently, a new correlation power attack, which is tried when two modular multiplications have a same input, is proposed in order to recover secret key. In this paper, after reviewing the principle of side-channel attack based on input collisions in modular multiplications, we analyze the vulnerability of some exponentiation algorithms having regularity property. Furthermore, we present an improved exponentiation countermeasure to resist against the input collision-based CPA(Correlation Power Analysis) attack and existing side channel attacks and compare its security with other countermeasures.

μ-Hope : Compact Size RLWE Based KEM Using Error Correcting Code (μ-Hope : 오류 정정 부호를 사용한 RLWE 기반의 경량 KEM)

  • Lee, Juyeop;Kim, Suhri;Kim, Chang Han;Hong, Seokhie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.5
    • /
    • pp.781-793
    • /
    • 2020
  • In this paper, we propose a new RLWE-based scheme named μ-Hope that exploits Error Correcting Code(ECC) on NewHope. The previous parameters of NewHope uses 12289 as a prime modulus, and the size of the public key, private key, and ciphertext is 928-byte, 1888-byte, and 1120-byte respectively, which can be said to be larger than other RLWE based algorithms. In this paper, we propose μ-Hope, which changes modulus 12289 to 769 to reduce the size of the public key, private key, and ciphertext. Also, we adopts XE1 as an Error Correcting Code(ECC) to solve the increased decryption failure rate caused by using a small prime modulus. As a result, the size of the public key, private key, and ciphertext decreased by 38%, 37%, and 37% respectively. As the computational efficiency caused by using a small prime modulus exceeds the performance degradation by exploiting ECC, this result in 25% performance improvement for a single key exchange.

A Location Management Scheme using Direction Characteristics of Mobile Terminals in Mobile Communication Systems (이동 통신 시스템에서 이동 단말의 방향성을 고려한 위치 관리 기법)

  • 김태수;송의성;한연희;황종선;길준민
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.1
    • /
    • pp.48-64
    • /
    • 2003
  • Recently, as the number of mobile users keeps increasing explosively, the location management to track the mobile users in mobile communication systems is being more important. However, the previous location management schemes have been used static location information without the consideration of a user's moving direction. This results in unnecessary pagings, consequently it increases location management costs. In this paper, we propose a mew location management costs. In this paper, we propose a new location the cell occurred a location update. It also determines whether the location update will be executed or not, by the offset operation of direction vector. Thus, a user's paging areas are generated dynamically along the user's moving direction. The wide of paging areas is also determined dynamically. Besides, we present analytic model for our scheme. To compare with our scheme, the distance-based scheme is analyzed. The numerical result shows that our scheme is more efficient than the distance-based scheme in the most cases except a low CMR. Particularly if a user move into a specific direction, our scheme has the lower location management cost than that of the distance-based scheme.