• 한국멀티미디어학회논문지
• /
• 제6권3호
• /
• pp.549-555
• /
• 2003

LFSR보다 CA가 랜덤성이 우수한 패턴들을 효율적으로 생성함이 알려지면서 그 응용분야가 점차적으로 확대되고 있다. 특히 Nongroup CA는 해쉬함수의 생성, 암호알고리즘, 이미지 압축 등에 응용되고 있다. 본 논문에서는 TPNCA의 성질들을 분석하고, 선형 TPNCA의 0-트리의 기본경로와 순환상태의 사이클 구조를 이용하여 선형 TPNCA의 상태 전이그래프의 정확한 구조를 파악하는데 사용되던 기존의 행렬의 곱셈 연산 방법을 덧셈 연산으로 대체할 수 있음을 보였다. 또한 선형 TPNCA C의 0-트리의 비순환 상태를 여원벡터로 갖는 여원 TPNCA C'은 C와 그 구조가 동형임을 밝힘으로써 선형 TPNCA로부터 여원 TPNCA의 상태들의 위치를 정확하게 파악하여, CA를 이용하는 알고리즘을 개발하는데 있어 선행되어야 하는 CA의 상태를 분석하는 시간을 효과적으로 줄였다.

• 한국군사과학기술학회지
• /
• 제17권3호
• /
• pp.358-363
• /
• 2014

In this paper, we present two constructions of the attribute-based broadcast encryption(ABBE) algorithm. Attribute-based encryption(ABE) algorithm enables an access control mechanism over encrypted data by specifying access policies among private keys and ciphertexts. ABBE algorithm can be used to construct ABE algorithm with revocation mechanism. Revocation has a useful property that revocation can be done without affecting any non-revoked uers. The main difference between our algorithm and the classical ones derived from the complete subtree paradigm which is apt for military hierarchy. Our algorithm improve the efficiency from the previously best ABBE algorithm, in particular, our algorithm allows one to select or revoke users by sending ciphertext of constant size with respect to the number of attributes and by storing logarithm secret key size of the number of users. Therefore, our algorithm can be an option to applications where computation cost is a top priority and can be applied to military technologies in the near future.

• 대한임베디드공학회논문지
• /
• 제14권6호
• /
• pp.313-319
• /
• 2019

Finite field operations have played an important role in error correcting codes and cryptosystems. Recently, the necessity of efficient computation processing is increasing for security in cyber physics systems. Therefore, efficient implementation of finite field arithmetics is more urgently needed. These operations include addition, multiplication, division and inversion. Addition is very simple and can be implemented with XOR operation. The others are somewhat more complicated than addition. Among these operations, multiplication is the most important, since time-consuming operations, such as exponentiation, division, and computing multiplicative inverse, can be performed through iterative multiplications. In this paper, we propose a multiplexer based parallel computation algorithm that performs Montgomery multiplication over finite field using redundant basis. Then we propose an efficient multiplexer based semi-systolic multiplier over finite field using redundant basis. The proposed multiplier has less area-time (AT) complexity than related multipliers. In detail, the AT complexity of the proposed multiplier is improved by approximately 19% and 65% compared to the multipliers of Kim-Han and Choi-Lee, respectively. Therefore, our multiplier is suitable for VLSI implementation and can be easily applied as the basic building block for various applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4661-4676
• /
• 2014

In Wireless Mesh Networks (WMN), an authentication technique can be compromised due to the distributed network architecture, the broadcast nature of the wireless medium and dynamic network topology. Several vulnerabilities exist in different protocols for WMNs. Hence, in this paper, we propose trust based authentication and key establishment for secure routing in WMN. Initially, a trust model is designed based on Ant Colony Optimization (ACO) to exchange the trust information among the nodes. The routing table is utilized to select the destination nodes, for which the link information is updated and the route verification is performed. Based on the trust model, mutual authentication is applied. When a node moves from one operator to another for accessing the router, inter-authentication will be performed. When a node moves within the operator for accessing the router, then intra-authentication will be performed. During authentication, keys are established using identity based cryptography technique. By simulation results, we show that the proposed technique enhances the packet delivery ratio and resilience with reduced drop and overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권8호
• /
• pp.2061-2080
• /
• 2013

Roaming authentication protocol is widely used in wireless network which can enable a seamless service for the mobile users. However, the classical approach requires the home server's participation during the authentication between the mobile user and the foreign server. So the more the roaming requests are performed the heavier burden will be on the home server. In this paper, we propose a new roaming authentication framework for wireless communication without the home server's participation. The new roaming authentication protocol in the new framework takes advantage of the ID-based cryptography and provides user anonymity. It has good performance compared with the roaming authentication protocols whose authentication do not need the home server's participation in terms of security and computation costs. Moreover, a new User-to-User authentication protocol in the new framework is also present. All the authentications proposed in this paper can be regarded as a common construction and can be applied to various kinds of wireless networks such as Cellular Networks, Wireless Mesh Networks and Vehicle Networks.

• ETRI Journal
• /
• 제38권6호
• /
• pp.1145-1152
• /
• 2016

Because the nodes in a wireless sensor network (WSN) are mobile and the network is highly dynamic, monitoring every node at all times is impractical. As a result, an intruder can attack the network easily, thus impairing the system. Hence, detecting anomalies in the network is very essential for handling efficient and safe communication. To overcome these issues, in this paper, we propose a rule-based anomaly detection technique using roaming honeypots. Initially, the honeypots are deployed in such a way that all nodes in the network are covered by at least one honeypot. Honeypots check every new connection by letting the centralized administrator collect the information regarding the new connection by slowing down the communication with the new node. Certain predefined rules are applied on the new node to make a decision regarding the anomality of the node. When the timer value of each honeypot expires, other sensor nodes are appointed as honeypots. Owing to this honeypot rotation, the intruder will not be able to track a honeypot to impair the network. Simulation results show that this technique can efficiently handle the anomaly detection in a WSN.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2019년도 춘계학술대회
• /
• pp.67-70
• /
• 2019

IT기술의 발전과 함께 대두된 블록체인 기술은 단순히 비트코인과 같이 디지털 통화와 연관된 기술로 알고만 있었지만, 최근 들어 보안에서 새로운 기술로 떠오르고 있다. 특히 모바일 환경의 보안에서도 생체인식기술과 블록체인이 연계된 연구가 다양하게 진행되고 있고 무선모바일환경의 IoT기반에서도 각 다양한 디바이스간의 블록체인 기반의 인증들이 제시되고 있다. 본 논문에서는 현재 진행되고 있는 블록체인 기술과 무선모바일 환경에 적용 사례와 보안요구사항을 분석하여 향후 블록체인 연구를 진행하는데 가이드라인을 잡고자 한다.

• 한국인터넷방송통신학회논문지
• /
• 제19권5호
• /
• pp.1-8
• /
• 2019

다양한 인터넷 장치들을 상호 연결하여 보다 지능적인 서비스를 제공하기 위한 사물인터넷(IoT)이 확산되고 있으며, 사물인터넷의 대표적 통신 프로토콜로 TCP 기반의 MQTT가 사용되고 있다. MQTT 기반의 IoT 장치 간 데이터 암호화 기술로 TCP의 경우 TLS/SSL 보안 프로토콜 사용을 권고하고 있지만, 저사양/저용량 IoT 장치에 적용할 경우 암복호화로 인한 성능 저하가 초래된다. 본 논문에서는 MQTT 프로토콜로 연결된 IoT 장치 간에 경량화 암호 알고리즘인 타원곡선암호를 적용한 종단간 메시지 보안 프로토콜을 제안하며, TLS/SSL과 제안 프로토콜에 대한 시뮬레이션을 통해 제안 프로토콜이 클라이언트와 서버 양측에서 성능이 향상됨을 검증하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4788-4813
• /
• 2019

In this paper, we introduce concepts of optimal and near optimal secret data hiding schemes. We present a new digital image steganography approach based on the Galois field $GF(p^m)$ using graph and automata to design the data hiding scheme of the general form ($k,N,{\lfloor}{\log}_2p^{mn}{\rfloor}$) for binary, gray and palette images with the given assumptions, where k, m, n, N are positive integers and p is prime, show the sufficient conditions for the existence and prove the existence of some optimal and near optimal secret data hiding schemes. These results are derived from the concept of the maximal secret data ratio of embedded bits, the module approach and the fastest optimal parity assignment method proposed by Huy et al. in 2011 and 2013. An application of the schemes to the process of hiding a finite sequence of secret data in an image is also considered. Security analyses and experimental results confirm that our approach can create steganographic schemes which achieve high efficiency in embedding capacity, visual quality, speed as well as security, which are key properties of steganography.

• 정보보호학회논문지
• /
• 제31권3호
• /
• pp.527-532
• /
• 2021

본 논문에서는 미국 NIST PQC 표준화 Final List 알고리즘 중 유일한 다변수이차방정식(multivariate quadratic equation) 기반의 전자 서명인 Rainbow 알고리즘에서의 효율적인 유한체 연산 방법을 제안한다. Chou 등은 최근 Rainbow를 Cortex-M4에서 구현하기 위한 새로운 효율적 구현 방법을 제시하였다. 본 논문은 Chou 등이 제안한 방법을 개선하여 기존 대비 XOR 연산의 숫자를 13.7% 이상 감소할 수 있는 새로운 곱셈 방법을 제안한다. 또한, 테이블 룩업(Table Lookup)으로 수행되던 상에서의 역원 연산을 4x4 행렬 역원으로 치환하여 연산하는 방법을 제시한다. 또한, 새로운 구현을 RaspberryPI 3B+상에서 구현하여 성능을 측정하였다.