• Journal of the Korean Mathematical Society
• /
• v.58 no.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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.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.

• The Mathematical Education
• /
• v.50 no.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.

• School Mathematics
• /
• v.9 no.3
• /
• pp.427-445
• /
• 2007

This study presents the results of a case study that investigated a seventh grader's fractional reasoning related to multiplicative reasoning. In addition, by employing domain analysis and taxonomic analysis for analyzing qualitative data, I show how a qualitative methodology was used for the data collected by teaching experiment methodology. The study identifies three distinct issues that emerged as the student engaged in solving fraction problems: a view of fractions as operations vs. results, the issue of units, and mixed numbers vs. improper fractions. These three issues have instructional implications in that each of them is critical in developing multiplicative reasoning and investigating how they relate to each other suggests a way to improve multiplicative reasoning in fractional contexts.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.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
• /
• v.22 no.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.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.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.

• 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.

• The Mathematical Education
• /
• v.51 no.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.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.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.