• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.616-619
• /
• 2008

In this paper, we design and implement the authentication system for home network service and applied it to actual sensor nodes. We achieved authentication key, encryption and decryption applied RC5 encryption algorithm of SNEP. In addition, we used pair-wise key pre-distribution for prevention of authentication sniffing in wireless sensor network. The experiment environment consists of a base station receiving data and sensor nodes sending data. Each sensor nodes sends both the data and encrypted authentication key to the base station. As a simulation environment, we assumed some what-if scenarios of security menaces in home network service. And we slightly altered the TOS_Msg construction of TinyOS. The experiences had shown that the malfunction doesn't happen in communication among other groups. And we confirmed in tests that the system is secure when a sensor having malicious propose is added.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.659-662
• /
• 2004

이동통신용 전화기의 숫자 자판에서 다수의 한글 자소가 한 개의 키에 할당되기 때문에 한글 입력에 많은 번거로움이 따른다. 본 논문에서는 이러한 번거로움을 최소화 하기위해서 모든 단자음과 단모음이 키에 모두 표시되도록 설계한 분산형 한글 자판 배열과 글자를 구성하는 자소를 필기순서에 따라 해당키를 한번씩만 눌러서 입력할 수 있도록 하는 사용자 중심의 새로운 한글 입력 방식을 제안한다. 다양한 실험을 통해서 제안된 방법이 기존의 방식들에 비해서 키누름 동작에 따르는 입력 효율이 높은 것을 확인했다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.587-590
• /
• 2013

스마트 그리드는 기존의 전력망과 함께 양방향 통신을 위한 정보통신기술이 접목된 형태로, 전기의 생산, 운반, 소비뿐만 아니라 사용량 확인, 상호작용 등의 과정을 효율적으로 제공한다. 이와 같은 환경에서 전송되는 정보는 개인의 소비 성향과 같은 민감한 정보를 포함하고 있으므로, 안전한 통신을 위한 암호화가 필수적으로 요구된다. 특히, 다수의 장치가 계층적 구조를 이루는 스마트 그리드 환경에서는 암호화를 위하여 효율적인 그룹 키 사용이 필수적으로 요구된다. 따라서 본 논문에서는 스마트그리드 환경에서 효율적인 그룹 키 분배를 위하여 그룹 키 원소 배열에서 일정 범위를 한정하는 윈도우를 이용한 기법을 제안한다.

• Journal of the Korea Convergence Society
• /
• v.8 no.6
• /
• pp.37-44
• /
• 2017

Mobile devices provide various services through payment and authentication by inputting important information such as passwords on the screen with the virtual keypads. In order to infer the password inputted by the user, the attacker captures the user's touch location information. The attacker is able to infer the password by using the location information or to obtain password information by peeping with Google Glass or Shoulder Surfing Attack. As existing secure keypads place the same letters in a set order except for few keys, considering handy input, they are vulnerable to attacks from Google Glass and Shoulder Surfing Attack. Secure keypads are able to improve security by rearranging various shapes and locations. In this paper, we propose secure keypads that generates 13 different shapes and sizes of Tetris and arranges keypads to be attached one another. Since the keypad arranges different shapes and sizes like the game, Tetris, for the virtual keypad to be different, it is difficult to infer the inputted password because of changes in size even though the attacker knows the touch location information.

• Journal of the HCI Society of Korea
• /
• v.1 no.1
• /
• pp.21-28
• /
• 2006

Most of the commercialized wearable text input devices are wrist-worn keyboards that have adopted the minimization method of reducing keys. Generally, a drastic key reduction in order to achieve sufficient wearability increases KSPC(Keystrokes per Character), decreases text entry performance, and requires additional effort to learn a new typing method. We are faced with wearability-usability tradeoff problems in designing a good wearable keyboard. To address this problem, we introduced a new keyboard minimization method of reducing key pitch. From a series of empirical studies, we found the potential of a new method which has a keyboard with a 7mm key pitch, good wearability and social acceptance in terms of physical form factors, and allows users to type 15.0WPM in 3 session trials. However, participants point out that a lack of passive haptic feedback in keying action and visual feedback on users' input deteriorate the text entry performance. We have developed the One-key Keyboard that addresses this problem. The traditional desktop keyboard has one key per character, but the One-key Keyboard has only one key ($70mm{\times}35mm$) on which a 10*5 QWERTY key array is printed. The One-key Keyboard detects the position of the fingertip at the time of the keying event and figures out the character entered. We conducted a text entry performance test comprised of 5 sessions. The participants typed 18.9WPM with a 6.7% error rate over all sessions and achieved up to 24.5WPM. From the experiment's results, the One-key Keyboard was evaluated as a potential text input device for wearable computing, balancing wearability, social acceptance, input speed, and learnability.

• Proceedings of the Korea Society of Design Studies Conference
• /
• 2004.05a
• /
• pp.98-99
• /
• 2004

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.4
• /
• pp.123-134
• /
• 2004

In this paper a high speed architecture of the RC4 stream cipher is proposed and its FPGA implementation is presented. Compared to the conventional RC4 designs which have long initialization operation or use double or triple S-arrays to reduce latency delay due to S-array initialization phase, the proposed architecture for RC4 stream cipher eliminates the S-array initialization operation using 256-bit valid entry scheme and supports 40/128-bit key lengths with efficient modular arithmetic hardware. The proposed RC4 stream cipher is implemented using Xilinx XCV1000E-6H240C FPGA device. The designed RC4 stream cipher has about a throughput of 106 Mbits/sec at 40 MHz clock and thus can be applicable to WEP processor and RC4 key search processor.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.4
• /
• pp.51-57
• /
• 2003

The development of the communication network and the other network method can generate serious social problems. So, it is highly required to control security of network. These problems related security will be developed and keep up to confront with anti-security field such as hacking, cracking. The way to preserve security from hacker or cracker without developing new cryptographic algorithm is keeping the state of anti-cryptanalysis in a prescribed time by means of extending key-length. In this paper, we proposed M3 algorithm for the reduced processing time in the montgomery multiplication part. Proposed M3 algorithm using the matrix function M(.) and lookup table perform optionally montgomery multiplication with repeated operation. In this result, modified repeated operation part produce 30% processing rate than existed montgomery multiplicator. The proposed montgomery multiplication structured unit array method in carry generated part and variable length multiplication for eliminating bottle neck effect with the RSA cryptosystem. Therefore, this proposed montgomery multiplier enforce the real time processing and prevent outer cracking.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.200-202
• /
• 2008

본 논문은 터치스크린기반의 CE기기에서 한글을 효과적으로 입력하는 새로운 형태의 터치 GUI 기반 인터페이스를 제시한다. 제시된 한글입력방식인 심플키(SimpleKey)는 기존의 한글입력방식인 천지인, EZ한글, 모아키 등과는 다른 터치 제스처 기반 자음 중심의 7~12인치 터치스크린에 최적화된 방식이다. 심플키는 터치제스처와 누르는 세기 구분을 포함하고, 자음 중심 키배열에 모음 빈도 분석을 통한 제스처 매핑을 적용한 것을 특징으로 한다. 제안된 방식은 현재 8.9 인치 크기의 포터블 디바이스에 적용 구현하였으며 실사용자를 대상으로 사용성 평가를 통해 심플키의 효과성을 검증했다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.5
• /
• pp.15-20
• /
• 2023

Until now, Pollard's Rho algorithm has been known as the most efficient way for discrete algebraic problems to decrypt symmetric keys. However, the algorithm is being studied on how to further reduce the complexity of O(${\sqrt{p}}$) performance, along with the disadvantage of having to store the giant stride m=⌈${\sqrt{p}}$⌉ data. This paper proposes an array method for cycle detection in discrete logarithms. The proposed method reduces the number of updates of stack memory by at least 73%. This is done by only updating the array when (x_i<0.5x_i-1)∩(x_i<0.5(p-1)). The proposed array method undergoes the same number of modular calculation as stack method, but significantly reduces the number of updates and the execution time for array through the use of a binary search method.