• The KIPS Transactions:PartA
• /
• v.12A no.3 s.93
• /
• pp.235-242
• /
• 2005

In this paper, we propose a new division circuit for $GF(2^m)$ applications. The proposed division circuit is based on a modified the binary GCD algorithm and produce division results at a rate of one per 2m-1 clock cycles. Analysis shows that the proposed circuit gives $47\%$ and $20\%$ improvements in terms of speed and hardware respectively. In addition, since the proposed circuit does not restrict the choice of irreducible polynomials and has regularity and modularity, it provides a high flexibility and scalability with respect to the field size m. Thus, the proposed divider. is well suited to low-area $GF(2^m)$ applications.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.6
• /
• pp.19-25
• /
• 2017

This paper deals with integer factorization of two prime p,q of SHA-256 secure hash value n for Bit coin mining. This paper proposes an algorithm that greatly reduces the execution time of Pollard's rho integer factorization algorithm. Rho(${\rho}$) algorithm computes $x_i=x^2_{i-1}+1(mod\;n)$ and $y_i=[(y^2_{i-1}+1)^2+1](mod\;n)$ for intial values $(x_0,y_0)=(2,2)$ to find the factor 1 < $gcd({\mid}x_i-y_i{\mid},n)$ < n. It however fails to factorize some particular composite numbers. The algorithm proposed in this paper applies multiple initial values $(x_0,y_0)=(2^k,2^k)$ and ($2^k,2$), $2{\leq}k{\leq}10$ to the existing Pollard's Rho algorithm. As a results, the proposed algorithm achieves both the factorization of all the composite numbers and the reduction of the execution time of Pollard's Rho by 67.94%.

• Journal of Microbiology and Biotechnology
• /
• v.24 no.1
• /
• pp.59-69
• /
• 2014

One of the major challenges in metabolic engineering for enhanced synthesis of value-added chemicals is to design and develop new strains that can be translated into well-controlled fermentation processes using bioreactors. The aim of this study was to assess the influence of various fed-batch strategies in the performance of metabolically engineered Pseudomonas putida strains, ${\Delta}gcd$ and ${\Delta}gcd-pgl$, for improving production of medium-chain-length polyhydroxyalkanoates (mcl-PHAs) using glucose as the only carbon source. First we developed a fed-batch process that comprised an initial phase of biomass accumulation based on an exponential feeding carbon-limited strategy. For the mcl-PHA accumulation stage, three induction techniques were tested under nitrogen limitation. The substrate-pulse feeding was more efficient than the constant-feeding approach to promote the accumulation of the desirable product. Nonetheless, the most efficient approach for maximum PHA synthesis was the application of a dissolved-oxygen-stat feeding strategy (DO-stat), where P. putida ${\Delta}gcd$ mutant strain showed a final PHA content and specific PHA productivity of 67% and $0.83g{\cdot}l^{-1}{\cdot}h^{-1}$, respectively. To our knowledge, this mcl-PHA titer is the highest value that has been ever reported using glucose as the sole carbon and energy source. Our results also highlighted the effect of different fed-batch strategies upon the extent of realization of the intended metabolic modification of the mutant strains.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.107-112
• /
• 2011

It is very difficult to factorize composite number, $n=pq$ to integer factorization, p and q that is almost similar length of digits. Integer factorization algorithms, for the most part, find ($a,b$) that is congruence of squares ($a^2{\equiv}b^2$ (mod $n$)) with using factoring(factor base, B) and get the result, $p=GCD(a-b,n)$, $q=GCD(a+b,n)$ with taking the greatest common divisor of Euclid based on the formula $a^2-b^2=(a-b)(a+b)$. The efficiency of these algorithms hangs on finding ($a,b$) and deciding factor base, B. This paper proposes a efficient algorithm. The proposed algorithm extracts B from integer factorization with 3 digits prime numbers of $n+1$ and decides f, the combination of B. And then it obtains $x$(this is, $a=fxy$, $\sqrt{n}$ < $a$ < $\sqrt{2n}$) from integer factorization of $n-2$ and gets $y=\frac{a}{fx}$, $y_1$={1,3,7,9}. Our algorithm is much more effective in comparison with the conventional Fermat algorithm that sequentially finds $\sqrt{n}$ < $a$.

• Journal of the Korean Applied Science and Technology
• /
• v.33 no.3
• /
• pp.587-592
• /
• 2016

In this study, flexible acid treated single walled carbon nanotubes (A-SWCNTs) electrodes were fabricated by using gold coated PET substrate and spray coating technique. The acid-treatment method was conducted to introduce functional groups on the SWCNTs wall, which could improve dispersability of the SWCNTs and its electrochemical property. The electrochemical properties of flexible A-SWCNTs electrode were carried out by cyclic voltammetry(CV), electrochemical impedance were carried out by cyclic voltammetry(CV), electrochemical impedance spectroscopy(EIS) and galvanostatic charge/discharge (GCD) cycles. As a results, The specific capacitance value of the unbent A-SWCNTs electrode was $67F{\cdot}g^{-1}$, which decreased to $63F{\cdot}g^{-1}$ (94% retention) after 1000 GCD cycles. Interestingly, the specific capacitance of the unbent A-SWCNTs electrode with application of the 1000 GCD cycles was retained even after 500 bending to $30^{\circ}$ with 6000 GCD cycles.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.221-228
• /
• 2013

It is impossible directly to find a prime number p,q of a large semiprime n = pq using Trial Division method. So the most of the factorization algorithms use the indirection method which finds a prime number of p = GCD(a-b, n), q=GCD(a+b, n); get with a congruence of squares of $a^2{\equiv}b^2$ (mod n). It is just known the fact which the area that selects p and q about n=pq is between $10{\cdots}00$ < p < $\sqrt{n}$ and $\sqrt{n}$ < q < $99{\cdots}9$ based on $\sqrt{n}$ in the range, [$10{\cdots}01$, $99{\cdots}9$] of $l(p)=l(q)=l(\sqrt{n})=0.5l(n)$. This paper proposes the method that reduces the range of p using information obtained from n. The proposed method uses the method that sets to $p_{min}=n_{LR}$, $q_{min}=n_{RL}$; divide into $n=n_{LR}+n_{RL}$, $l(n_{LR})=l(n_{RL})=l(\sqrt{n})$. The proposed method is more effective from minimum 17.79% to maxmimum 90.17% than the method that reduces using $\sqrt{n}$ information.

• Journal of Advanced Navigation Technology
• /
• v.21 no.3
• /
• pp.230-242
• /
• 2017

A significant rise in product-liability cost is expected due to the newly passed product liability amendment Bill approved during the assembly plenary session on March 30, 2017. Korean government legal service(KGLS) filed a damage suit against Korea aerospace industries, Ltd.(KAI) and Hanwha Techwin Co., Ltd., the manufactures of the KUH-1 Surion helicopter crashed. KGLS alleged claims under the product liability Act, the warrant liability Act and the non-performance of contract act. The accountability limits of military aircraft manufacturers was a highly divisive issue among related scholars and legal practitioners. The bottom line was that military aircraft manufacturers had no product-liability insurance available. The United States courts have, therefore, developed the government contractor defense(GCD) and it was recognized by the U.S. Supreme Court in Boyle v. United Technologies corporation(1988). product liability insurances for military aircraft manufacturers are excessively expensive and it cannot be added onto the military procurement cost accounting. However, having an aircraft accident without one can be ruinously expensive. Therefore, the manufacturers should promptly set up appropriate risk management measures. This thesis will first review the advance GCD theory, and then find a way to either reform government contract related regulations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.157-164
• /
• 2011

It is very difficult problem to factorize composite number. Integer factorization algorithms, for the most part, find ($a,b$) that is congruence of squares ($a^2{\equiv}b^2$(mode $n$)) with using factoring(factor base, B) and get the result, $p=GCD(a-b,n)$, $q=GCD(a+b,n)$ with taking the greatest common divisor of Euclid based on the formula $a^2-b^2=(a-b)(a+b)$. The efficiency of these algorithms hangs on finding ($a,b$). Fermat's algorithm that is base of congruence of squares finds $a^2-b^2=n$. This paper proposes the method to find $a^2-b^2=kn$, ($k=1,2,{\cdots}$). It is supposed $b_1$=0 or 5 to be surely, and b is a double number. First, the proposed method decides $k$ by getting kn that satisfies $b_1=0$ and $b_1=5$ about $n_2n_1$. Second, it decides $a_2a_1$ that satisfies $a^2-b^2=kn$. Third, it figures out ($a,b$) from $a^2-b^2=kn$ about $a_2a_1$ as deciding $\sqrt{kn}$ < $a$ < $\sqrt{(k+1)n}$ that is in $kn$ < $a^2$ < $(k+1)n$. The proposed algorithm is much more effective in comparison with the conventional Fermat algorithm.

• Journal of the Chungcheong Mathematical Society
• /
• v.24 no.3
• /
• pp.595-599
• /
• 2011

We prove that for any positive integer $g{\geq}3$, there are ${\gg}q^{\frac{l}{2g}}$ real cyclotomic function fields whose conductor has degree ${\leq}l$ and ideal class number is divisible by $\frac{g}{gcd(2,g)}$.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2497-2513
• /
• 2013

In 2010, Dijk et al. demonstrated a simple somewhat homomorphic encryption (HE) scheme over the integers of which this simplicity came at the cost of a public key size in $\tilde{O}({\lambda}^{10})$. Although in 2011 Coron et al. reduced the public key size to $\tilde{O}({\lambda}^7)$, it is still too large for practical applications, especially for the cloud computing. In this paper, we propose a new form of somewhat HE scheme to reduce further the public key size and a variation of the scheme to optimize the ciphertext size. First of all, we propose a new somewhat HE scheme which is built on the hardness of the approximate greatest common divisor (GCD) problem of two integers, where the public key size in the scheme is reduced to $\tilde{O}({\lambda}^3)$. Furthermore, we can reduce the length of the ciphertext of the new somewhat HE scheme by applying the modular reduction technique. Additionally, we give simulation results for evaluating ability of the proposed scheme.