• 대한수학회지
• /
• 제58권5호
• /
• pp.1239-1260
• /
• 2021

We study the set of star operations on local Noetherian domains D of dimension 1 such that the conductor (D : T) (where T is the integral closure of D) is equal to the maximal ideal of D. We reduce this problem to the study of a class of closure operations (more precisely, multiplicative operations) in a finite extension k ⊆ B, where k is a field, and then we study how the cardinality of this set of closures vary as the size of k varies while the structure of B remains fixed.

• 한국경영과학회지
• /
• 제31권3호
• /
• pp.97-105
• /
• 2006

Brand Pricing is the most important issue for the brand manager in the dynamic market. in the typical dynamic pricing model, a linear function has been used based on the assumption that the non-Price Influences and the price influences were independent. However, to incorporate the characteristics of the dynamic market, it is natural to consider the multiplicative relationship. We are going to try the multiplicative linkage between the non-price Influences and the price influences and suggest a new dynamic pricing model with e multiplicative functional form. An empirical study of 19 brands in the Korean cigarette market shows the feasibility of the suggested model.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제50권3호
• /
• pp.337-354
• /
• 2011

The purpose of the study was to investigate how students understand multiplication and division of fractions and how their understanding influences the solutions of fractional word problems. Thirteen students from 5th to 6th grades were involved in the study. Students' understanding of operations with fractions was categorized into "a part of the parts", "multiplicative comparison", "equal groups", "area of a rectangular", and "computational procedures of fractional multiplication (e.g., multiply the numerators and denominators separately)" for multiplications, and "sharing", "measuring", "multiplicative inverse", and "computational procedures of fractional division (e.g., multiply by the reciprocal)" for divisions. Most students understood multiplications as a situation of multiplicative comparison, and divisions as a situation of measuring. In addition, some students understood operations of fractions as computational procedures without associating these operations with the particular situations (e.g., equal groups, sharing). Most students tended to solve the word problems based on their semantic structure of these operations. Students with the same understanding of multiplication and division of fractions showed some commonalities during solving word problems. Particularly, some students who understood operations on fractions as computational procedures without assigning meanings could not solve word problems with fractions successfully compared to other students.

• 대한수학교육학회지:학교수학
• /
• 제9권3호
• /
• pp.427-445
• /
• 2007

이 논문은 7학년 학생의 곱셈추론과 관련된 분수추론을 연구한 사례연구이다. 이 논문은 또한 교수실험방법론에 의해 거둬진 질적 자료를 domain analysis와 taxonomic analysis라는 질적 분석법에 따라 분석함으로써 특정 질적 분석법들의 실제 적용사례를 자세히 보여준다. 자료 분석을 통해 세 가지 이슈가 부각되었다: 분수에 대한 시각 (조작으로써 대 결과물로써), 단위 문제, 대분수와 가분수의 관계이다. 그러한 이슈들은 첫째, 각 이슈들이 곱셈추론의 발달에 중요하며, 둘째 그 이슈들 사이의 관계가 분수추론을 통한 곱셈추론의 한 방법을 제시해 준다는 점에서 교육적인 의미를 갖는다.

• 정보보호학회논문지
• /
• 제13권2호
• /
• pp.127-132
• /
• 2003

Cryptosystems have received very much attention in recent years as importance of information security is increased. Most of Cryptosystems are defined over finite or Galois fields GF($2^m$) . In particular, the finite field GF($2^m$) is mainly used in public-key cryptosystems. These cryptosystems are constructed over finite field arithmetics, such as addition, subtraction, multiplication, and multiplicative inversion defined over GF($2^m$) . Hence, to implement these cryptosystems efficiently, it is important to carry out these operations defined over GF($2^m$) fast. Among these operations, since multiplicative inversion is much more time-consuming than other operations, it has become the object of lots of investigation. Recently, many methods for computing multiplicative inverses at hi호 speed has been proposed. These methods are based on format's theorem, and reduce the number of required multiplication using normal bases over GF($2^m$) . The method proposed by Itoh and Tsujii[2] among these methods reduced the required number of times of multiplication to O( log m) Also, some methods which improved the Itoh and Tsujii's method were proposed, but these methods have some problems such as complicated decomposition processes. In practical applications, m is frequently selected as a power of 2. In this parer, we propose a fast method for computing multiplicative inverses in GF($2^m$) , where m = ($2^n$) . Our method requires fewer ultiplications than the Itoh and Tsujii's method, and the decomposition process is simpler than other proposed methods.

• Management Science and Financial Engineering
• /
• 제22권1호
• /
• pp.1-4
• /
• 2016

We consider a two-tier supply chain with multiplicative random yield. We focus on the supply chain performance with respect to the control scheme of determining the production lot size. The profit loss due to distributed control is analyzed to give an insight for devising efficient supply contracts.

• 대한임베디드공학회논문지
• /
• 제12권1호
• /
• pp.11-18
• /
• 2017

Finite field arithmetic has been extensively used in error correcting codes and cryptography. Low-complexity and high-speed designs for finite field arithmetic are needed to meet the demands of wider bandwidth, better security and higher portability for personal communication device. In particular, cryptosystems in GF($2^m$) usually require computing exponentiation, division, and multiplicative inverse, which are very costly operations. These operations can be performed by computing modular AB multiplications or modular $AB^2$ multiplications. To compute these time-consuming operations, using $AB^2$ multiplications is more efficient than AB multiplications. Thus, there are needs for an efficient $AB^2$ multiplier architecture. In this paper, we propose a low latency Montgomery $AB^2$ multiplier using redundant representation over GF($2^m$). The proposed $AB^2$ multiplier has less space and time complexities compared to related multipliers. As compared to the corresponding existing structures, the proposed $AB^2$ multiplier saves at least 18% area, 50% time, and 59% area-time (AT) complexity. Accordingly, it is well suited for VLSI implementation and can be easily applied as a basic component for computing complex operations over finite field, such as exponentiation, division, and multiplicative inverse.

• 한국정보과학회논문지:시스템및이론
• /
• 제30권5_6호
• /
• pp.324-329
• /
• 2003

Diffie-Hellman 키분배 시스템과 타원곡선 암호시스템과 같은 공개키 기반 암호시스템은 GF(2$^{m}$ ) 상에서 정의된 연산, 즉 덧셈, 뺄셈, 곱셈 및 곱셈 역원 연산을 기반으로 구축되며, 이들 암호시스템을 효율적으로 구현하기 위해서는 위 연산들을 고속으로 계산하는 것이 중요하다. 그 중에서 곱셈 역원이 가장 time-consuming하여 많은 연구 대상이 되고 있다. Format 정리에 의해$\beta$$\in$GF(2$^{m}$ )의 곱셈 역원 $\beta$$^{-1}$은 $\beta$$^{-1}$=$\beta$$^{2}$sup m/-2/이므로 GF(2$^{m}$ )의 임의의 원소에 대해 곱셈 역원을 고속으로 계산하기 위해서는, 2$^{m}$ -2을 효율적으로 분해하여 곱셈 횟수를 감소시키는 것이 가장 중요하며, 이와 관련된 알고리즘들이 많이 제안되어 왔다 이 중 Itoh와 Tsujii가 제안한 알고리즘[2]은 정규기저를 사용해서 필요한 곱셈 횟수를 O(log m)까지 감소시켰으며, 또한 이 알고리즘을 향상시킨 몇몇 알고리즘들이 제안되었지만, 분해과정이 복잡하다는 등의 단점이 있다[3,5]. 본 논문에서는 실제 어플리케이션에서 주로 많이 사용되는 m=2$^{n}$ 인 경우에, 인수분해 공식 x$^3$-y$^3$=(x-y)(x$^2$＋xy＋y$^2$)와 정규기저론 이용해서 곱셈 역원을 고속으로 계산하는 알고리즘을 제안한다. 본 논문의 알고리즘은 곱셈 횟수가 Itoh와 Tsujii가 제안한 알고리즘 보다 적으며, 2$^{m}$ -2의 분해가 기존의 알고리즘 보다 간단하다.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제51권1호
• /
• pp.21-45
• /
• 2012

The purpose of the study was to investigate how students understand each operations with whole numbers and fractions, and the relationship between their knowledge of operations with whole numbers and conceptual understanding of operations on fractions. Researchers categorized students' understanding of operations with whole numbers and fractions based on their semantic structure of these operations, and analyzed the relationship between students' understanding of operations with whole numbers and fractions. As the results, some students who understood multiplications with whole numbers as only situations of "equal groups" did not properly conceptualize multiplications of fractions as they interpreted wrongly multiplying two fractions as adding two fractions. On the other hand, some students who understood multiplications with whole numbers as situations of "multiplicative comparison" appropriately conceptualize multiplications of fractions. They naturally constructed knowledge of fractions as they build on their prior knowledge of whole numbers compared to other students. In the case of division, we found that some students who understood divisions with whole numbers as only situations of "sharing" had difficulty in constructing division knowledge of fractions from previous division knowledge of whole numbers.

• 대한임베디드공학회논문지
• /
• 제14권6호
• /
• pp.313-319
• /
• 2019

Finite field operations have played an important role in error correcting codes and cryptosystems. Recently, the necessity of efficient computation processing is increasing for security in cyber physics systems. Therefore, efficient implementation of finite field arithmetics is more urgently needed. These operations include addition, multiplication, division and inversion. Addition is very simple and can be implemented with XOR operation. The others are somewhat more complicated than addition. Among these operations, multiplication is the most important, since time-consuming operations, such as exponentiation, division, and computing multiplicative inverse, can be performed through iterative multiplications. In this paper, we propose a multiplexer based parallel computation algorithm that performs Montgomery multiplication over finite field using redundant basis. Then we propose an efficient multiplexer based semi-systolic multiplier over finite field using redundant basis. The proposed multiplier has less area-time (AT) complexity than related multipliers. In detail, the AT complexity of the proposed multiplier is improved by approximately 19% and 65% compared to the multipliers of Kim-Han and Choi-Lee, respectively. Therefore, our multiplier is suitable for VLSI implementation and can be easily applied as the basic building block for various applications.