• Journal of Integrative Natural Science
• /
• v.14 no.4
• /
• pp.159-161
• /
• 2021

In this article, we will study which prime numbers are represented by the principal form. p = x² + ny². We will also give some results related to the form of primes of the form x² + axy + y².

• Communications of the Korean Mathematical Society
• /
• v.19 no.2
• /
• pp.205-210
• /
• 2004

According to Diriclet's Theorem, there are infinitely many primes of the form An+ 1 for any fixed positive integer A. For this, there already exists a classical simple proof using cyclotomic polynomials. In this paper, we develop another elementary proof of this statement.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.3
• /
• pp.427-431
• /
• 2014

In this paper, we show that groups of order $2^npq$, where p, q are primes of the from $p=2^n-1$, $q=2^{n-1}+p$ with $n{\geq}3$, are not simple and groups of order $2^npq^t$ for $t{\geq}2$, where p, q are odd primes of the form $p=2^m-1$, $q=2^n-1$ with m < n, are not simple.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.5
• /
• pp.1559-1568
• /
• 2015

The relative class number $H_d(f)$ of a real quadratic field $K=\mathbb{Q}(\sqrt{m})$ of discriminant d is the ratio of class numbers of $O_f$ and $O_K$, where $O_K$ denotes the ring of integers of K and $O_f$ is the order of conductor f given by $\mathbb{Z}+fO_K$. In a recent paper of A. Furness and E. A. Parker the relative class number of $\mathbb{Q}(\sqrt{m})$ has been investigated using continued fraction in the special case when $(\sqrt{m})$ has a diagonal form. Here, we extend their result and show that there exists a conductor f of relative class number 1 when the continued fraction of $(\sqrt{m})$ is non-diagonal of period 4 or 5. We also show that there exist infinitely many real quadratic fields with any power of 2 as relative class number if there are infinitely many Mersenne primes.

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

In this paper, we discuss the number of distinct fuzzy subgroups of the group ${\mathbb{Z}}_{p^n}{\times}{\mathbb{Z}}_{q^m}{\times}{\mathbb{Z}}_r$, m = 1, 2, 3 where p, q, r are distinct primes for any $n{\in}{\mathbb{Z}}^+$ using the criss-cut method that was proposed by Murali and Makamba in their study of distinct fuzzy subgroups. The criss-cut method first establishes all the maximal chains of the subgroups of a group G and then counts the distinct fuzzy subgroups contributed by each chain. In this paper, all the formulae for calculating the number of these distinct fuzzy subgroups are given in polynomial form.

• Journal of the Korean Mathematical Society
• /
• v.54 no.1
• /
• pp.35-57
• /
• 2017

In this paper, we study the natural star-operation defined by the set of associated primes of principal ideals of an integral domain, which is called the g-operation. We are mainly concerned with the ideal-theoretic properties of this star-operation. In particular, we investigate DG-domains (i.e., integral domains in which each ideal is a g-ideal), which form a proper subclass of the DW-domains. In order to provide some original examples, we examine the transfer of the DG-property to pullbacks. As an application of the g-operation, it is shown that w-divisorial Mori domains can be seen as a Gorenstein analogue of Krull domains.

• Journal of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.621-634
• /
• 2022

The scaled inverse of a nonzero element a(x) ∈ ℤ[x]/f(x), where f(x) is an irreducible polynomial over ℤ, is the element b(x) ∈ ℤ[x]/f(x) such that a(x)b(x) = c (mod f(x)) for the smallest possible positive integer scale c. In this paper, we investigate the scaled inverse of (xⁱ - x^j) modulo cyclotomic polynomial of the form Φ_p^s (x) or Φ_p^sq^t (x), where p, q are primes with p < q and s, t are positive integers. Our main results are that the coefficient size of the scaled inverse of (xⁱ - x^j) is bounded by p - 1 with the scale p modulo Φ_p^s (x), and is bounded by q - 1 with the scale not greater than q modulo Φ_p^sq^t (x). Previously, the analogous result on cyclotomic polynomials of the form Φ_2ⁿ (x) gave rise to many lattice-based cryptosystems, especially, zero-knowledge proofs. Our result provides more flexible choice of cyclotomic polynomials in such cryptosystems. Along the way of proving the theorems, we also prove several properties of {x^k}_k∈ℤ in ℤ[x]/Φ_pq(x) which might be of independent interest.

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.3
• /
• pp.11-25
• /
• 2018

While being believed that decrypting any RSA ciphertext is as hard as factorizing the RSA modulus, it was also shown that, if additional information is available, breaking the RSA cryptosystem may be much easier than factoring. For example, Coppersmith showed that, given the 1/2 fraction of the least or the most significant bits of one of two RSA primes, one can factorize the RSA modulus very efficiently, using the lattice-based technique. More recently, introducing the so called cold boot attack, Halderman et al. showed that one can recover cryptographic keys from a decayed DRAM image. And, following up this result, Heninger and Shacham presented a polynomial-time attack which, given 0.27-fraction of the RSA private key of the form (p, q, d, $d_p$, $d_q$), can recover the whole key, provided that the given bits are uniformly distributed. And, based on the work of Heninger and Shacham, this paper presents a different approach for recovering RSA private key bits from decayed key information, under the assumption that some random portion of the private key bits is known. More precisely, we present the algorithm of recovering RSA private key bits from erased key material and elaborate the formula of describing the number of partially-recovered RSA private key candidates in terms of the given erasure rate. Then, the result is justified by some extensive experiments.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.5
• /
• pp.1089-1097
• /
• 2016

It is well-known that, if additional information other than a plaintext-ciphertext pair is available, breaking the RSA cryptosystem may be much easier than factorizing the RSA modulus. For example, Coppersmith showed that, given the 1/2 fraction of the least or most significant bits of one of two RSA primes, the RSA modulus can be factorized in a polynomial time. More recently, Henecka et. al showed that the RSA private key of the form (p, q, d, $d_p$, $d_q$) can efficiently be recovered whenever the bits of the private key are erroneous with error rate less than 23.7%. It is notable that their algorithm is based on counting the matching bits between the candidate key bit string and the given decayed RSA private key bit string. And, extending the algorithm, this paper proposes a new RSA private key recovery algorithm using a generalized probabilistic measure for measuring the consistency between the candidate key bits and the given decayed RSA private key bits.