• Title/Summary/Keyword: Security chip

Search Result 133, Processing Time 0.023 seconds

Design of a Bit-Serial Divider in GF(2$^{m}$ ) for Elliptic Curve Cryptosystem (타원곡선 암호시스템을 위한 GF(2$^{m}$ )상의 비트-시리얼 나눗셈기 설계)

  • 김창훈;홍춘표;김남식;권순학
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.12C
    • /
    • pp.1288-1298
    • /
    • 2002
  • To implement elliptic curve cryptosystem in GF(2$\^$m/) at high speed, a fast divider is required. Although bit-parallel architecture is well suited for high speed division operations, elliptic curve cryptosystem requires large m(at least 163) to support a sufficient security. In other words, since the bit-parallel architecture has an area complexity of 0(m$\^$m/), it is not suited for this application. In this paper, we propose a new serial-in serial-out systolic array for computing division operations in GF(2$\^$m/) using the standard basis representation. Based on a modified version of tile binary extended greatest common divisor algorithm, we obtain a new data dependence graph and design an efficient bit-serial systolic divider. The proposed divider has 0(m) time complexity and 0(m) area complexity. If input data come in continuously, the proposed divider can produce division results at a rate of one per m clock cycles, after an initial delay of 5m-2 cycles. Analysis shows that the proposed divider provides a significant reduction in both chip area and computational delay time compared to previously proposed systolic dividers with the same I/O format. Since the proposed divider can perform division operations at high speed with the reduced chip area, it is well suited for division circuit of elliptic curve cryptosystem. Furthermore, since the proposed architecture does not restrict the choice of irreducible polynomial, and has a unidirectional data flow and regularity, it provides a high flexibility and scalability with respect to the field size m.

A Credit Card Sensing System based on Shared Key for Promoting Electronic Commerce (전자상거래 촉진을 위한 공유키 기반 신용카드 조회 시스템)

  • Jang, Si-Woong;Shin, Byoung-Chul;Kim, Yang-Kok
    • The KIPS Transactions:PartD
    • /
    • v.10D no.6
    • /
    • pp.1059-1066
    • /
    • 2003
  • In this paper, the magnetic sensing system is designed and implemented for the safe security in internet commerce system. When the payment is required inthe internet commerce system, the magnetic sensing system will get the information from a credit card without keyboard input and then encrypt and transmit the information to server. The credit card sensing system, which is proposed in this paper, is safe from keyboard hacking because it encrypts card information immediately in its internal chip and sends the information to host system. For the protection of information, the magnetic sensing system is basically based on a synchronous stream cipher cryptosystem which is related to a group of matrices. The size of matrices and the bits of keys for the best performances are determined for various cases. It is shown that for credit card payments. matrices of size 2 have good performance even at most 128bits keys with the consideration of inverse matrices. For authentication of general-purpose data, the magnetic sensing system needs more than 1.5KB data and in this case, the optimum size of matrices is 2 or 3 at more 256bits keys with consideration of inverse matrices.

Development of IoT Searching System Missing Children by utilizing Open Source Hardware (오픈소스 하드웨어를 이용한 IoT 미아찾기 시스템)

  • Heo, Seong-Mu;Kim, Cha-Jong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.277-280
    • /
    • 2016
  • Currently, systems for finding missing children are composed of using communication between a QR code and RFID chip, as the use of a smartphone. However, the current systems for finding missing children have limitations in that children can only be found if there are people in the surrounding area; there is an economic burden on parents required to purchase a smartphone for their children; along with difficulties in finding the missing children without the assistance of those in the surrounding area in critical situations such as a kidnapping, due to the limited duration of the battery life. In order to solve such problems, approaches need to be made from two perspectives: having someone in the surrounding area; and absence of anyone in the surrounding area. This thesis is centered on the development of a IoT (Internet of Things) system for finding missing children that combines two methods, namely, the method of finding missing children without a guardian in the surrounding area -within the limited space in which AP is installed by using a beacon and open source hardware being highlighted as the IoT technology - and the method of finding missing children with the smartphone application in which each individual becomes the Access Point (AP). The Main purpose is to provide accurate information of missing children's location for the 2situations and it is found that the accuracy of smartphones APP is 97.7% and security device AP is 91.1%.

  • PDF