• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2002.11a
• /
• pp.84-87
• /
• 2002

최근 정보보호의 중요성이 커짐에 따라 암호이론에 대한 관심이 증가되고 있다. 이 중 Galois 체 GF(2$^{m}$ )은 대부분의 암호시스템에서 사용되며, 특히 공개키 기반 암호시스템에서 주로 사용된다. 이들 암호시스템에서는 GF(2$^{m}$ )에서 정의된 연산, 즉 덧셈, 뺄셈, 곱셈 및 곱셈 역원 연산을 기반으로 구축되므로, 이들 연산을 고속으로 계산하는 것이 중요하다. 이들 연산 중에서 곱셈 역원이 가장 time-consuming하다. Fermat의 정리를 기반으로 하고, GF(2$^{m}$ )에서 정규기저를 사용해서 곱셈 역원을 고속으로 계산하기 위해서는 곱셈 횟수를 감소시키는 것이 가장 중요하며, 이와 관련된 방법들이 많이 제안되어 왔다. 이 중 Itoh와 Tsujii가 제안한 방법[2]은 곱셈 횟수를 O(log m)까지 감소시켰다. 본 논문에서는 Itoh와 Tsujii가 제안한 방법을 이용해서, m=2$^n$인 경우에 곱셈 역원을 고속으로 계산하는 방법을 제안한다. 본 논문의 방법은 필요한 곱셈 횟수가 Itoh와 Tsujii가 제안한 방법 보다 적으며, m-1의 분해가 기존의 방법보다 간단하다.

• The Mathematical Education
• /
• v.48 no.3
• /
• pp.353-358
• /
• 2009

The article discusses the independence concept occurring in the learning of probability. The author does not distinguishes the independence in the events from the independence in the trials. Instead, the author suggests the physico-empirical independence and the logico-mathematical independence to distinguish between the two concepts.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.3 s.345
• /
• pp.40-47
• /
• 2006

The finite-field multiplication can be applied to the elliptic curve cryptosystems. However, an efficient algorithm and the hardware design are required since the finite-field multiplication takes much time to compute. In this paper, we propose a radix-4 systolic multiplier on $GF(2^m)$ with comparative area and performance. The algorithm of the proposed standard-basis multiplier is mathematically developed to map on low-cost systolic cells, so that the proposed systolic architecture is suitable for VLSI design. Compared to the bit-parallel, bit-serial and systolic multipliers, the proposed multiplier has relatively effective high performance and low cost. We design and synthesis $GF(2^{193})$ finite-field multiplier using Hynix $0.35{\mu}m$ standard cell library and the maximum clock frequency is 400MHz.

• School Mathematics
• /
• v.12 no.3
• /
• pp.371-388
• /
• 2010

The goals of this study are to inquire middle school students' understanding about prime number and to propose pedagogical implications for school mathematics. Written questionnaire were given to 198 Korean seventh graders who had just finished learning about prime number and prime factorization and then 20 students participated in individual interviews for member checks. In defining prime and composite numbers, the students focused on distinguishing one from another by numbering of factors of agiven natural number. However, they hardly recognize the mathematical connection between prime and composite numbers related on the multiplicative structure of natural number. This study suggests that it is needed to emphasize the conceptual relationship between divisibility and prime decomposition and the prime numbers as the multiplicative building blocks of natural numbers based on the Fundamental Theorem of Arithmetic.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.324-329
• /
• 2003

The public-key cryptosystems such as Diffie-Hellman Key Distribution and Elliptical Curve Cryptosystems are built on the basis of the operations defined in GF(2$^{m}$ ):addition, subtraction, multiplication and multiplicative inversion. It is important that these operations should be computed at high speed in order to implement these cryptosystems efficiently. Among those operations, as being the most time-consuming, multiplicative inversion has become the object of lots of investigation Formant's theorem says $\beta$$^{-1}$ =$\beta$$^{2}$sup m/-2/, where $\beta$$^{-1}$ is the multiplicative inverse of $\beta$$\in$GF(2$^{m}$ ). Therefore, to compute the multiplicative inverse of arbitrary elements of GF(2$^{m}$ ), it is most important to reduce the number of times of multiplication by decomposing 2$^{m}$ -2 efficiently. Among many algorithms relevant to the subject, the algorithm proposed by Itoh and Tsujii[2] has reduced the required number of times of multiplication to O(log m) by using normal basis. Furthermore, a few papers have presented algorithms improving the Itoh and Tsujii's. However they have some demerits such as complicated decomposition processes[3,5]. In this paper, in the case of 2$^{m}$ -2, which is mainly used in practical applications, an efficient algorithm is proposed for computing the multiplicative inverse at high speed by using both the factorization formula x$^3$-y$^3$=(x-y)(x$^2$＋xy＋y$^2$) and normal basis. The number of times of multiplication of the algorithm is smaller than that of the algorithm proposed by Itoh and Tsujii. Also the algorithm decomposes 2$^{m}$ -2 more simply than other proposed algorithms.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.6
• /
• pp.29-39
• /
• 2007

RSA is one of the most popular public-key crypto-system in various applications. This paper addresses a high-speed RSA crypto-processor with modified radix-4 modular multiplication algorithm and Chinese Remainder Theorem(CRT) using Carry Save Adder(CSA). Our design takes 0.84M clock cycles for a 1024-bit modular exponentiation and 0.25M cycles for a 512-bit exponentiations. With 0.18um standard cell library, the processor achieves 365Kbps for a 1024-bit exponentiation and 1,233Kbps for two 512-bit exponentiations at a 300MHz clock rate.

• The Mathematical Education
• /
• v.47 no.3
• /
• pp.373-386
• /
• 2008

In highschool probability education, this study analyzed conflicts between intuitive concept and formal definition which originates from the process of establishing the concept of statistical independence. In judging independence, completely different types of problems requiring their own approach was analyzed by dividing them into two types. By doing so, this study researched a way to view independence as an overall idea. That is purposed to suggest a solution to a conflicts between intuitive concept and formal definition and to help not to judge independence out of wrong intuition. This study also suggests that calculation process which leads to precise perception of sample space and event be provided when we prove independence by expressing events with assembly symbols.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.5
• /
• pp.905-912
• /
• 2012

We are dealing with the Bayes' rule education tool with Excel Macro and its usage example. When an event occurs, we are interested in whether it does under certain conditions or not. In this case, we use the Bayes' rule to calculate the probability. Bayes' rule is very useful in making decision based on newly obtained statistical information. We introduce an efficient self-teaching educational tool developed to help the learners understand the Bayes' rule through intermediate steps and descriptions. The concept and examples of intermediate steps such as conditional probability, multiplication rule, law of total probability, prior probability and posterior probability could be acquired through step-by-step learning. All the processes leading to result are given with diagrams and detailed descriptions. By just clicking the execution button, users could get the results in one screen.

• Journal of Educational Research in Mathematics
• /
• v.19 no.2
• /
• pp.257-271
• /
• 2009

Stochastical independence is separated into two. One can be intuitively judged and the other is not. Independence is a concept based on assumption. However, It is defined as multiplication rule and it has produced extension of concept. Analysis on this issue is needed, assuming the cause is on the intersection sign which is used for both simultaneous events and compatible events. This study presented the extension process of independence concept in detail and constructed twofold interpretation of simultaneous events and compatible events which use the same sign $P(A\cap{B})$ with Pierce Semiotics.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.44 no.1
• /
• pp.59-66
• /
• 2007

In this paper, we consider the non-fragile robust guaranteed cost state feedback controllers design method for descriptor systems with parameter uncertainties and static state feedback controller with multiplicative uncertainty. The sufficient condition of controller existence, the design method of non-fragile robust guaranteed cost controller, the measure of non-fragility in controller, the upper bound of guaranteed cost performance measure to minimize the guaranteed cost are presented via LMI(linear matrix inequality) technique. Also, the sufficient condition can be rewritten as LMI form in terms of transformed variables through singular value decomposition, some changes of variables, and Schur complements. Therefore, the obtained non-fragile robust guaranteed cost controller satisfies the asymptotic stability and minimizes the guaranteed cost for the closed loop descriptor systems with parameter uncertainties and controller fragility. Finally, a numerical example is given to illustrate the design method.