• Journal for History of Mathematics
• /
• v.20 no.4
• /
• pp.71-84
• /
• 2007

J. Bernoulli first discovered the method which one can produce those formulae for the sum $S_n(k)=\sum_{{\iota}=1}^n\;{\iota}^k$ for any natural numbers k. After then, there has been increasing interest in Bernoulli and Euler numbers associated with Riemann zeta functions. Recently, Kim have been studied extended q-Bernoulli numbers and q-Euler numbers associated with p-adic q-integral on $\mathbb{Z}_p$, and sums of powers of consecutive q-integers, etc. In this paper, we investigate for the historical background and evolution process of the sums of powers of consecutive q-integers and discuss for Euler zeta functions subjects which are studying related to these areas in the recent.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.71-76
• /
• 2014

There is to be virtually impossible to solve the very large digits of prime number p and q from composite number n=pq using integer factorization in typical public-key cryptosystems, RSA. When the public key e and the composite number n are known but the private key d remains unknown in an asymmetric-key RSA, message decryption is carried out by first obtaining ${\phi}(n)=(p-1)(q-1)=n+1-(p+q)$ and then using a reverse function of $d=e^{-1}(mod{\phi}(n))$. Integer factorization from n to p,q is most widely used to produce ${\phi}(n)$, which has been regarded as mathematically hard. Among various integer factorization methods, the most popularly used is the congruence of squares of $a^2{\equiv}b^2(mod\;n)$, a=(p+q)/2,b=(q-p)/2 which is more commonly used then n/p=q trial division. Despite the availability of a number of congruence of scares methods, however, many of the RSA numbers remain unfactorable. This paper thus proposes an algorithm that directly and immediately obtains ${\phi}(n)$. The proposed algorithm computes $2^k{\beta}_j{\equiv}2^i(mod\;n)$, $0{\leq}i{\leq}{\gamma}-1$, $k=1,2,{\ldots}$ or $2^k{\beta}_j=2{\beta}_j$ for $2^j{\equiv}{\beta}_j(mod\;n)$, $2^{{\gamma}-1}$ < n < $2^{\gamma}$, $j={\gamma}-1,{\gamma},{\gamma}+1$ to obtain the solution. It has been found to be capable of finding an arbitrarily located ${\phi}(n)$ in a range of $n-10{\lfloor}{\sqrt{n}}{\rfloor}$ < ${\phi}(n){\leq}n-2{\lfloor}{\sqrt{n}}{\rfloor}$ much more efficiently than conventional algorithms.

• Journal of Service Research and Studies
• /
• v.5 no.2
• /
• pp.71-81
• /
• 2015

The RSA public key encryption algorithm, a few, key generation, factoring, the Euler function, key setup, a joint expression law, the application process are serial indexes. The foundation of such algorithms are mathematical principles. The first concept from mathematics principle is applied from how to obtain a minority. It is to obtain a product of two very large prime numbers, but readily tracking station the original two prime number, the product are used in a very hard principles. If a very large prime numbers p and q to obtain, then the product is the two $n=p{\times}q$ easy station, a method for tracking the number of p and q from n synthesis and it is substantially impossible. The RSA encryption algorithm, the number of digits in order to implement the inverse calculation is difficult mathematical one-way function and uses the integer factorization problem of a large amount. Factoring the concept of the calculation of the mod is difficult to use in addition to the problem in the reverse direction. But the interests of the encryption algorithm implementation usually are focused on introducing the film the first time you use encryption algorithm but we have to know how to go through some process applied to the field work This study presents a field force applied encryption process scheme based on public key algorithms attribute diagnosis.

• International Area Studies Review
• /
• v.15 no.1
• /
• pp.173-193
• /
• 2011

Most of the research regarding economic effects of policy loans has thus far been focused on whether policy loans can improve the financial status or the management performance of small and medium enterprises (SMEs). Unlike previous researches, this study implemented an empirical analysis focused on the contribution of policy loans to easing the liquidity restriction of investment. To analyze whether investment liquidity restriction can be alleviated or not, this study attempted an empirical analysis utilizing the nonlinear Euler equation induced through optimization of investment and GMM (generalized method of moments) as its analysis methodology. With the SMEs that received policy financing from the Small and medium Business Corporation (SBC) in 2004, this study analyzed three years of panel data before(2001~2003) and after(2004~2006) receipt of policy loans. According to the empirical results, it appears that policy loans had effects on resolving liquidity restriction of investment, implying that policy financing eases the liquidity restriction of SME investment and would contribute to the growth and development of SMEs. Further, I checked robustness of empirical results using Tobin's q model. The empirical results also support that policy loans help to resolve liquidity constraint. With these results, it is understood that the critical view to date, which has emphasized the ineffectiveness of policy financing due to it having no or insignificant economic effects, may be wrong.