• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.2
• /
• pp.327-338
• /
• 2018

On-line/off-line signature is a technique for performing heavy computations required for signature generation in the off-line stage and completing the final signature by a simple operation in the online stage. This is suitable for application environments that require immediate signing responses to multiple users. In this paper, we propose two new on-line/off-line signature schemes based on RSA problem. The first technique can generate a signature with a fixed base exponentiation when signing online, and the second technique can complete an online signature with a very simple calculation such as a hash operation. The security of both signatures is based on the RSA problem, which is proven to be tightly secure without security loss in the random oracle model.

• Journal of Satellite, Information and Communications
• /
• v.10 no.3
• /
• pp.114-120
• /
• 2015

In this paper, we show the design requirements of the cryptographic module and its security algorithm designed to prevent the exposure of the command signal applied to Flight Termination System. The cryptographic module consists of two separate devices that are Command Insertion Device and Command Generation Device. The cryptographic module designed to meet the 3 principles(Confidentiality, Integrity and Availability) for the information security. AES-256 block encryption algorithm and SHA-256 Hash function were applied to the encrypted symmetric key encryption method. The proposed cryptographic module is expected to contribute to the security and reliability of the Flight Termination System for Space Launch Vehicle.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.549-555
• /
• 2003

CA is cost-effective to generate pseudorandom patterns than LFSR. Based on the effectiveness of a CA based pseudorandom pattern generator, CA have been employed successfully in several applications. Especially Nongroup CA is applied to efficient hash function generation, cryptography and image compression. In this paper we analyze the properties of TPNCA and by using basic paths in the 0-tree of a linear TPNCA we analyze the structure of the state-transition graph. Also by showing the structure of the complemented CA which have the acyclic state of the 0-tree as the complement vector is isomorphic to the structure of the original TPNCA, we reduce the time in analyzing the CA-states.

• Journal of Korea Multimedia Society
• /
• v.7 no.12
• /
• pp.1719-1728
• /
• 2004

The fusion of Internet technology and applications with wireless communication provides a new business model and promises to extend the possibilities of commerce to what is popularly called mobile commerce, or m-commerce. In mobile Internet banking service through wireless local area network, security is a most important factor to consider. We describe the development of security service for mobile Internet banking on Personal Digital Assistants (PDAs). Banking Server and Authentication Server were developed to simulate banking business and to support certificate management of authorized clients, respectively. To increase security, we took hybrid approach in implementation: symmetric block encryption and public-key encryption. Hash function and random number generation were exploited to generate a secret key. The data regarding banking service were encrypted with symmetric block encryption, RC4, and the random number sequence was done with public-key encryption. PDAs communicate through IEEE 802.IIb wireless LAN (Local Area Network) to access banking service. Several banking services and graphic user interfaces, which emulatedthe services of real bank, were developed to verity the working of each security service in PDA, the Banking Server, and the Authentication Server.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.12
• /
• pp.597-602
• /
• 2002

The restructuring of power industry is still going on all over the world for last several decades. Many kinds of restructuring model have been studied, proposed, and applied. Among those models, power pool is more popular than other. This paper assumes the power pool market structure having competitive generation sector, and a new method is presented to build a bidding strategy in that market. The utilities participating in the market have the perfect information of their cost and price functions, but they don't know which strategy to be chosen by others. To define one's strategy as a vector, we make utility's cost/price functions into discrete step functions. An utility knows only his own strategy, so he estimates the other's cost/price functions into discrete step functions. An utility knows only his own strategy, so he estimates the other's strategy using Nash equilibrium or stochastic methods. And he also has to forecast the system demand. According to this forecasting result, his payoffs can be changed. Considering these all conditions, we formulate a bidding game problem and apply noncooperative game theory to that problem for the optimal strategy or solution. Some restrictive assumption are added for simplification of solving process. A numerical example is given in Case Study to show essential features and concrete results of this approach.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.1266-1269
• /
• 2007

IPv6 환경에서는 NDP(Neighbor Discovery Protocol)를 이용한 주소 자동 설정 메커니즘을 지원한다. 그러나, NDP 는 메시지 내 중요 정보가 네트워크 상에 그대로 노출됨으로 인해 각종 공격에 취약하다. 이러한 취약성을 극복하기 위해, CGA(Cryptographically Generated Address)를 사용하여 주소의 소유권 증명이 가능한 SEND(SEcure Neighbor Discovery)가 도입되었다. 그러나 SEND 는 높은 비용 연산으로 인해 모바일 기기 등에 적용하는데 한계점을 가진다. SEND 의 한계점을 보완하고자 해쉬 함수를 이용해 주소 자동 설정에 사용되는 임시 주소를 감추는 기법이 제안되었다. 이 기법은 DAD(Duplicate Address Detection) 과정 중 SEND 수준의 보안을 제공하면서도 빠르게 동작할 수 있는 장점을 갖는다. 본 논문에서는 리눅스 환경에서 제안 기법을 구현해 보고, 주소 생성 시간 측정 및 DAD 과정에서 드러난 서비스 거부 공격에 대한 안전성을 검증한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.19-21
• /
• 2005

현대의 산업화 사회에서는 자동인식을 통해서 사람과 사물을 식별하고자 하는 연구들이 진행되고 있다. 그 대표적인 예로 바코드를 이용한 접촉식 판별기술이 있고, 라디오 주파수를 이용한 RFID(Radio Frequency Identification) 기술을 들 수 있다. RFID의 경우는 무선 주파수를 이용하기 때문에 대량의 사물을 동시에 인식 할 수 있다는 장점이 있다. 하지만. 어떠한 상황에서 리더의 요청에 응답을 하는 리더-태그 시스템이기 때문에 사용자의 프라이버시 침해 문제를 야기 할 수 있다. 사용자의 프라이버시 침해문제를 막기 위해서 많은 연구들이 진행되고 있다. 그 중에서, Miyako Ohkubo의 Hash체인을 이용한 프라이버시 보호 기법은 정보유출, 위치추적공격(Location Tracking Attack), 전방위보안성(Forward Security)과 같은 프라이버시 침해문제들로부터 사용자의 프라이버시를 보호 할 수 있는 프로토콜이다. 그러나 Hash함수를 태그에 구현하는 것은 현재까지는 불가능한 상황이다. 또, Martin Feldhofer의 AES(Advanced Encryption Standard)를 사용한 프로토콜은 실제로 태그에 구현 가능하면서 내부구조가 8bit인 AES를 사용함으로써 암호학적인 강도를 높였으나, 프라이버시 침해 문제에서 단점을 드러냈다. 이러한 단점을 보완한 AES기반에서의 개선된 RFID 프라이버시 보호 프로토콜은 실제적으로 태그에 구현 가능한 AES를 이용한 암호화 체인을 통해서 프라이버시 보호에 우수하면서 실제 사용이 가능한 프로토콜을 제안하였다[1]. 그러나, 이 프로토콜은 생성되는 키 값들이 물리적 공격을 통해서 노출이 되었을 때, 이전의 seed값과 키 값들이 노출 되는 단점이 있다. 본 논문에서는 이러한 문제들을 해결하고자 프라이버시보호에 새로운 키 생성 방법을 통한 강력한 프로토콜을 제안 한다.하였으나 사료효율은 증진시켰으며, 후자(사양, 사료)와의 상호작용은 나타나지 않았다. 이상의 결과는 거세비육돈에서 1) androgen과 estrogen은 공히 자발적인 사료섭취와 등지방 침적을 억제하고 IGF-I 분비를 증가시키며, 2) 성선스테로이드호르몬의 이 같은 성장에 미치는 효과의 일부는 IGF-I을 통해 매개될 수도 있을을 시사한다. 약 $70 {\~} 90\%$의 phenoxyethanol이 유상에 존재하였다. 또한, 미생물에 대한 항균력도 phenoxyethanol이 수상에 많이 존재할수록 증가하는 경향을 나타내었다. 따라서, 제형 내 oil tomposition을 변화시킴으로써 phenoxyethanol의 사용량을 줄일 수 있을 뿐만 아니라, 피부 투과를 감소시켜 보다 피부 자극이 적은 저자극 방부시스템 개발이 가능하리라 보여 진다. 첨가하여 제조한 curd yoghurt는 저장성과 관능적인 면에서 우수한 상품적 가치가 인정되는 새로운 기능성 신제품의 개발에 기여할 수 있을 것으로 사료되었다. 여자의 경우 0.8이상이 되어서 심혈관계 질환의 위험 범위에 속하는 수준이었다. 삼두근의 두겹 두께는 남녀 각각 $20.2\pm8.58cm,\;22.2\pm4.40mm$으로 남녀간에 유의한 차이는 없었다. 조사대상자의 식습관 상태는 전체 대상자의 $84.4\%$가 대부분이 하루 세끼 식사를 규칙적으로 하고 있었으며 식사속도는 허겁지겁 빨리 섭취하는 경우가 남자는 $31.0\%$, 여자는 $21.4\%$로 나타났고 이들을 제외한 나머지 사람들은 보통 속도 혹은 충분한 시간을 가지고 식사를 하였다. 평소 식사량은 조금 적게 혹은 적당하게 섭취하는 사람이 대부분이었으며 남자가 여자보다는 배부르게 먹는 경 향이 유의적으로 높았다(p<0.05). 식사는 혼자 하는 경우가 남자

• The Journal of the Korea institute of electronic communication sciences
• /
• v.2 no.1
• /
• pp.19-24
• /
• 2007

Abstract. In the ubiquitous environment of the next generation, RFID is predicted to occupy an important technical location and also expected to apply to various fields. However, the properties of tags in itself which is the core of RFID have a dysfunction like an invasion of privacy for user. An existing cryptanalytic protection scheme of the information leakage have a difficult problem to apply to RFID tags for privacy protection. We applied Ohkubo et al.'s scheme to the protection of the tag's information efficiently in the RFID system environment using low-cost tags. But, this method has all informations of tagsto identify tag's ID and then performs the process of identification in sequence in the Back-end server. These processes have lots of computations so that it have problems about a scalability. In this paper, we are based on Ohkubo et al.'s scheme to solve problems, and then analyze the parallelism with the Hellman's tradeoff method, divide it into nodesin parallel. In this paper, we are based on Okubo et al.'s scheme to solve problems, and then analyze the parallelism with Hellman's tradeoff method, divide it into the ${\omega}$ node in parallel. as a result, we can reduce the computing complexity of key search to $O(\frac{m^{2/3}n^{2/3}}{\omega})$ seconds from O(mm) seconds. finally we show the results to be enhanced the scalability.

• Journal of Communications and Networks
• /
• v.17 no.5
• /
• pp.453-462
• /
• 2015

Body area networks (BANs) have emerged as an enabling technique for e-healthcare systems, which can be used to continuously and remotely monitor patients' health. In BANs, the data of a patient's vital body functions and movements can be collected by small wearable or implantable sensors and sent using shortrange wireless communication techniques. Due to the shared wireless medium between the sensors in BANs, it may be possible to have malicious attacks on e-healthcare systems. The security and privacy issues of BANs are becoming more and more important. To provide secure and correct association of a group of sensors with a patient and satisfy the requirements of data confidentiality and integrity in BANs, we propose a novel enhanced secure sensor association and key management protocol based on elliptic curve cryptography and hash chains. The authentication procedure and group key generation are very simple and efficient. Therefore, our protocol can be easily implemented in the power and resource constrained sensor nodes in BANs. From a comparison of results, furthermore, we can conclude that the proposed protocol dramatically reduces the computation and communication cost for the authentication and key derivation compared with previous protocols. We believe that our protocol is attractive in the application of BANs.

• Convergence Security Journal
• /
• v.15 no.5
• /
• pp.3-8
• /
• 2015

Most mobile cloud computing system use public key cryptography to provide data security and mutual authentication. A variant of traditional public key technologies called Identity-Based Cryptography(IBC) has recently received considerable attention. The certificate-free approach of IBC may well match the dynamic qualities of cloud environment. But, there is a need for a lightweight secure framework that provides security with minimum processing overhead on mobile devices. In this paper, we propose to use hierarchical ID-Based Encryption in mobile cloud computing. It is suitable for a mobile network since it can reduce the workload of root Public Key Generators by delegating the privilege of user authentication and private key generation. The Identity-Based Encryption and Identity-Based Signature are also proposed and an ID-Based Authentication scheme is presented to secure data processing. The proposed scheme is designed by one-way hash functions and XOR operations, thus has low computation costs for mobile users.