• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.87-93
• /
• 2014

For n/m=qm+r, there is no simple divisibility rule for simple m=7 such that is the n multiply by m? This problem can be more complex for two or more digits of m. The Dunkels method has been known for generalized divisibility test method, but this method can not compute very large digits number that can not processed by computer. This paper suggests simple and exact divisibility method for m completely irrelevant n and m of digits. The proposed method sets $r_1=n_1n_2{\cdots}n_l(mod m)$ for $n=n_1n_2n_3{\cdots}n_k$, $m=m_1m_2{\cdots}m_l$. Then this method computes $r_i=r_{i-1}{\times}10+n_i(mod m)$, $i=2,3,{\cdots}k-l+1$ and reduces the digits of n one-by-one. The proposed method can be get the quotient and remainder with easy, fast and correct for various n,m experimental data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.751-762
• /
• 2004

In this paper, we propose the method to derive new GRM(Generalized Reed-Muller) coefficients for each 2$^n$ polarities using Triangle cell. As the existing methods to generate GRM coefficients, there are Green's method to operate transform matrix with a given RM coefficient and Besslich's method to get other polarities using basic transfer matrices repeatedly. In this paper, Triangle cell is defined so as to obtain GRM coefficients efficiently. After arranging 2$^n$ given RM coefficients of a first row of Triangle cell, sequence modulo sum is peformed in parallel to low column by a fixed numerical formula. To prove the efficiency of proposed arithmetic method, it is compared with Besslich’s method. As the compared result, to calculate GRM coefficients of all polarities to n input variables, Besslich’s method needs 2$^n$$^{-1}$ ${\times}$(2$^n$-1) two-input Ex-ORs and the proposed method needs 2${\times}$(the number of Ex-ORs for n-1 variables)+3$^n$$^{-1}$ for the same system complexity - (lo $g_2$$^n$) $T_{X}$./.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.4
• /
• pp.123-129
• /
• 2013

The performance and practicality of cryptosystem for encryption, decryption, and primality test are primarily determined by the implementation efficiency of the modular exponentiation of $a^b$ (mod m). To compute $a^b$ (mod m), the standard binary squaring (square-and-multiply) still seems to be the best choice. However, in large b bits, the preprocessed n-ary, ($n{\geq}2$ method could be more efficient than binary squaring method. This paper proposes a square-and-divide and unpreprocessed n-ary square-and-divide modular exponentiation method. Results confirmed that the square-and-divide method is the most efficient of trial number in a case where the value of b is adjacent to $2^k+2^{k-1}$ or to. $2^{k+1}$. It was also proved that for b out of the beforementioned range, the unpreprocessed n-ary square-and-divide method yields higher efficiency of trial number than the general preprocessed n-ary method.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.8
• /
• pp.103-108
• /
• 2011

Generally, Miller-Rabin method has been the most popular primality test. This method arbitrary selects m at k-times from m=[2, n-1] range and (m,n)=1. Miller-Rabin method performs $k{\times}r$ times and reports prime as $m^d\;{\equiv}\;1(mod\;n)$ or $m^{2^rd}\;{\equiv}\;-1(mod n)$ such that n-1=$2^sd$, $0\;{\leq}\;r\;{\leq}\;s-1$. This paper suggests more simple primality test than Miller-Rabin method. This test method computes c=$p^{\frac{n-1}{2}}(mod\;n)$ for k times and reports prime as c=-1. The proposed primality test method reduces $k{\times}r$ times of Miller-Rabin method to k times.

• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2001.11a
• /
• pp.112-119
• /
• 2001

Parameter tuning methods by Ziegler-Nickels for control systems are generally classified into Z-N(1) and Z-N(2). The purpose of this paper is to describe what relations exist between methods of Z-N(1) and Z-N(2), or how Z-N(1) method can be originated from Z-N(2) method by analyzing one loop control system of P or PI controller and time delay process. The formulas of Z-N(1) consist of process parameters, L(time delay), $K_m$(gain) and $T_m$(time constant), but Z-N(2) method is based only on the ultimate gain $K_u$ and the ultimate period $T_u$ acquired normally by practical trial without any parameters of Z-N(1). In this paper, for the first step to seek mutual relations, the simple formulas of Z-N(2) are transformed into the formulas composed of the same parameters as Z-N(1) which is derived from the analysis of frequency characteristics. Then, the approximation of the actual ultimate frequency is proposed as important premise in the translation between Z-N(1) and (2). Such equalization and approximation brings a simple approximated formula which can explain how Z-N(1) is originated from the Z-N(2) in the form of formula. And a model system is adopted to compare the approximated formula to Z-N(1) and Z-N(2) methods, the results of which show the effectiveness of the proposals.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.2
• /
• pp.41-47
• /
• 2016

The times of multiplication for encryption and decryption of cryptosystem is primarily determined by implementation efficiency of the modular exponentiation of $a^b$(mod m). The most frequently used among standard modular exponentiation methods is a standard binary method, of which n-ary($2{\leq}n{\leq}6$) is most popular. The n-ary($1{\leq}n{\leq}6$) is a square-and-multiply method which partitions $b=b_kb_{k-1}{\cdots}b_1b_{0(2)}$ into n fixed bits from right to left and squares n times and multiplies bit values. This paper proposes a variable-length partition algorithm that partitions $b_{k-1}{\cdots}b_1b_{0(2)}$ from left to right. The proposed algorithm has proved to reduce the multiplication frequency of the fixed-length partition n-ary method.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2004.04a
• /
• pp.39-42
• /
• 2004

The $Bi_2Sr_2Ca_nCu_{n+1}O_x$ superconducting thin film fabricated by using the sputtering method was compared with the $Bi_2Sr_2Ca_nCu_{n+1}O_x$ superconducting thin film fabricated by using the evaporation method. In doing the ultra-low deposition because each element can exist on the substrate surface, both the sputtering method and the evaporation method could easily fabricate single phase of the Bi2212 phase. Also, it is cofirmed that by optimizing the deposition condition, each single phase of the Bi2201 phase and the Bi2212 phase can be fabricated, the sticking coefficient of Bi element is clearly related to the changing of substrate temperature and the formation of the Bi2212 phase.

• Journal of the Korean Society for Heat Treatment
• /
• v.10 no.2
• /
• pp.138-149
• /
• 1997

TiN and AlN are ceramic materials with extensive applications due to its excellent mechanical and chemical properties at elevated temperature. The purpose of this research is to develop the method for the synthesis of ternary nitride powder, titanium-aluminum-nitrogen system, which have an excellent property of both TiN and AlN. The ternary nitride such as $Ti_3AlN$, $Ti_2AlN$ and $Ti_3Al_2N_2$ can be synthesized by the interdiffusion nitriding method in Ar gas, however, the ternary nitride coexist with TiN, AlN, $Ti_3Al$ and ${\alpha}$-Ti. The ternary nitride are stable below $1400^{\circ}C$, but these are gradually decomposed into TiN, $Ti_3Al$ and AlN above $1400^{\circ}C$. The thermal oxidation characteristics of the Ti-Al-N compound synthesized by the interdiffusion nitriding method is superior to that of the TiN+AlN mixed powder, and the oxidation for both materials show the differential behaviors.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.518-521
• /
• 2003

Bi$_2$Sr$_2$Ca$_{n-1}$Cu$_{n}$O$_{x}$ superconducting thin films have been fabricated by atomic layer-by-layer deposition using IBS(Ion Beam Sputtering) method. During the deposition, 90 mol% ozone gas of typical pressure of 1~9 $\times$ 10$^{-5}$ Torr are supplied with ultraviolet light irradiation for oxidation. XRD and RHEED investigations reveal out that a buffer layer with some different compositions is formed at the early deposition stage of less than 10 units cell and then Bi-2201 oriented along the c-axis is grown.grown.

• Journal of information and communication convergence engineering
• /
• v.4 no.4
• /
• pp.158-161
• /
• 2006

[ $Bi_2Sr_2Ca_nCu_{n+1}O_y(n{\geq}0)$ ] thin film is fabricatedvia two different processes using an ion beam sputtering method i.e. co-deposition and layer-by-layer deposition. A single phase of Bi2212 can be fabricated via the co-deposition process. While it cannot be obtained by the layer-by-layer process. Ultra-low growth rate in our ion beam sputtering system brings out the difference in Bi element adsorption between the two processes and results in only 30% adsorption against total incident Bi amount by layer-by-layer deposition, in contrast to enough Bi adsorption by co-deposition.