• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.2
• /
• pp.35-44
• /
• 2002

In this paper, an implementation method of RSA exponentiator based on Radix-$2^k$ modular multiplication algorithm is presented and verified. We use Booth receding algorithm to implement Radix-$2^k$ modular multiplication and implement radix-16 modular multiplier using 2K-byte memory and CSA(carry-save adder) array - with two full adder and three half adder delays. For high speed final addition we use a reduced carry generation and propagation scheme called pseudo carry look-ahead adder. Furthermore, the optimum value of the radix is presented through the trade-off between the operating frequency and the throughput for given Silicon technology. We have verified 1,024-bit RSA processor using Altera FPGA EP2K1500E device and Samsung 0.3$\mu\textrm{m}$ technology. In case of the radix-16 modular multiplication algorithm, (n+4+1)/4 clock cycles are needed and the 1,024-bit modular exponentiation is performed in 5.38ms at 50MHz.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.4
• /
• pp.409-415
• /
• 2003

Recently, the modular learning are very popular and receive much attention for pattern classification. The modular learning method based on the "divide and conquer" strategy can not only solve the complex problems, but also reach a better result than a single classifier′s on the learning quality and speed. In the neural network area, some researches that take the modular learning approach also have been made to improve classification performance. In this paper, we propose a simple modular neural network for characters recognition of vehicle number plate and evaluate its performance on the clustering methods of feature vectors used in constructing subnetworks. We implement two clustering method, one is grouping similar feature vectors by K-means clustering algorithm, the other grouping unsimilar feature vectors by our proposed algorithm. The experiment result shows that our algorithm achieves much better performance.

• Journal of Korea Multimedia Society
• /
• v.6 no.4
• /
• pp.610-619
• /
• 2003

This paper presents a concept of cellular automata and a modular exponentiation algorithm and implementation of a basic EIGamal encryption by using cellular automata. Nowadays most of modular exponentiation algorithms are implemented by a linear feedback shift register(LFSR), but its structure has disadvantage which is difficult to implement an operation scheme when the basis is changed frequently The proposed algorithm based on a cellular automata in this paper can overcome this shortcomings, and can be effectively applied to the modular exponentiation algorithm by using the characteristic of the parallelism and flexibility of cellular automata. We also propose a new fast multiplier algorithm using the normal basis representation. A new multiplier algorithm based on normal basis is quite fast than the conventional algorithms using standard basis. This application is also applicable to construct operational structures such as multiplication, exponentiation and inversion algorithm for EIGamal cryptosystem.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.7
• /
• pp.17-27
• /
• 2011

In recent years, the interest and research for Future Internet are rapidly increasing. In domestic, MOFI (Mobile Oriented Future Internet) is proposed as one architecture of Future Internet. MOFI is a data transmission architecture which provides a mobility, name-based communication and routing scalability. In this paper we implement a basic MOFI testbed that supports HID-based communication, and verify the feasibility of HID-based communication through experimentation of general service such as PING and WWW service. We used "VirtualBox" as a virtual machine and implement a packet processing and a HCP header addition and translation function using "Click Modular Router".

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.336-343
• /
• 2022

Industrial robotic arms are widely adopted in numerous industries for manufacturing automation under factory settings, which eliminates the limitations of manual labor and provides significant productivity and quality benefits. The U.S. modular construction industry, despite having similar controlled factory environments, still heavily relies on manual labor. Thus, this study investigates the U.S., Canada, and Europe-based leading modular construction companies and research labs implementing industrial robotic arms for manufacturing automation. The investigation mainly considered the current research scope, industry state, and constraints, as well as identifying the types and specifications of the robotic arms in use. First, the study investigated well-recognized modular building associations, the Modular Building Institute (MBI), and renowned architecture design magazine, Dezeen to gather industry updates. The authors discovered one university lab and a few companies that adopted Switzerland-based robotic arms, ABB. Researching ABB robotics led to the discovery of ABB's competitor, Germany-based KUKA robotic arms. Consequently, research extended to the companies and labs adopting KUKA models. In total, this study has identified seven modular companies and four research labs. All companies employed robotic arms and gantry robot combinations in a production-line-like system for partial automation, and some adopted design standardization for optimization. The common goal among the labs was to achieve greater flexibility and full automation with robotic arms. This study will help companies better implement robotic arm automation by providing recommendations from investigating its current industry status.

• 한국신재생에너지학회:학술대회논문집
• /
• 2005.06a
• /
• pp.9-12
• /
• 2005

In this paper. we offer a new monitoring system that controls all of the windfar. it can also apply use general wind turbine systems and real meteorological tower. We propose a hierarchical releiable monitoring system connected by wireless communication channels between monitoring host computer and modular slave measuring subsystems. Our system has two hierarchical subsystems: slave measuring systems, and supervisory host computer. We design and implement that the slave measuring subsystems is placed in meteorological tower and wind turbines, and the supervisory host computer in safety zone, The micro-controller in slave measuring system is duplicated using cold-standby method for reliability. The host computer and slave system constructs a feedback system, with wireless communication channel between them. For monitoring and command function, the supervisory computer is implemented with a Personal Computer using graphic user interface. Consequently. we can get a reliable but economic system.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.2
• /
• pp.35-44
• /
• 1998

This paper describes multiple fault diagnosis method in complex system with hierarchical structure. Complex system is divided into subsystem, item and component. For diagnosing this hierarchical complex system, it is necessary to implement special neural network. We introduced Modular Artificial Neural Network(MANN) for this purpose. MANN consists of four level neural network, first level for symptom classification, second level for item fault diagnosis, third level for component symptom classification, forth level for component fault diagnosis. Each network is multi layer perceptron with 7 inputs, 30 hidden node and 7 outputs trained by backpropagation. UNIX IPC(Inter Process Communication) is used for implementing MANN with multitasking and message transfer between processes in SUN workstation. We tested MANN in reactor system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1C
• /
• pp.87-92
• /
• 2006

An $AB^2$ modular operation is an efficient basic operation for the public key cryptosystems and various systolic architectures for $AB^2$ modular operation have been proposed. However, these architectures have a shortcoming for cryptographic applications due to their high area complexity. Accordingly, this paper presents an partitioned $AB^2$ systolic modular multiplier over GF($2^m$). A dependency graph from the MSB $AB^2$ modular multiplication algorithm is partitioned into 1/3 to get an partitioned $AB^2$ systolic multiplier. The multiplier reduces the area complexity about 2/3 compared with the previous multiplier. The multiplier could be used as a basic building block to implement the modular exponentiation for the public key cryptosystems based on smartcard which has a restricted hardware requirements.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.5
• /
• pp.95-105
• /
• 2002

This paper describes an efficient method to implement a hardware circuit of RSA public key cryptographic algorithm, which is important to public-key cryptographic system for an authentication, a key exchange and a digital signature. The RSA algorithm needs a modular exponential for its cryptographic operation, and the modular exponential operation is consists of repeated modular multiplication. In a numerous algorithm to compute a modular multiplication, the Montgomery algorithm is one of the most widely used algorithms for its conspicuous efficiency on hardware implementation. Over the past a few decades a considerable number of studies have been conducted on the efficient hardware design of modular multiplication for RSA cryptographic system. But many of those studies focused on the decrease of operating time for its higher performance. The most important thing to design a hardware circuit, which has a limit on a circuit area, is a trade off between a small circuit area and a feasible operating time. For these reasons, we modified the Montgomery algorithm for its efficient hardware structure for a system having a limit in its circuit area and implemented the refined algorithm in the IESA system developed for ETRI's smart card emulating system.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.17 no.3
• /
• pp.425-437
• /
• 2017

For efficient hardware (HW) implementation of elliptic curve cryptography (ECC), various sub-modules for the underlying finite field operations should be implemented efficiently. Among these sub-modules, modular inversion (MI) requires the most computation; therefore, its performance might be a dominant factor of the overall performance of an ECC module. To determine the most efficient MI algorithm for an HW ECC module, we implement various classes of MI algorithms and analyze their performance. In contrast to the common belief in previous research, our results show that the right-shift binary inversion (RS) algorithm performs well when implemented in hardware. In addition, we present optimization methods to reduce the area overhead and improve the speed of the RS algorithm. By applying these methods, we propose a new RS-variant that is both fast and compact. The proposed MI module is more than twice as fast as the other two classes of MI: shifting Euclidean (SE) and left-shift binary inversion (LS) algorithms. It consumes only 15% more area and even 5% less area than SE and LS, respectively. Finally, we show that how our new method can be applied to optimize an HW ECC module.