• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.2 s.308
• /
• pp.1-11
• /
• 2006

In this paper, we propose a new register file architecture called the Register File Extension for Multi-words or Long-word Operation (RFEMLO) to accelerate both symmetric and asymmetric cryptographic algorithms. Based on the idea that most of cryptographic algorithms heavily use multi-words or long-word operations, RFEMLO allows multiple contiguous registers to be specified as a single operand. Thus, a single instruction can specify a SIMD-style multi-word operation or a long-word operation. RFEMLO can be applied to general purpose processors by adding instruction set for multi-words or long-word operands and functional units for additional instruction set. To evaluate the performance of RFEMLO, we use Simplescalar/ARM 3.0 (with gcc 2.95.2) and run detailed simulations on various symmetric and asymmetric cryptographic algorithms. By applying RFEMLO, we could get maximum 62% and 70% reductions in the total instruction count of symmetric and asymmetric cryptographic algorithms respectively. Also, performance results show that a speedup of 1.4 to 2.6 can be obtained in symmetric cryptographic algorithms and a speedup of 2.5 to 3.3 can be obtained for asymmetric cryptographic algorithms when we apply RFEMLO to a processor with an in-order pipeline. We also found that RFEMLO can effectively improve the performance of these cryptographic algorithms with much less cost compared to issue-width increase available in Superscalar implementations. Moreover, the RFEMLO can also be applied to Superscalar processor, leading to additional 83% and 138% performance gain in symmetric and asymmetric cryptographic algorithms.

• International Journal of Computer Science & Network Security
• /
• v.23 no.1
• /
• pp.164-168
• /
• 2023

As our community has become increasingly dependent on technology, security has become a bigger concern, which makes it more important and challenging than ever. security can be enhanced with encryption as described in this paper by combining RC6 symmetric cryptographic algorithms with RSA asymmetric algorithms, as well as the Vigenère cipher, to help manage weaknesses of RC6 algorithms by utilizing the speed, security, and effectiveness of asymmetric algorithms with the effectiveness of symmetric algorithm items as well as introducing classical algorithms, which add additional confusion to the decryption process. An analysis of the proposed encryption speed and throughput has been conducted in comparison to a variety of well-known algorithms to demonstrate the effectiveness of each algorithm.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.46-59
• /
• 2004

In this paper, we present two algorithms for efficiently aggregating link state information needed for quality-of-service (QoS) routing. In these algorithms, each edge node in a group is mapped onto a node of a shufflenet or a node of a de Bruijn graph. By this mapping, the number of links for which state information is maintained becomes aN (a is an integer, N is the number of edge nodes) which is significantly smaller than N2 in the full-mesh approach. Our algorithms also can support asymmetric link state parameters which are common in practice, while many previous algorithms such as the spanning tree approach can be applied only to networks with symmetric link state parameters. Experimental results show that the performance of our shufflenet algorithm is close to that of the full-mesh approach in terms of the accuracy of bandwidth and delay information, with only a much smaller amount of information. On the other hand, although it is not as good as the shufflenet approach, the de Bruijn algorithm also performs far better than the star approach which is one of the most widely accepted schemes. The de Bruijn algorithm needs smaller computational complexity than most previous algorithms for asymmetric networks, including the shufflenet algorithm.

• Journal of the Korean Statistical Society
• /
• v.34 no.1
• /
• pp.61-71
• /
• 2005

A class of asymmetric ARCH processes is proposed via binary random power transformations. This class accommodates traditional nonlinear models such as threshold ARCH (Rabemanjara and Zacoian (1993)) and Box-Cox type ARCH models(Higgins and Bera (1992)). Stationarity condition of the model is addressed. Iterative least squares(ILS) and pseudo maximum like-lihood(PML) methods are discussed for estimating parameters and related algorithms are presented. Illustrative analysis for Korea Stock Prices Index (KOSPI) data is conducted.

• International Journal of Computer Science & Network Security
• /
• v.21 no.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 Electrical Engineering and Technology
• /
• v.8 no.2
• /
• pp.316-325
• /
• 2013

Multilevel inverters produce a staircase output voltage from DC voltage sources. Requiring great number of semiconductor switches is main disadvantage of multilevel inverters. The multilevel inverters can be divided in two groups: symmetric and asymmetric converters. The asymmetric multilevel inverters provide a large number of output steps without increasing the number of DC voltage sources and components. In this paper, a novel topology for multilevel converters is proposed using cascaded sub-multilevel Cells. This sub-multilevel converters can produce five levels of voltage. Four algorithms for determining the DC voltage sources magnitudes have been presented. Finally, in order to verify the theoretical issues, simulation is presented.

• Nuclear Engineering and Technology
• /
• v.53 no.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.

• Current Optics and Photonics
• /
• v.5 no.5
• /
• pp.514-523
• /
• 2021

Methods for absolute depth estimation have received lots of interest, and most algorithms are concerned about how to minimize the difference between an input defocused image and an estimated defocused image. These approaches may increase the complexity of the algorithms to calculate the defocused image from the estimation of the focused image. In this paper, we present a new method to recover depth of scene based on a sharpness-assessment algorithm. The proposed algorithm estimates the depth of scene by calculating the sharpness of deconvolved images with a specific point-spread function (PSF). While most depth estimation studies evaluate depth of the scene only behind a focal plane, the proposed method evaluates a broad depth range both nearer and farther than the focal plane. This is accomplished using an asymmetric aperture, so the PSF at a position nearer than the focal plane is different from that at a position farther than the focal plane. From the image taken with a focal plane of 160 cm, the depth of object over the broad range from 60 to 350 cm is estimated at 10 cm resolution. With an asymmetric aperture, we demonstrate the feasibility of the sharpness-assessment algorithm to recover absolute depth of scene from a single defocused image.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.2
• /
• pp.130-145
• /
• 2004

This paper addresses the integrated problem of process planning and scheduling in FMS (Flexible Manufacturing System). The integration of process planning and scheduling is important for an efficient utilization of manufacturing resources. In this paper, a new method using an artificial intelligent search technique, called asymmetric multileveled symbiotic evolutionary algorithm, is presented to handle the two functions at the same time. Efficient genetic representations and operator schemes are considered. While designing the schemes, we take into account the features specific to each of process planning and scheduling problems. The performance of the proposed algorithm is compared with those of a traditional hierarchical approach and existing evolutionary algorithms. The experimental results show that the proposed algorithm outperforms the compared algorithms.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.518-518
• /
• 1996