• Honam Mathematical Journal
• /
• v.32 no.3
• /
• pp.389-397
• /
• 2010

Exton introduced 20 distinct triple hypergeometric functions whose names are Xi (i = 1,$\ldots$, 20) to investigate their twenty Laplace integral representations whose kernels include the confluent hypergeometric functions $_0F_1$, $_1F_1$, a Humbert function $\Psi_2$, a Humbert function $\Phi_2$. The object of this paper is to present 25 (presumably new) integral representations of Euler types for the Exton hypergeometric function $X_5$ among his twenty $X_i$ (i = 1,$\ldots$, 20), whose kernels include the Exton function X5 itself, the Exton function $X_6$, the Horn's functions $H_3$ and $H_4$, and the hypergeometric function F = $_2F_1$.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.1981-1988
• /
• 2013

We say a positive integer n satisfies the Lehmer property if ${\phi}(n)$ divides n - 1, where ${\phi}(n)$ is the Euler's totient function. Clearly, every prime satisfies the Lehmer property. No composite integer satisfying the Lehmer property is known. In this article, we show that every composite integer of the form $D_{p,n}=np^n+1$, for a prime p and a positive integer n, or of the form ${\alpha}2^{\beta}+1$ for ${\alpha}{\leq}{\beta}$ does not satisfy the Lehmer property.

• Communications of the Korean Mathematical Society
• /
• v.27 no.2
• /
• pp.257-264
• /
• 2012

Exton introduced 20 distinct triple hypergeometric functions whose names are $X_i$ (i = 1, ${\ldots}$, 20) to investigate their twenty Laplace integral representations whose kernels include the confluent hypergeometric functions $_0F_1$, $_1F_1$, a Humbert function ${\Psi}_1$, and a Humbert function ${\Phi}_2$. The object of this paper is to present 18 new integral representations of Euler type for the Exton hypergeometric function $X_8$, whose kernels include the Exton functions ($X_2$, $X_8$) itself, the Horn's function $H_4$, the Gauss hypergeometric function $F$, and Lauricella hypergeometric function $F_C$. We also provide a system of partial differential equations satisfied by $X_8$.

• Communications of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.1105-1115
• /
• 2019

For positive integers n and k, let $S_k(n)$ and $S^{\prime}_k(n)$ be the sums of the elements in the finite sets {$x^k:1{\leq}x{\leq}n$, (x, n) = 1} and {$x^k:1{\leq}x{\leq}n/2$, (x, n) = 1}respectively. The formulae for both $S_k(n)$ and $S^{\prime}_k(n)$ are established. The explicit formulae when k = 1, 2, 3 are also given.

• 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 the Korea Society of Computer and Information
• /
• v.18 no.8
• /
• pp.87-93
• /
• 2013

A baby-step giant-step algorithm divides n by n blocks that possess $m={\lceil}\sqrt{n}{\rceil}$ elements, and subsequently computes and stores $a^x$ (mod n) for m elements in the 1st block. It then calculates mod n for m blocks and identifies each of them with those in the 1st block of an identical elemental value. This paper firstly proposes a modified baby-step giant-step algorithm that divides ${\lceil}m/2{\rceil}$ blocks with m elements applying $a^{{\phi}(n)/2}{\equiv}1(mod\;n)$ and $a^x(mod\;n){\equiv}a^{{\phi}(n)+x}$ (mod n) principles. This results in a 50% decrease in the process of the giant-step. It then suggests a reverse baby-step giant step algorithm that performs and saves ${\lceil}m/2{\rceil}$ blocks firstly and computes $a^x$ (mod n) for m elements. The proposed algorithm is found to successfully halve the memory and search time of the baby-step giant step algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.25-31
• /
• 2014

When the public key e and the composite number n=pq are disclosed but not the private key d in an asymmetric-key RSA, message decryption is carried out by obtaining ${\phi}(n)=(p-1)(q-1)=n+1-(p+q)$ and subsequently computing $d=e^{-1}(mod{\phi}(n))$. The most commonly used decryption algorithm is integer factorization of n/p=q or $a^2{\equiv}b^2$(mod n), a=(p+q)/2, b=(q-p)/2. But many of the RSA numbers remain unfactorable. This paper therefore applies baby-step giant-step discrete logarithm and $2^k$-ary modular exponentiation to directly obtain ${\phi}(n)$. The proposed algorithm performs a reverse baby-step and $2^k$-ary adult-step. As a results, it reduces the execution time of basic adult-step to $1/2^k$ times and the memory $m={\lceil}\sqrt{n}{\rceil}$ to l, $a^l$ > n, hence obtaining ${\phi}(n)$ by executing within l times.