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

• School Mathematics
• /
• v.14 no.4
• /
• pp.445-468
• /
• 2012

This study is tried in order to link informal arithmetic reasoning to formal algebraic reasoning. In this study, we investigated elementary school student's non-formal algebraic reasoning used in algebraic problem solving. The result of we investigated algebraic reasoning of 839 students from grade 1 to 6 in two schools, Korea, we could recognize that they used various arithmetic reasoning and pre-formal algebraic reasoning which is the other than that is proposed in the text book in word problem solving related to the linear systems of equation. Reasoning strategies were diverse depending on structure of meaning and operational of problems. And we analyzed the cause of failure of reasoning in algebraic problem solving. Especially, 'quantitative reasoning', 'proportional reasoning' are turned into 'non-formal method of substitution' and 'non-formal method of addition and subtraction'. We discussed possibilities that we are able to connect these pre-formal algebraic reasoning to formal algebraic reasoning.

• 한국정보교육학회:학술대회논문집
• /
• 2011.01a
• /
• pp.241-246
• /
• 2011

There are many discussions nowadays about utilizing smartphones to create a mobile computing educational environment. The purpose of this study is to develope an application which addresses the growing importance of mental arithmetic maps in lower elementary grades. Considering current theories on developmental characteristics for the target levels I decided that a gesture based input interface increase the users concentration and interest. Students using this application will learn and reinforce the basics of the addition, subtraction, multiplication, and division of natural numbers. By removing the limitations of time and space as afforded by the convenience of a smartphone and utilizing a gesture based input interface we can combine an application which increases users mental arithmetic speed and precision with the enjoyment of a game.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.2
• /
• pp.15-21
• /
• 2008

This paper discuss the sequential digital logic systems and arithmetic operation algorithms which is the important material in computer architecture using analysis and synthesis which is based on extension logic for binary logic over galois fields. In sequential digital logic systems, we construct the moore model without feedback sequential logic systems after we obtain the next state function and output function using building block T-gate. Also, we obtain each algorithms of the addition, subtraction, multiplication, division based on the finite fields mathematical properties. Especially, in case of P=2 over GF($P^m$), the proposed algorithm have a advantage which will be able to apply traditional binary logic directly.The proposed method can construct more efficiency digital logic systems because it can be extended traditional binary logic to extension logic.

• Journal of Educational Research in Mathematics
• /
• v.21 no.3
• /
• pp.239-259
• /
• 2011

This study investigated the elementary school students' ability on the algebraic reasoning as generalized arithmetic. It analyzed the written responses from 648 second graders, 688 fourth graders, and 751 sixth graders using tests probing their understanding of the properties of whole number operations. The result of this study showed that many students did not recognize the properties of operations in the problem situations, and had difficulties in applying such properties to solve the problems. Even lower graders were quite successful in using the commutative law both in addition and subtraction. However they had difficulties in using the associative and the distributive law. These difficulties remained even for upper graders. As for the associative and the distributive law, students had more difficulties in solving the problems dealing with specific numbers than those of arbitrary numbers. Given these results, this paper includes issues and implications on how to foster early algebraic reasoning ability in the elementary school.

• The Mathematical Education
• /
• v.62 no.3
• /
• pp.341-362
• /
• 2023

This study analyzed student noticing in a lesson that emphasized relational understanding of equal signs for first graders from four aspects: centers of focus, focusing interactions, mathematical tasks, and nature of the mathematical activity. Specifically, the instructional factors that emphasize the relational understanding of equal signs derived from previous research were applied to a first-grade addition and subtraction unit, and then lessons emphasizing the relational understanding of equal signs were conducted. Students' noticing in this lesson was comprehensively analyzed using the focusing framework proposed in the previous study. The results showed that in real classroom contexts centers of focus is affected by the structure of the equation and the form of the task, teacher-student interactions, and normed practices. In particular, we found specific teacher-student interactions, such as emphasizing the meaning of the equals sign or using examples, that helped students recognize the equals sign relationally. We also found that students' noticing of the equation affects reasoning about equation, such as being able to reason about the equation relationally if they focuse on two quantities of the same size or the relationship between both sides. These findings have implications for teaching methods of equal sign.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.183-195
• /
• 2012

We propose a variable-latency Decimal Floating Point(DFP) adder which adopts the dual data path scheme. It is to speed addition and subtraction of operand that has identical exponents. The proposed DFP adder makes use of L. K. Wang's operand alignment algorithm, but operates through high speed data-path in guaranteed accuracy range. Synthesis results show that the area of the proposed DFP adder is increased by 8.26% compared to the L. K. Wang's DFP adder, though critical path delay is reduced by 10.54%. It also operates at 13.65% reduced path than critical path in case of an operation which has two DFP operands with identical exponents. We prove that the proposed DFP adder shows higher efficiency than L. K. Wang's DFP adder when the ratio of identical exponents is larger than 2%.

• Economic and Environmental Geology
• /
• v.26 no.3
• /
• pp.363-370
• /
• 1993

Various sizes of dolerite sills occur in the Mungyong area, one of well-exposed areas in Okchon belt. All of previous geochemical studies concluded that chemical variations of basic rocks, so-called Sangnae-ri amphibolite, result from the fractional crystallization. The second sill, which is a well differentiated one in the Sangnae-ri area, displays systematic compositional variation associated with gradual change of grain size in vertical sections. In order to clarify the chemical variation in the sill, whether chemical composition of each part of the sill is appropriately derived from the original liquid (represented by the average composition) by addition or subtraction of initial phenocystic minerals are tested(Iwamori program, 1989). According to the calculation, it is shown that major vertical chemical variation of the sill resulted from the accumulation of phenocrysts(olivine, clinopyrxoene, plagioclase, titanomagnetite) which already existed at the time of emplacement or formed just after the emplacement.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.73-81
• /
• 2011

In this paper, an improved block-based background modeling technique using adaptive parameter estimation that judiciously adjusts the number of model histograms at each frame sequence is proposed. The conventional block-based background modeling method has a fixed number of background model histograms, resulting to false negatives when the image sequence has either rapid illumination changes or swiftly moving objects, and to false positives with motionless objects. In addition, the number of optimal model histogram that changes each type of input image must have found manually. We demonstrate the proposed method is promising through representative performance evaluations including the background modeling in an elevator environment that may have situations with rapid illumination changes, moving objects, and motionless objects.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.6
• /
• pp.1083-1091
• /
• 2017

This paper describes a design of cryptographic processor supporting 224-bit elliptic curves over prime field defined by NIST. Scalar point multiplication that is a core arithmetic function in elliptic curve cryptography(ECC) was implemented by adopting the modified Montgomery ladder algorithm. In order to eliminate division operations that have high computational complexity, projective coordinate was used to implement point addition and point doubling operations, which uses addition, subtraction, multiplication and squaring operations over GF(p). The final result of the scalar point multiplication is converted to affine coordinate and the inverse operation is implemented using Fermat's little theorem. The ECC processor was verified by FPGA implementation using Virtex5 device. The ECC processor synthesized using a 0.18 um CMOS cell library occupies 2.7-Kbit RAM and 27,739 gate equivalents (GEs), and the estimated maximum clock frequency is 71 MHz. One scalar point multiplication takes 1,326,985 clock cycles resulting in the computation time of 18.7 msec at the maximum clock frequency.