• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.816-819
• /
• 2005

In Java virtual machine which is the running environment of Java programs, almost every bytecode execution requires data transfers in memory. Data transfer incurs energy consumption and hence minimizing the transfer operation is very important for improving the energy efficiency of JVM. As the number of data transfers for a Java iterative statement is directly proportional to the iteration count, improving the energy efficiency of iterative statement is crucial to keep the energy efficiency of JVM high. This paper analyzes Java iterative statement at bytecode level and proposes some points how to improve the energy efficiency.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.145-152
• /
• 2010

In this paper, we first propose a fast division algorithm in GF($2^{163}$) using standard basis representation, and then it is mapped into divider for GF($2^{163}$) with iterative hardware structure. The proposed algorithm is based on the binary ExtendedGCD algorithm, and the arithmetic operations for modular reduction are performed within only one "while-statement" unlike conventional approach which uses two "while-statement". In this paper, we use reduction polynomial $f(x)=x^{163}+x^7+x^6+x^3+1$ that is recommended in SEC2(Standards for Efficient Cryptography) using standard basis representation, where degree m = 163. We also have implemented the proposed iterative architecture in FPGA using Verilog HDL, and it operates at a clock frequency of 85 MHz on Xilinx-VirtexII XC2V8000 FPGA device. From implementation results, we will show that computation speed of the proposed scheme is significantly improved than the existing two approaches.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.439-445
• /
• 2012

Since an attacker can extract secret key of cryptographic device by occurring an error during encryption operation, the fault injection attack have become a serious threat in cryptographic system. In this paper, we show that an attacker can retrieve the 128-bits secret key in AES implementation adopted iterative statement for round operations using fault injection attack. To verify the feasibility of our attack, we implement the AES algorithm on ATmega128 microcontroller and try to inject a fault using laser beam. As a result, we can extract 128-bits secret key by obtaining just two pairs of correct and faulty ciphertexts.

• Journal of applied mathematics & informatics
• /
• v.5 no.1
• /
• pp.73-90
• /
• 1998

In this paper we introduce and study a number of new classes of quasi variational inequalities. using essentially the projection technique and its variant forms we prove that the gen-eralized set-valued mixed quasivariational inequalities are equivalent to the fixed point problem and the Wiener-Hopf equations(normal maps). This equivalence enables us to suggest a number of iterative algorithms solving the generalized variational inequalities. As a special case of the generalized set-valued mixed quasi variational in-equalities we obtain a class of quasi variational inequalities studied by Siddiqi Husain and Kazmi [35] but there are several inaccuracies in their formulation of the problem the statement and the proofs of the problem the statement and the proofs of their results. We have removed these inaccuracies. The correct formulation of thir results can be obtained as special cases from our main results.

• Journal of the Korean Mathematical Society
• /
• v.59 no.5
• /
• pp.1015-1045
• /
• 2022

Zagier introduced the term "strange identity" to describe an asymptotic relation between a certain q-hypergeometric series and a partial theta function at roots of unity. We show that behind Zagier's strange identity lies a statement about Bailey pairs. Using the iterative machinery of Bailey pairs then leads to many families of multisum strange identities, including Hikami's generalization of Zagier's identity.

• Journal of the military operations research society of Korea
• /
• v.14 no.1
• /
• pp.42-52
• /
• 1988

Many programmers start debugging by reading the faulty program from start to bottom without investigating carefully the erroneous program. Expert programmers, however, trace backward from a particular variable in a specific statement to identify all possible sources of influence on the value of variable (program slice). Weiser proposed a slicing algorithm (method) that is complex, iterative and still in modification [3,4]. This paper presents a method to generate a program slice by use of matrix computation which represents all possible slices of the program. The matrix representation of a program is soundly based on the graph theory of data dependency.

• Journal of the military operations research society of Korea
• /
• v.13 no.2
• /
• pp.42-52
• /
• 1987

Many programmers start debugging by reading the faulty program from start to bottom without investigating carefully the erroneous program. Expert programmers, however, trace backward from a particular variable in a specific statement to identify all possible sources of influence on the value of variable (program slice). Weiser proposed a slicing algorithm (method) that is complex, iterative and still in modification [3,4]. This paper presents a method to generate a program slice by use of matrix computation which represents all possible slices of the program. The matrix representation of a program is soundly based on the graph theory of data dependency.

• Structural Engineering and Mechanics
• /
• v.45 no.2
• /
• pp.169-182
• /
• 2013

The mechanical behavior of rectangular foundation plates with perimetric beams and internal stiffening beams of the plate is herein analyzed, taking the foundation design into account. A series of dimensionless parameters related to the geometry of the studied elements were defined. In order to generalize the problem statement, an initial settlements was considered. A numeric procedure was developed for the resolution by means of the Finite Differences Method that takes into account the stiffness of the plate, the perimetric and internal plate beams and the soil reaction module. Iterative algorithms were employed which, for each of the analyzed cases, made it possible to find displacements and reaction percentages taken by the plate and those that discharge directly into the perimetric beams, practically without affecting the plate. To enhance its mechanical behavior the internal stiffening beams were prestressed and the results obtained with and without prestressing were compared. This analysis was made considering the load conditions and the soil reaction module constant.

• Structural Engineering and Mechanics
• /
• v.52 no.5
• /
• pp.1051-1067
• /
• 2014

The structures of concern in this study are subject to two types of forces: dead loads from the acceleration imposed on the structures as well as the installed operation machines and the additional adjustable forces. We wish to determine the critical values of the adjustable forces when buckling of the structures occurs. The mathematical statement of such a problem gives rise to a constrained eigenvalue problem (CEVP) in which the dominant eigenvalue is subject to an equality constraint. A numerical algorithm for solving the CEVP is proposed in which an iterative method is employed to identify an interval embracing the target eigenvalue. The algorithm is applied to four engineering application examples finding the critical loads of a fixed-free beam subject to its own body force, two plane structures and one wide-flange beam using shell elements when acceleration force is present. The accuracy is demonstrated using the first example whose classical solution exists. The significance of the equality constraint in the EVP is shown by comparing the solutions without the constraint on the eigenvalue. Effectiveness and accuracy of the numerical algorithm are presented.