• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.2
• /
• pp.241-251
• /
• 2015

In public-key cryptographic system based on finite field arithmetic, it is very important to challenge for implementing high speed operation. In this paper, we focused on 8-bit ATmega128 processor and concentrated on enhancing efficiency of reduction operation which uses irreducible polynomial $f(x)=x^{271}+x^{207}+x^{175}+x^{111}+1$ and $f(x)=x^{193}+x^{145}+x^{129}+x^{113}+1$. We propose optimized reduction algorithms which are designed to reduce repeated memory accesses by calculating final reduced values of Fast reduction. There are 53%, 55% improvement when proposed algorithm is implemented using assembly language, compare to previous Fast reduction algorithm.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.4
• /
• pp.194-200
• /
• 2012

In this paper we analyze the code sequence generating algorism defined on $GF(2^n)$ proposed by S.Bostas and V.Kumar[7] and derive the implementation functions of code sequence generator using Boolean functions which can map the vector space $F_2^n$ of all binary vectors of length n, to the finite field with two elements $F_2$. We find the code sequence generating boolean functions based on two kinds of the primitive polynomials of degree, n=5 and n=7 from trace function. We then design and implement the code sequence generators using these functions, and produce two code sequence groups. The two groups have the period 31 and 127 and the magnitudes of out of phase(${\tau}{\neq}0$) autocorrelation and crosscorrelation functions {-9, -1, 7} and {-17, -1, 15}, satisfying the period $L=2^n-1$ and the correlation functions $R_{ij}({\tau})=\{-2^{(n+1)/2}-1,-1,2^{(n+l)/2}-1\}$ respectively. Through these results, we confirm that the code sequence generators using boolean functions are designed and implemented correctly.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.193-200
• /
• 2022

In this study, the finite-failure NHPP software reliability model was applied to the software development model based on the Weibull lifetime distribution (Goel-Okumoto, Rayleigh, Type-2 Gumbe), which is widely used in the software reliability field, and then the cost attributes were compared and evaluated. For this study, failure time data detected during normal operation of the software system were collected and used, the most-likelihood estimation (MLE) method was applied to the parameter estimation of the proposed model, and the calculation of the nonlinear equation was solved using the binary method. As a result, first, in the software development model, when the cost of testing per unit time and the cost of removing a single defect increased, the cost increased but the release time did not change, and when the cost of repairing failures detected during normal system operation increased, the cost increased and the release time was also delayed. Second, as a result of comprehensive comparative analysis of the proposed models, it was found that the Type-2 Gumble model was the most efficient model because the development cost was lower and the release time point was relatively faster than the Rayleigh model and the Goel-Okumoto basic model. Third, through this study, the development cost properties of the Weibull distribution model were newly evaluated, and the analyzed data is expected to be utilized as design data that enables software developers to explore the attributes of development cost and release time.