• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.289-297
• /
• 2017

When implementing a hardware elliptic curve cryptosystem (ECC) module, the efficient design of Modular Inverse (MI) algorithm is especially important since it requires much more computation than other finite field operations in ECC. Among the MI algorithms, binary Right-Shift modular inverse (RS) algorithm has good performance when implemented in hardware, but Montgomery Modular Inverse (MMI) algorithm is not considered in [1, 2]. Since MMI has a similar structure to that of RS, we show that the area-improvement idea that is applied to RS is applicable to MMI, and that we can improve the speed of MMI. We designed area- and speed-improved MMI variants as hardware modules and analyzed their performance.

• International Journal of Contents
• /
• v.3 no.2
• /
• pp.40-43
• /
• 2007

This paper proposed a new modular inverse algorithm based on the right-shifting binary Euclidean algorithm. For an n-bit numbers, the number of operations for the proposed algorithm is reduced about 61.3% less than the classical binary extended Euclidean algorithm. The proposed algorithm implementation shows substantial reduction in computation time over Galois field GF(p).

• Journal of IKEEE
• /
• v.24 no.3
• /
• pp.901-908
• /
• 2020

This paper describes a method for scalable hardware implementation of modular inversion. The proposed scalable architecture has a one-dimensional array of processing elements (PEs) that perform arithmetic operations in 32-bit word, and its performance and hardware size can be adjusted depending on the number of PEs used. The hardware operation of the scalable processor for modular inversion was verified by implementing it on Spartan-6 FPGA device. As a result of logic synthesis with a 180-nm CMOS standard cells, the operating frequency was estimated to be in the range of 167 to 131 MHz and the gate counts were in the range of 60,000 to 91,000 gate equivalents when the number of PEs was in the range of 1 to 10. When calculating 256-bit modular inverse, the average performance was 18.7 to 118.2 Mbps, depending on the number of PEs in the range of 1 to 10. Since our scalable architecture for computing modular inversion in GF(p) has the trade-off relationship between performance and hardware complexity depending on the number of PEs used, it can be used to efficiently implement modular inversion processor optimized for performance and hardware complexity required by applications.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.243-246
• /
• 1996

Modular robot manipulator is a robotic system assembled from discrete joints and links into one of many possible manipulator configurations. This paper describes the design method of newly developed modular robot manipulator and the methodology of a task based reconfiguration of it. New locking mechanism is proposed and it provides quick coupling and decoupling. A parallel connection method is devised and it makes modular robot manipulator working well and the number of components on each module reduced. To automatically determine a sufficient or optimal arrangement of the modules for a given task, we also devise an algorithm that automatically generates forward and inverse manipulator kinematics, and we propose an algorithm which maps task specifications to the optimized manipulator configurations. Efficient genetic algorithms are generated and used to search for a optimal manipulator from task specifications. A few of design examples are shown.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.21 no.1
• /
• pp.49-57
• /
• 2016

A modular multilevel converter is widely adapted for a high-voltage direct current power transmission system. This study proposes a design methodology for a novel digital control that mitigates the negative effects caused by time delay, including communication transport delay for a modular multilevel converter. The modeling and negative effect of time delay are analyzed theoretically in a frequency domain, and its compensation methodology based on an inverse model is described fully with practical considerations. The proposed methodology is verified through several simulation results using a modular 21-level converter system.

• 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 the Korean Data and Information Science Society
• /
• v.25 no.6
• /
• pp.1467-1474
• /
• 2014

In this paper, we consider the two computer intensive methods for extended Euclidean algdrithm. Two methods we propose are C-programming based approach and Microsoft excel based method, respectively. Thses methods are applied to the derivation of greatest commnon devisor, multiplicative inverse for modular operation and the solution of diophantine equation. Concrete investigation for extended Euclidean algorithm with the computer intensive process is given. For the application of extended Euclidean algorithm, we consider the RSA encrytion method which is still popular recently.

• The Journal of Korea Robotics Society
• /
• v.15 no.2
• /
• pp.131-138
• /
• 2020

This paper proposes a low-cost robotic surgery system composed of a general purpose robotic arm, an interface for daVinci surgical robot tools and a modular haptic controller utilizing smart actuators. The 7 degree of freedom (DOF) haptic controller is suspended in the air using the gravity compensation, and the 3D position and orientation of the controller endpoint is calculated from the joint readings and the forward kinematics of the haptic controller. Then the joint angles for a general purpose robotic arm is calculated using the analytic inverse kinematics so that that the tooltip reaches the target position through a small incision. Finally, the surgical tool wrist joints angles are calculated to make the tooltip correctly face the desired orientation. The suggested system is implemented and validated using the physical UR5e robotic arm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10b
• /
• pp.264-268
• /
• 1987

This paper is concerned on kinematic analysis and simulation of an automatic feeding mechanism subjected by the motion of a curvilinear inverse can. The curvilinear cam is rotated by positioning a translating roller and the automatic feeding mechanism is moved to the sliding position by the motion of a campin fixed on the curvilinear cam. The curvilinear cam consists of two arcs of circles and two straight lines. The modular approach is used for the kinematic analysis of the feeding mechanism. As the first part of the paper for the motion simulation of the cam-feeding system, this paper discusses the algorithm to simulate the motion of the cam-feeding mechanism. The second part of the paper presents the state-of-art for the graphics-oriented CAD technique,

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.2
• /
• pp.461-479
• /
• 2021

This paper includes a general version of Bessel multipliers in Hilbert C∗-modules. In fact, by combining analysis, an operator on the standard Hilbert C∗-module and synthesis, we reach so-called generalized Bessel multipliers. Because of their importance for applications, we are interested to determine cases when generalized multipliers are invertible. We investigate some necessary or sufficient conditions for the invertibility of such operators and also we look at which perturbation of parameters preserve the invertibility of them. Subsequently, our attention is on how to express the inverse of an invertible generalized frame multiplier as a multiplier. In fact, we show that for all frames, the inverse of any invertible frame multiplier with an invertible symbol can always be represented as a multiplier with an invertible symbol and appropriate dual frames of the given ones.