• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 한국통신학회 1984년도 춘계학술발표회논문집
• /
• pp.13-17
• /
• 1984

A hybrid version of the Hadamard and center Line Symmetric Haar Transform called H-CLSH is defined and developed. Efficient algorithms for fast computation of the H-CLSH and its inverse are developed. The H-CLSH is applied to digital signal and image processing and its utility and image processing and its utility and effectiveness are compared with Hadamard-Haar discrete transforms on the basis of some standard performance criteria.

• International Journal of Computer Science & Network Security
• /
• 제21권9호
• /
• pp.41-50
• /
• 2021

Cloud computing is one of the most expanding technologies nowadays; it offers many benefits that make it more cost-effective and more reliable in the business. This paper highlights the various benefits of cloud computing and discusses different cryptography algorithms being used to secure communications in cloud computing environments. Moreover, this thesis aims to propose some improvements to enhance the security and safety of cloud computing technologies.

• Journal of Power Electronics
• /
• 제15권4호
• /
• pp.951-963
• /
• 2015

In this paper, a new symmetric multilevel inverter is proposed. A simple structure for the cascaded multilevel inverter topology is also proposed, which produces a high number of levels with the application of few power electronic devices. The symmetric multilevel inverter can generate 2n+1 levels with a reduced number of power switches. The basic unit is composed of a single and double source unit (SDS-unit). The application of this SDS-unit is for reducing the number of power electronic components like insulated gate bipolar transistors, freewheeling diodes, gate driver circuits, dc voltage sources, and blocked voltages by switches. Various new algorithms are recommended to determine the magnitude of dc sources in a cascaded structure. Furthermore, the proposed topology is optimized for different goals. The proposed cascaded structure is compared with other similar topologies. For verifying the performance of the proposed basic symmetric and cascaded structure, results from a computer-based MATLAB/Simulink simulation and from experimental hardware are also discussed.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제19권2호
• /
• pp.23-30
• /
• 2009

Recently, rotation symmetric Boolean functions have attracted attention since they are suitable for fast evaluation and show good cryptographic properties. For example, important problems in coding theory were settled by searching the desired functions in the rotation symmetric function space. Moreover, they are applied to designing fast hashing algorithms. On the other hand, for some homogeneous rotation symmetric quadratic functions of simple structure, the exact formulas for their Hamming weights and nonlinearity were found[2,8]. Very recently, more formulations were carried out for much broader class of the functions[6]. In this paper, we make a further improvement by deriving the formula for the Hamming weight of quadratic rotation symmetric functions containing linear terms.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.743-746
• /
• 2000

In this paper we propose a new network called Dynamic network for symmetric block ciphers. Dynamic cipher has the property that the key-size, the number of round, and the plaintext-size are scalable simultaneously We present the method for designing secure Dynamic cipher against meet-in-the-middle attack and linear cryptanalysis. Also, we show that the differential cryptanalysis to Dynamic cipher is hard.

• Journal of Korea Society of Digital Industry and Information Management
• /
• 제9권2호
• /
• pp.111-119
• /
• 2013

Face recognition has recently become one of the most popular research areas in the fields of computer vision, machine learning, and pattern recognition because it spans numerous applications, such as access control, surveillance, security, credit-card verification, and criminal identification. In this paper, we propose a simple descriptor called an ECSP(Extended Center-Symmetric Pattern) for illumination-robust face recognition. The ECSP operator encodes the texture information of a local face region by emphasizing diagonal components of a previous CS-LBP(Center-Symmetric Local Binary Pattern). Here, the diagonal components are emphasized because facial textures along the diagonal direction contain much more information than those of other directions. The facial texture information of the ECSP operator is then used as the input image of an image covariance-based feature extraction algorithm such as 2D-PCA(Two-Dimensional Principal Component Analysis). Performance evaluation of the proposed approach was carried out using various binary pattern operators and recognition algorithms on the Yale B database. The experimental results demonstrated that the proposed approach achieved better recognition accuracy than other approaches, and we confirmed that the proposed approach is effective against illumination variation.

• KIEE International Transactions on Electrophysics and Applications
• /
• 제3C권5호
• /
• pp.199-206
• /
• 2003

Numerical solutions to complex characteristic equations are quite often required to solve electromagnetic wave problems. In general, two traditional complex root search algorithms, the Newton-Raphson method and the Muller method, are used to produce such solutions. However, when utilizing these two methods, the choice of the initial iteration value is very sensitive, otherwise, the iteration can fail to converge into a solution. Thus, as an alternative approach, where the selection of the initial iteration value is more relaxed and the computation speed is high, Davidenko's method is used to determine accurate complex propagation constants for leaky circular symmetric modes in circular dielectric rod waveguides. Based on a precise determination of the complex propagation constants, the leaky mode characteristics of several lower-order circular symmetric modes are then numerically analyzed. In addition, no modification of the characteristic equation is required for the application of Davidenko's method.

• Nuclear Engineering and Technology
• /
• 제53권2호
• /
• pp.357-367
• /
• 2021

In general, common cause failures (CCFs) have been modeled with the assumption that components within the same group are symmetric. This assumption reduces the number of parameters required for the CCF probability estimation and allows us to use a parametric model, such as the alpha factor model. Although there are various asymmetric conditions in nuclear power plants (NPPs) to be addressed, the traditional CCF models are limited to symmetric conditions. Therefore, this paper proposes the copulabased CCF model to deal with asymmetric as well as symmetric CCFs. Once a joint distribution between the components is constructed using copulas, the proposed model is able to provide the probability of common cause basic events (CCBEs) by formulating a system of equations without symmetry assumptions. In addition, Bayesian inferences for the parameters of the marginal and copula distributions are introduced and Markov Chain Monte Carlo (MCMC) algorithms are employed to sample from the posterior distribution. Three example cases using simulated data, including asymmetry conditions in total failure probabilities and/or dependencies, are illustrated. Consequently, the copula-based CCF model provides appropriate estimates of CCFs for asymmetric conditions. This paper also discusses the limitations and notes on the proposed method.

• Journal of information and communication convergence engineering
• /
• 제13권2호
• /
• pp.113-122
• /
• 2015

Feature subset selection is as a pre-processing step in learning algorithms. In this paper, we propose an efficient algorithm, ModifiedFAST, for feature subset selection. This algorithm is suitable for text datasets, and uses the concept of information gain to remove irrelevant and redundant features. A new optimal value of the threshold for symmetric uncertainty, used to identify relevant features, is found. The thresholds used by previous feature selection algorithms such as FAST, Relief, and CFS were not optimal. It has been proven that the threshold value greatly affects the percentage of selected features and the classification accuracy. A new performance unified metric that combines accuracy and the number of features selected has been proposed and applied in the proposed algorithm. It was experimentally shown that the percentage of selected features obtained by the proposed algorithm was lower than that obtained using existing algorithms in most of the datasets. The effectiveness of our algorithm on the optimal threshold was statistically validated with other algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국정보통신학회 2017년도 추계학술대회
• /
• pp.578-580
• /
• 2017

IoT technology poses a lot of security threats. Various algorithms are thus employed in ensuring security of transactions between IoT devices. Advanced Encryption Standard (AES) has gained huge popularity among many other symmetric key algorithms due to its robustness till date. This paper presents a hardware based implementation of the AES algorithm. We present a four-stage pipelined architecture of the encryption and key generation. This method allowed a total plain text size of 512 bits to be encrypted in 46 cycles. The proposed hardware design achieved a maximum frequency of 1.18GHz yielding a throughput of 13Gbps and 800MHz yielding a throughput of 8.9Gbps on the 65nm and 180nm processes respectively.