• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.3
• /
• pp.533-543
• /
• 2018

In this paper, we propose an MILP-based method for Optimal Probability of Bit-based Differential Characteristic in SP(Substitution-permutation) ciphers based on Automatic Differential Characteristic Searching Method of Sasaki, et al. In [13], they used input/output variables and probability variables seperatably, but we simplify searching procedure by putting them(variables) together into linear inequalities. Also, In order to decrease the more linear inequalities, we choose Espresso algorithm among that used by Sasaki, et al(Quine-McCluskey algorithm & Espresso algorithm). Moreover, we apply our method to GIFT-64, GIFT-128, SKINNY-64, and we obtained results in the GIFT(Active S-boxs : 6, Probabilities : $2^{-11.415}$) compared with the existing one.(Active S-boxs : 5, Probabilities : unknown). In case of SKINNY-64, we can't find better result, but can find same result compared with the existing one.

• Advances in Computational Design
• /
• v.2 no.4
• /
• pp.313-331
• /
• 2017

In this study, teaching-learning based optimization (TLBO) is improved by incorporating model of multiple teachers, adaptive teaching factor, self-motivated learning, and learning through tutorial. Modified TLBO (MTLBO) is applied for simultaneous topology, shape, and size optimization of space and planar trusses to study its effectiveness. All the benchmark problems are subjected to stress, displacement, and kinematic stability constraints while design variables are discrete and continuous. Analyses of unacceptable and singular topologies are prohibited by seeing element connectivity through Grubler's criterion and the positive definiteness. Performance of MTLBO is compared to TLBO and state-of-the-art algorithms available in literature, such as a genetic algorithm (GA), improved GA, force method and GA, ant colony optimization, adaptive multi-population differential evolution, a firefly algorithm, group search optimization (GSO), improved GSO, and intelligent garbage can decision-making model evolution algorithm. It is observed that MTLBO has performed better or found nearly the same optimum solutions.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.2
• /
• pp.355-358
• /
• 2010

As CMOS technology continues to scale down, signal processing is favorably done in the digital domain, which requires Analog-to-Digital (A/D) Converter to be integrated on-chip. This paper presents a design methodology of 12-bit 1-MS/s Rail-to-Rail fully differential SAR ADC using Deep N-well Switch based on binary search algorithm. Proposed A/D Converter has the following architecture and techniques. Firstly, chip size and power consumption is reduced due to split capacitor array architecture and charge recycling method. Secondly, fully differential architecture is used to reduce noise between the digital part and converters. Finally, to reduce the mismatch effect and noise error, the circuit is designed to be available for Rail-to-Rail input range using simple Deep N-well switch. The A/D Converter fabricated in a TSMC 0.18um 1P6M CMOS technology and has a Signal-to-Noise-and-Distortion-Ratio(SNDR) of 69 dB and Free-Dynamic-Range (SFDR) of 73 dB. The occupied active area is $0.6mm^2$.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.4
• /
• pp.617-628
• /
• 2022

Ascon is one of the final round candidates of the NIST lightweight cryptography contest, which has been underway since 2015, and supports hash modes Ascon-Hash and Ascon-Xof. In this paper, we develop a MILP model for collision attack on the Ascon-Hash and search for a differential trail that can be used in a quantum setting through the model. In addition, we present an algorithm that allows an attacker who can use a quantum computer to find a quantum free-start collision attack of 3-round Ascon-Hash using the discovered differential trail. This attack is meaningful in that it is the first to analyze a collision attack on Ascon-Hash in a quantum setting.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.1A
• /
• pp.9-18
• /
• 2009

This paper introduces the application of DE (Differential Evolutionary) method for the estimation of tensile force of the externally prestressed tendon. The proposed technique, a SI (System Identification) method using the DE algorithm, can make global solution search possible as opposed to classical gradient-based optimization techniques. The numerical tests show that the proposed technique employing DE algorithm is a useful method which can detect the effective nominal diameters as well as estimate the exact tensile forces of the externally prestressed tendon with an estimation error less than 1% although there is no a priori information about the identification variables. In addition, the validity of the proposed technique is experimentally proved using a scale-down model test considering the serviceability state condition without and with the loss of the prestressed force. The test results prove that the technique is a feasible and effective method that can not only estimate the exact tensile forces and detect the effective nominal diameters but also inspect the damping properties of test model irrespective of the loss of the prestressed force. The 2% error of the estimated effective nominal diameter is due to the difference between the real tendon diameter with a wired section and the FE model diameter with a full-section. Finally, The accuracy and superiority of the proposed technique using the DE algorithm are verified through the comparative study with the existing theories.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.2
• /
• pp.141-146
• /
• 1999

In this paper, picture set filter is proposed for preserving compression ratio and video qualify. This filter controls the compression ratio of each frame depending on the correlation to the reference frame by selectively eliminating less important high-resolution areas. Consequently, video quality can be preserved and bit rate can be controlled adaptively. In the simulation, to test the performance of the proposed coding method, comparisons with the full search block matching algorithm and the differential image coding algorithm are made. In the former case, video quality, compression ratio and encoding time is improved. In the latter case, video quality is degraded, but compression ratio and encoding time is improved. Consequently. the proposed method shows a reasonably good performance over existing ones.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.3
• /
• pp.73-77
• /
• 1999

In this paper. wavelet transform coding for image conference is studied. Original video frames are transformed into hierarchical pyramidal images with multiresolution using the band property of wavelet transform coefficients. Moving information between neighboring frames is obtained from the low-resolution band. Also, to control the video coding procedure. a new picture set filter is proposed. This filter controls the compression ratio of each frame depending on the correlation to the reference frame by selectively eliminating less important high-resolution areas. Consequently. video quality can be preserved and bit rate can be controlled adaptively In the simulation, to test the performance of the proposed coding method, comparisons with the full search block matching algorithm and the differential image coding algorithm are made. Consequently. the proposed method shows a reasonably good performance over existing ones.

• Nuclear Engineering and Technology
• /
• v.54 no.10
• /
• pp.3864-3877
• /
• 2022

We propose a new approach called PESA (Prioritized replay Evolutionary and Swarm Algorithms) combining prioritized replay of reinforcement learning with hybrid evolutionary algorithms. PESA hybridizes different evolutionary and swarm algorithms such as particle swarm optimization, evolution strategies, simulated annealing, and differential evolution, with a modular approach to account for other algorithms. PESA hybridizes three algorithms by storing their solutions in a shared replay memory, then applying prioritized replay to redistribute data between the integral algorithms in frequent form based on their fitness and priority values, which significantly enhances sample diversity and algorithm exploration. Additionally, greedy replay is used implicitly to improve PESA exploitation close to the end of evolution. PESA features in balancing exploration and exploitation during search and the parallel computing result in an agnostic excellent performance over a wide range of experiments and problems presented in this work. PESA also shows very good scalability with number of processors in solving an expensive problem of optimizing nuclear fuel in nuclear power plants. PESA's competitive performance and modularity over all experiments allow it to join the family of evolutionary algorithms as a new hybrid algorithm; unleashing the power of parallel computing for expensive optimization.

• The Journal of the Society of Korean Medicine Diagnostics
• /
• v.17 no.2
• /
• pp.77-89
• /
• 2013

Objectives Tongue diagnosis is an important diagnostic method in traditional Eastern medicine, and it has a high potential to be used in the future healthcare because of easy, quick, and non-contact measuring features. Recently, research and development efforts on computerized tongue diagnosis systems (CTDS) have been active that led to the technical advancements in the field of photographing techniques, image extraction and classification algorithms. In this study, we analyzed the trends in the CTDS patents. Using the WIPS search engine (www.wipsglobal.com), quantitative and qualitative patent analyses were performed through Korea, China, Japan, U.S.A and Europe. Methods For a systematic search and data analysis, we defined patent categories based on the application area and technical details. By applying thus-obtained categorical key words, we obtained 360 relevant patents on photographing techniques, image extraction and classification algorithms for the purpose of diagnosis or security. Results As a result, companies related to image acquisition, medical imaging and mobile devices and research groups of universities in East Asia were major patent applicants. In all the five countries, the number of patents have been increasing since 1980. In particular, technology related to color correction and image segmentation were most actively patented categories, and expected to continue a high application rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5489-5511
• /
• 2019

The performance of evolutionary algorithms can be seriously weakened when constraints limit the feasible region of the search space. In this paper we present a constrained multi-objective optimization algorithm based on adaptive ε-truncation (ε-T-CMOA) to further improve distribution and convergence of the obtained solutions. First of all, as a novel constraint handling technique, ε-truncation technique keeps an effective balance between feasible solutions and infeasible solutions by permitting some excellent infeasible solutions with good objective value and low constraint violation to take part in the evolution, so diversity is improved, and convergence is also coordinated. Next, an exponential variation is introduced after differential mutation and crossover to boost the local exploitation ability. At last, the improved crowding density method only selects some Pareto solutions and near solutions to join in calculation, thus it can evaluate the distribution more accurately. The comparative results with other state-of-the-art algorithms show that ε-T-CMOA is more diverse than the other algorithms and it gains better in terms of convergence in some extent.