http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Design and Analysis of Efficient Parallel Hardware Prime Generators
Dong Kyue Kim,Piljoo Choi,Mun-Kyu Lee,Heejin Park 대한전자공학회 2016 Journal of semiconductor technology and science Vol.16 No.5
We present an efficient hardware prime generator that generates a prime p by combining trial division and Fermat test in parallel. Since the execution time of this parallel combination is greatly influenced by the number k of the smallest odd primes used in the trial division, it is important to determine the optimal k to create the fastest parallel combination. We present probabilistic analysis to determine the optimal k and to estimate the expected running time for the parallel combination. Our analysis is conducted in two stages. First, we roughly narrow the range of optimal k by using the expected values for the random variables used in the analysis. Second, we precisely determine the optimal k by using the exact probability distribution of the random variables. Our experiments show that the optimal k and the expected running time determined by our analysis are precise and accurate. Furthermore, we generalize our analysis and propose a guideline for a designer of a hardware prime generator to determine the optimal k by simply calculating the ratio of M to D, where M and D are the measured running times of a modular multiplication and an integer division, respectively.
A COMPUTATION MODEL FOR MODULAR EXPONENTIATION USING GRAPH REPRESENTATION
Dong Kyue Kim,Mun-Kyu Lee 한국멀티미디어학회 2006 한국멀티미디어학회 국제학술대회 Vol.2006 No.-
We propose a general framework to analyze the behavior of exponentiation and to find a short sequence of multiplications. Our basic idea is that an exponentiation can be represented by a graph, and the problem of finding a short multiplication sequence for an exponentiation is equivalent to the shortest path problem in its corresponding graph.
Design and Analysis of Efficient Parallel Hardware Prime Generators
Kim, Dong Kyue,Choi, Piljoo,Lee, Mun-Kyu,Park, Heejin The Institute of Electronics and Information Engin 2016 Journal of semiconductor technology and science Vol.16 No.5
We present an efficient hardware prime generator that generates a prime p by combining trial division and Fermat test in parallel. Since the execution time of this parallel combination is greatly influenced by the number k of the smallest odd primes used in the trial division, it is important to determine the optimal k to create the fastest parallel combination. We present probabilistic analysis to determine the optimal k and to estimate the expected running time for the parallel combination. Our analysis is conducted in two stages. First, we roughly narrow the range of optimal k by using the expected values for the random variables used in the analysis. Second, we precisely determine the optimal k by using the exact probability distribution of the random variables. Our experiments show that the optimal k and the expected running time determined by our analysis are precise and accurate. Furthermore, we generalize our analysis and propose a guideline for a designer of a hardware prime generator to determine the optimal k by simply calculating the ratio of M to D, where M and D are the measured running times of a modular multiplication and an integer division, respectively.
정수 문자집합상의 접미사트리 구축을 위한 새로운 합병알고리즘
김동규(Dong Kyue Kim),심정섭(Jeong Seop Sim),박근수(Kunsoo Park) 한국정보과학회 2002 정보과학회논문지 : 시스템 및 이론 Vol.29 No.1·2
주어진 스트링S 의 접미사트리T_S 를 구축하기 위하여, 먼저 홀수위치들에 대한 접미사트리 T_o 를 재귀적으로 구축하고, 짝수위치들에 대한 접미사트리T_e 를 T_o 로 부터 구축한 다음, T_o 와 T_e 를 합병하여 T_S 를 구축하는 새로운 방식이 사용되고 있다. 인덱스 자료구조에 관련된 문제들 중 정수 문자집합상의 접미사트리를 선형시간에 구축하는 문제는 오랫동안 미해결문제로 남아있었다. Farach은 이 방식을 적용하여 처음으로 선형시간이 소요되는 알고리즘을 제시하였다. 이 알고리즘 중 가장 어려운 곳은 합병하는 부분이다. 본 논문에서는 BFS(breadth-first search)에 기반한 새로운 합병알고리즘을 제안한다. 제안된 합병알고리즘은 Farach의 DFS(depth-first search) 방식보다 개념적으로 단순하게 동작하므로, 다른 응용으로 쉽게 확장될 수 있다. A new approach of constructing a suffix tree T_S for the given string S is to construct recursively a suffix tree T_o for odd positions, construct a suffix tree T_e for even positions from T_o , and then merge T_o and T_e into T_S . To construct suffix trees for integer alphabets in linear time had been a major open problem on index data structures. Farach used this approach and gave the first linear-time algorithm for integer alphabets. The hardest part of Farach's algorithm is the merging step. In this paper we present a new and simpler merging algorithm based on a coupled BFS (breadth-first search). Our merging algorithm is more intuitive than Farach's coupled DFS (depth-first search) merging, and thus it can be easily extended to other applications.
EFFICIENT OTP(ONE TIME PASSWORD) GENERATION USING AES-BASED MAC
Soon Dong Park,Seung Ho Cheong,Jung-Ki Min,Young-Hwan Kim,Dong Kyue Kim 한국멀티미디어학회 2007 한국멀티미디어학회 국제학술대회 Vol.2007 No.-
ID/password method is the most classical method among authentication techniques on the internet, and is performed more easily and successfully than other methods. However, it is a vulnerable method against attacks such as eavesdropping or replay attack. To overcome this problem. OTP technique is used. The most generally used OTP is HOTP algorithm which is based on one-way hash function SHA-l. As recent researches show the weakness of hash function, we need a new algorithm to replace HOTP. In this paper. a new OTP algorithm is proposed by using MAC(Massage Authentication Codes) which is based on AES block-encryption algorithm.
Efficient OTP(One Time Password) Generation using AES-based MAC
Park, Soon-Dong,Na, Joong-Chae,Kim, Young-Hwan,Kim, Dong-Kyue Korea Multimedia Society 2008 멀티미디어학회논문지 Vol.11 No.6
The ID/password method is the most classical method among authentication techniques on the internet, and is performed more easily and successfully than other methods. However, it is a vulnerable method against attacks such as eavesdropping or replay attack. To overcome this problem, OTP technique is used. The most popular OTP is HOTP algorithm, which is based on one-way hash function SHA-1. As recent researches show the weakness of the hash function, we need a new algorithm to replace HOTP. In this paper we propose a new OTP algorithm using the MAC(Message Authentication Code) based on AES. We also show that the new OTP outperforms HOTP experimentally.