• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.3
• /
• pp.11-25
• /
• 2011

The Miller algorithm is employed in the typical pairing computation such as Weil, Tate and Ate for implementing ID based cryptosystem. By analyzing the Mrabet's attack that is one of fault attacks against the Miller algorithm, this paper presents au efficient fault attack in Affine coordinate system, it is the most basic coordinates for construction of elliptic curve. The proposed attack is the effective model of a count check fault attack, it is verified to work well by practical fault injection experiments and can omit the probabilistic analysis that is required in the previous counter fault model.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.277-283
• /
• 2019

In this paper, we present a cube root algorithm using a recurrence relation. Additionally, we compare the implementations of the Pocklington and $Padr{\acute{o}}-S{\acute{a}}ez$ algorithm with the Adleman-Manders-Miller algorithm. With the recurrence relations, we improve the Pocklington and $Padr{\acute{o}}-S{\acute{a}}ez$ algorithm by using a smaller base for exponentiation. Our method can reduce the average number of ${\mathbb{F}}_q$ multiplications.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2003.12a
• /
• pp.299-306
• /
• 2003

본 논문에서는 현재 사용되고 있는 소수성 검정 알고리즘의 효율성을 비교하여 효과적인 알고리즘 사용에 관한 방향을 제시하려 한다. 현재 가장 일반적으로 사용하고 있는 Miller-Rabin 소수성검정법(Miller-Rabin primality test)에 대하여, Miller-Rabin 소수성 검정법 이외에 다른 확률적 소수성 검정법으로 제안된 Frobenius-Grantham 소수성 검정법(Frobenius-Grantham primality test) 이 있다. 그러나 합성수 판별에 대한 확률적 우세함에도 불구하고, Miller-Rabin 소수성 검정법을 대체하고 있지 못하는 이유는 시간복잡도(time complexity)가 Randomized polynomial time이기 때문에 같은 확률에 대한 평균 실행 속도가 Miller-Rabin 소수성 검정법보다 크게 효율적이지 못하기 때문이다. 또한, 2002년 Manindra Agrawal이 제시한 AKS 알고리즘(AKS algorithm)은 최초의 다항식 시간내 결정적 소수성 검정법(Polynomial time deterministic primality test)이지만, 시간 복잡도에서 다항식의 차수가 높기 때문에 현재 사용되고 있는 확률적 소수성 검정법(Probabilistic primality test)을 대체하지 못할 것으로 사료된다. 본 논문에서는 최근 발표된 소수성 검정법인 Frobenius-Grantham 소수성 검정법, AKS 알고리즘과 기존의 Miller-Rabin 소수성 검정법의 장단점을 비교·분석해 보고자 한다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.2
• /
• pp.70-79
• /
• 2013

Recently, there has been introduced various types of pairing computations to implement ID based cryptosystem for mobile ad hoc network. The Miller algorithm is the most popular algorithm for the typical pairing computation such as Weil, Tate and Ate. In this paper, we analyze the feasibility of concrete data fault injection attack, which was proposed by Whelan and Scott, in terms of regardless of round positions during the execution of the Miller algorithm. As the simulation results, the proposed attack that can be employed to regardless of round positions and coordinate systems is effective and powerful.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.3
• /
• pp.21-30
• /
• 2013

Powell-Miller theory is a good method to express or treat incorrect information. But it has limitation that requires too much time to apply to actual situation because computational complexity increases in exponential and functional way. Accordingly, there have been several attempts to reduce computational complexity but side effect followed - certainty factor fell. This study suggested expanded Approximation Algorithm. Expanded Approximation Algorithm is a method to consider both smallest supersets and largest subsets to expand basic space into a space including inverse set and to reduce Approximation error. By using expanded Approximation Algorithm suggested in the study, basic probability assignment function value of subsets was alloted and added to basic probability assignment function value of sets related to the subsets. This made subsets newly created become Approximation more efficiently. As a result, it could be known that certain function value which is based on basic probability assignment function is closely near actual optimal result. And certainty in correctness can be obtained while computational complexity could be reduced. by using Algorithm suggested in the study, exact information necessary for a system can be obtained.

• Proceeding of EDISON Challenge
• /
• 2015.03a
• /
• pp.6-13
• /
• 2015

이 연구는 초기 지구의 대기 환경에서 유기화합물(glycine)이 합성되는 실험(Urey-Miller 실험)에서의 반응 경로를 Deterministic한 방법의 중간체 sampling 방법으로 반응 네트워크를 구성하고 Yen's알고리즘으로 네트워크 내의 최단경로를 제시함으로써 반응물과 생성물이 결정되어 있을 때 최소한의 화학적 직관만을 이용하여 제시하는 것이 목표이다. 이 연구 결과는 2014년도 Nature Chemistry에 발표된 다른 방법론을 적용하여 제시된 Urey-Miller reaction path와 비교해 어떠한 반응이 상대적으로 더 타당한 경로를 제시했을지 알아보았다. 이 연구에서 나온 reaction path에서의 중간체들에 대해 GAMESS를 이용한 B3LYP/6-31g(d,p) DFT계산을 수행하였다. 결과를 분석해보면서 어떤 부분이 부족하며 이 연구에 적용한 방법론을 어떻게 발전시켜나가야 더 나은 결과를 얻을 수 있을지를 함께 고려해 보았다.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.6
• /
• pp.817-826
• /
• 2001

In this paper, the method of processing a blurred noisy signal has been researched. The conventional method of processing signal has faults which are slow-convergence speed and long time-consuming process at the singular point and in the ill condition. There is the process, the Gauss-Seidel's method to remove these faults, but it takes too much time because it processes signal repeatedly. For overcoming the faults, this paper shows a signal process method which takes shorter than the Tikhnov-Miller's by comparing the Tikhnov-Miller's with proposed algorithm and accelerating convergence speed at the singular point in the ill condition. In this paper, the conventional process method and proposed optimal algorithm were used to get a standard image (256 ＊ 256 ＊ 8bits),and then the results are simulated and compared each other in order to examine the variance of MSE ( Mean-Square Error ) by the acceleration parameter in the proposed two dimensional signal procedures. The result of the signal process and the processing time was measured at all change of acceleration parameter in order to verify the effectiveness of the proposed algorithm.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.7
• /
• pp.68-75
• /
• 2013

Recently, there has been introduced various types of pairing computations to implement ID based cryptosystem for mobile ad hoc network. According to spreading the applications of pairing computations, various fault attacks have been proposed. Among them, a counter fault attack has been considered the strongest threat. Thus this paper proposes a new countermeasure to prevent the counter fault attack on Miller's algorithm. The proposed method is able to reduce the possibility of fault propagation by a random index of intermediate values. Additionally, it is difficult to challenge fault attacks on the proposed method since a simple side channel leakage of 'if' branch is eliminated.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.3
• /
• pp.237-243
• /
• 1992

The large value of the snubber capacitor is needed to protect the devices in high voltage converters using series connected power semiconductors. But that results in more losses and longer commutation time. So, new technique of series connection is required, which can minimize the value of snubber capacitor and also promote the reliability of high voltage converters. We study on the switching characteristics of series connected power semiconductors and then propose a novel switching algorithm for series-connection which is able to implement not only the dynamic voltage balancing in spite of the differerce of switching characteristics, but the minimization of the value of snubber capacitor, through the change of the value of snubber capacitor by Miller effect. Finally, we illustrate the validity of this synchronization by computer simulation and experimental results.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.33 no.12
• /
• pp.33-38
• /
• 2005

The large deformation of inflatable membrane structure is numerically and experimentally considered in this paper. The numerical algorithm of wrinkling based on Miller and Hedgepeth membrane theory is developed using user material(UMAT) subroutine written by FORTRAN. Wrinkled area and deformed shapes of inflatable membrane structures are investigated by using ABAQUS with UMAT subroutine of wrinkling algorithm.