• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.2181-2184
• /
• 2003

전자상거래, Single Sign On, 전자문서교환 등 웹 기반의 사이버 교환이 급증하는 오늘날 상대방의 신뢰를 보증해 줄 수 있는 수단으로 인증서의 사용이 필수적이다. 인증서는 인증기관을 신뢰한다는 가정에서 사용되기 때문에 통신개체 사이에서 보다 정확한 인증이 필요하다. 본 논문에서는 공개키 기반구조에서 인증서를 사용하는 모든 암호시스템 분야에 응용될 수 있는 인증 및 키 복구 메커니즘을 설계하였다. 서버와 사용자간에 인증서를 기반으로 공개키 암호에 의한 인증과 세션 암호 키 분배, 그리고 응용 자원서버들과의 비밀통신에서 암호 키의 유실을 고려한 키 복구 지원 프로토콜을 제안하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.163-165
• /
• 2005

유비쿼터스 환경이 도래하면서 언제, 어느 곳에서든 네트?을 사용하여 정당한 사용자임을 확인하고자 하는 요구가 증대하고 있다. 기존의 사용자 인증 방식은 인증기관으로부터 받은 인증서와 비밀키를 하드웨어 장치나 스마트카드 등의 보조 기억장치에 저장하여 휴대하고 다녀야 하는 번거로움이 있다. 또한 사용자의 비밀키를 키위탁 센터에 위탁하여 필요할 때 사용할 수 있도록 하고 있으나 여러 가지 위협으로부터 안전할 수 없는 상황이다. 본 논문에서는 이러한 휴대의 불편함과 여러 가지 위협으로부터 보호하고, 사용자가 언제 어디서든 인증을 제공받을 수 있는 동적 키생성 및 키복구 모듈을 제안한다.

• Journal of Internet Computing and Services
• /
• v.23 no.3
• /
• pp.21-33
• /
• 2022

This paper is to suggest the secure secret sharing system in order to outstandingly reduce the damage caused by the leakage of the corporate secret. This research system is suggested as efficient P2P distributed system kept from the centrally controlled server scheme. Even the bitcoin circulation system is also based on P2P distribution scheme recenly. This research has designed the secure circulation of the secret shares produced by Threshold Shamir Secret Sharing scheme instead of the shares specified in the torrent file using the simple, highly scalable and fast transferring torrent P2P distribution structure and its protocol. In addition, this research has studied to apply both Shamir Threshold Secret Sharing scheme and the securely strong multiple user authentication based on Collaborative Threshold Autentication scheme. The secure transmission of secret data is protected as using the efficient symmetric encryption with the session secret key which is safely exchanged by the public key encryption. Also it is safer against the leakage because the secret key is effectively alive only for short lifetime like a session. Especially the characteristics of this proposed system is effectively to apply the threshold secret sharing scheme into efficient torrent P2P distributed system without modifying its architecture of the torrent system. In addition, this system guaranttes the confidentiality in distributing the secret file using the efficient symmetric encryption scheme, which the session key is securely exchanged using the public key encryption scheme. In this system, the devices to be taken out can be dynamically registered as an user. This scalability allows to apply the confidentiality and the authentication even to dynamically registerred users.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1608-1616
• /
• 2015

This paper describes an efficient hardware implementation of lightweight encryption algorithm LEA-128/192/256 which supports for three master key lengths of 128/192/256-bit. To achieve area-efficient and low-power implementation of LEA crypto- processor, the key scheduler block is optimized to share hardware resources for encryption/decryption key scheduling of three master key lengths. In addition, a parallel register structure and novel operating scheme for key scheduler is devised to reduce clock cycles required for key scheduling, which results in an increase of encryption/decryption speed by 20~30%. The designed LEA crypto-processor has been verified by FPGA implementation. The estimated performances according to master key lengths of 128/192/256-bit are 181/162/109 Mbps, respectively, at 113 MHz clock frequency.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.5
• /
• pp.1071-1078
• /
• 2018

Recently, a family of lightweight block ciphers CHAM that has effective performance on resource-constrained devices is proposed. The CHAM uses a stateless-on-the-fly key schedule method which can reduce the key storage areas. Furthermore, the core design of CHAM is based on ARX(Addition, Rotation and XOR) operations which can enhance the computational performance. Nevertheless, we point out that the CHAM algorithm may be vulnerable to the fault injection attack which can reveal 4 round keys and derive the secret key from them. As a simulation result, the proposed fault injection attack can extract the secret key of CHAM-128/128 block cipher using about 24 correct-faulty cipher text pairs.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.5
• /
• pp.73-78
• /
• 2011

The DES encryption algorithm employed in information security has a strong avalanche effect, and the processing speed to encrypt is also fast. However, due to the H/W advances, the secret key length of DES having 56bits is not enough so that it is easily exposed to brute force attack. In this paper, we present a new method to significantly increase the secret key length in the DES by integration of digital holography and DES algorithm. In addition, we evaluate the encryption performance of the proposed method by measuring the avalanche effect and verify the possibility of it.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.2225-2228
• /
• 2003

인터넷의 급격한 발달로 전자상거래가 우리 생활의 중요한 한 부분을 차지하게 되었다. 이런 전자상거래에서 중요한 한 요소인 기존 디지털 서명 방식에는 몇 가지 문제점을 가지고 있다. 그중 하나가 악의적인 수신자나 제삼자의 디지털 서명의 재사용 문제점이며, 다른 하나가 서명자의 비밀키 분실 문제이다. 다른 문제점으로 수신자가 서명자의 키가 변경된 후 변경전의 디지털 서명의 검증을 시도하는 경우 검증이 불가능한 문제가 발생한다. 이러한 문제들을 해결할 수 있는 새로운 디지털 서명 방식 및 절차를 제안한다. 이 새로운 디지털 방식은 RSA와 EIGamal 암호방식을 통합한 것으로 하나의 비밀키의 이에 대응되는 두 개의 공개키를 갖는 구조이다.

• Proceedings of the Optical Society of Korea Conference
• /
• 2009.10a
• /
• pp.127-128
• /
• 2009

• Journal of KIISE
• /
• v.44 no.6
• /
• pp.637-642
• /
• 2017

Honey Encryption (HE) is a technique to overcome the weakness of a brute-force attack of the existing password-based encryption (PBE). By outputting a plausible plaintext even if the wrong key is entered, it provides message recovery security which an attacker can tolerate even if the attacker tries a brute-force attack against a small entropy secret key. However, application of a cipher that requires encryption padding to the HE present a bigger problem than the conventional PBE method. In this paper, we apply a typical block cipher (AES-128) and a stream cipher (A5 / 1) to verify the problem of padding through the analysis of the sentence frequency and we propose a safe operation method of the HE.

• Journal of Industrial Convergence
• /
• v.18 no.5
• /
• pp.23-29
• /
• 2020

The Internet of things (IoT) is the extension of Internet connectivity into various devices and everyday objects. Embedded with electronics, Internet connectivity and other forms of hardware. The IoT poses significant risk to the entire digital ecosystem. This is because so many of these devices are designed without a built-in security system to keep them from being hijacked by hackers. This paper proposed a mutual authentication protocol for IoT Devices using symmetric-key algorithm. The proposed protocol use symmetric key cryptographic algorithm to securely encrypt data on radio channel. In addition, the secret key used for encryption is random number of devices that improves security by using variable secret keys. The proposed protocol blocked attacker and enabled legal deives to communicate because only authenticated devices transmit data by a mutual authentication protocol. Finally, our scheme is safe for attacks such as eavesdropping attack, location tracking, replay attack, spoofing attack and denial of service attack and we confirmed the safety by attack scenario.