• Journal of Electrical Engineering and Technology
• /
• v.8 no.6
• /
• pp.1605-1614
• /
• 2013

This paper presents a probabilistic methodology for small signal stability analysis of power system with correlated wind sources. The approach considers not only the stochastic characteristics of wind speeds which are treated as random variables with Weibull distributions, while also the wind speed spatial correlations which are characterized by a correlation matrix. The approach based on the 2m+1 point estimate method and Cornish Fisher expansion, the orthogonal transformation technique is used to deal with the correlation of wind farms. A case study is carried out on IEEE New England system and the probabilistic indexes for eigenvalue analysis are computed from the statistical processing of the obtained results. The accuracy and efficiency of the proposed method are confirmed by comparing with the results of Monte Carlo simulation. The numerical results indicate that the proposed method can actually capture the probabilistic characteristics of mode properties of the power systems with correlated wind sources and the consideration of spatial correlation has influence on the probability of system small signal stability.

• Journal of Communications and Networks
• /
• v.18 no.6
• /
• pp.902-912
• /
• 2016

Recent advances in energy harvesting (EH) technology have motivated the adoption of rechargeable mobile devices for communications. In this paper, we consider a point-to-point (P2P) wireless communication system in which an EH transmitter with a non-ideal rechargeable battery is required to send a given fixed number of bits to the receiver before they expire according to a preset delay constraint. Due to the possible energy loss in the storage process, the harvest-use-and-store (HUS) architecture is adopted. We characterize the properties of the optimal solutions, for additive white Gaussian channels (AWGNs) and then block-fading channels, that maximize the energy efficiency (i.e., battery residual) subject to a given rate requirement. Interestingly, it is shown that the optimal solution has a water-filling interpretation with double thresholds and that both thresholds are monotonic. Based on this, we investigate the optimal double-threshold based allocation policy and devise an algorithm to achieve the solution. Numerical results are provided to validate the theoretical analysis and to compare the optimal solutions with existing schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.7
• /
• pp.575-597
• /
• 1991

As an elegant solution of the key management scheme for a conventional cryptosystem. Diffie and Hellman introduced a public key distrbution system, whose security depends on the intractabliity of discrete loganthm problem over a finite field, and since then a lot of vartants of DH KDSS have been proposed. In this paper, we present the systematic approach to analyzing the security of a generalized DH KDS and designing an efficient and secure scheme. We classify vanous attacking methods and point out a possible way to avoid these attacks through the examples of successful attacking methods and point out a possible way to avoid these attacks through the examples of successful attack against those systems proposed so far or designed for this purpose. As security analysis tools, we present the redueiblity test, the information theoretic approach, and the protocol analysis technique, which we apply to variations of DH scheme to examine their security under all possble attacks.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.6
• /
• pp.107-112
• /
• 2003

Handover in IEEE 802.11 requires repeated authentication and key exchange procedures, which are an obstacle to seamless services of wireless LAM. We propose a fast authentication and key exchange mechanism using IEEE 802.11f. Especially, by proposing a modified version of the 4-way handshake of IEEE 802.11i, we solve the perfect forward secrecy problem that arises when the pre-authentication is adopted. The scheme can be implemented only using the Context Block of IEEE 802.11f and the 4-way handshake of IEEE 802.11i without involving authentications server's interaction or non-standard behavior between access points. Our scheme is applicable to devices not supporting the us-authentication of IEEE 802.11i and also, it can substitute the pre-authentication when the pre-authentication is failed.

• Steel and Composite Structures
• /
• v.38 no.5
• /
• pp.599-615
• /
• 2021

The ultimate strength behaviour of sandwich composite beams with J-hooks and normal weight concrete (SCSSBJNs) are studied through two-point loading tests on ten full-scale SCSSBJNs. The test results show that the SCSSBJN with different parameters under two-point loads exhibits three types of failure modes, i.e., flexure, shear, and combined shear and flexure mode. SCSSBJN failed in different failure modes exhibits different load-deflection behaviours, and the main difference of these three types of behaviours exist in their last working stages. The influences of thickness of steel faceplate, shear span ratio, concrete core strength, and spacing of J-hooks on structural behaviours of SCSSBJN are discussed and analysed. These test results show that the failure mode of SCSSBJN was sensitive to the thickness of steel faceplate, shear span ratio, and concrete core strength. Theoretical models are developed to estimate the cracking, yielding, and ultimate bending resistance of SCSSBJN as well as its transverse cross-sectional shear resistance. The validations of predictions by these theoretical models proved that they are capable of estimating strengths of novel SCSSBJNs.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.33 no.4
• /
• pp.591-599
• /
• 2023

Due to the recent attack by Castryck-Decru, the private key of SIDH can be recovered in polynomial time so several methods have been proposed to prevent the attack. Among them, M-SIDH proposed by Fouotsa et al, counteracts the attack by masking the torsion point information during the key exchange. In this paper, we implement M-SIDH and evaluate its performance. To the best of our knowledge, this is the first implementation of M-SIDH in C language. Toward that end, we propose a method to select parameters for M-SIDH instantiation and propose a 1024-bit prime for implementation. We implemented the square-root Velu formula over the extension field for further optimization. As a result, 1129 ms is required for a key exchange in the case of MSIDH-1024, providing the classic 64-bit security level.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.2
• /
• pp.353-360
• /
• 2017

The Internet of Things(IoT) security has more need than a technical problem as it needs series of regulations and faultless security system for common purposes. So, this study proposes an efficient key management in order that can be trusted IoT data in cloud computing. In contrast with a key distribution center of existing sensor networks, the proposed a federation key management of cloud proxy key server is not central point of administration and enables an active key recovery and update. The proposed key management is not a method of predetermined secret keys but sharing key information of a cloud proxy key server in autonomous cloud, which can reduce key generation and space complexity. In addition, In contrast with previous IoT key researches, a federation key of cloud proxy key server provides an extraction ability from meaningful information while moving data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.12
• /
• pp.1609-1617
• /
• 2019

Described in this paper is a design of hardware accelerator for implementing public-key cryptographic protocols (PKCPs) based on Elliptic Curve Cryptography (ECC) and RSA. It supports five elliptic curves (ECs) over GF(p) and three key lengths of RSA that are defined by NIST standard. It was designed to support four point operations over ECs and six modular arithmetic operations, making it suitable for hardware implementation of ECC- and RSA-based PKCPs. In order to achieve small-area implementation, a finite field arithmetic circuit was designed with 32-bit data-path, and it adopted word-based Montgomery multiplication algorithm, the Jacobian coordinate system for EC point operations, and the Fermat's little theorem for modular multiplicative inverse. The hardware operation was verified with FPGA device by implementing EC-DH key exchange protocol and RSA operations. It occupied 20,800 gate equivalents and 28 kbits of RAM at 50 MHz clock frequency with 180-nm CMOS cell library, and 1,503 slices and 2 BRAMs in Virtex-5 FPGA device.

• Nuclear Engineering and Technology
• /
• v.56 no.4
• /
• pp.1153-1164
• /
• 2024

In recent years, unmanned ground vehicles (UGVs) have been used to search for lost or stolen radioactive sources to avoid radiation exposure for operators. To achieve autonomous localization of radioactive sources, the UGVs must have the ability to automatically determine the next radiation measurement location instead of following a predefined path. Also, the radiation field of radioactive sources has to be reconstructed or inverted utilizing discrete measurements to obtain the radiation intensity distribution in the area of interest. In this study, we propose an effective source localization framework and method, in which UGVs are able to autonomously explore in the radiation area to determine the location of radioactive sources through an iterative process: path planning, radiation field reconstruction and estimation of source location. In the search process, the next radiation measurement point of the UGVs is fully predicted by the design path planning algorithm. After obtaining the measurement points and their radiation measurements, the radiation field of radioactive sources is reconstructed by the Gaussian process regression (GPR) model based on machine learning method. Based on the reconstructed radiation field, the locations of radioactive sources can be determined by the peak analysis method. The proposed method is verified through extensive simulation experiments, and the real source localization experiment on a Cs-137 point source shows that the proposed method can accurately locate the radioactive source with an error of approximately 0.30 m. The experimental results reveal the important practicality of our proposed method for source autonomous localization tasks.

• The Journal of Society for e-Business Studies
• /
• v.6 no.2
• /
• pp.159-166
• /
• 2001

EC(Electronic Commerce) is increasing with high speed based on the expansion of Internet. EC which is done through Internet has strong point like independence from time and space, On the contrary, it also has weak point like security problem because anybody can access easily to the system due to open network attribute of Internet. Therefore, we need the solutions that protect the security problem for safe and useful U activity, One of these solutions is the implementation of strong cipher algorithm. NPC(Non-Polynomial Complete) cipher algorithm proposed in this paper is good for the security and it overcome the limit of current 64bits cipher algorithm using 256bits key for input output and encryption key, Moreover, it is designed for the increase of calculation complexity and probability calculation by adapting more complex design for subkey generation regarded as one of important element effected to encryption.