• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.1
• /
• pp.5-14
• /
• 2014

Searchable encryption systems provide search on encrypted data while preserving the privacy of the data and the search keywords used in queries. Recently, interest on data outsourcing has increased due to proliferation of cloud computing services. Many researches are on going to minimize the trust put on external servers and searchable encryption is one of them. However, most of previous searchable encryption schemes provide only a single keyword boolean search. Although, there have been proposals to provide conjunctive keyword search, most of these works use a fixed field which limit their application. In this paper, we propose a field-free conjunctive keyword searchable encryption that also provides rank information of search results. Our system uses prime tables and greatest common divisor operation, making our system very efficient. Moreover, our system is practical and can be implemented very easily since it does not require sophisticated cryptographic module.

• Journal of the Chungcheong Mathematical Society
• /
• v.20 no.4
• /
• pp.433-438
• /
• 2007

Let $\mathbb{A}=\mathbb{F}_q[T]$ and $k=\mathbb{F}_q(T)$. Assume q is odd, and fix a prime divisor ${\ell}$ of q - 1. Let P be a monic irreducible polynomial in A whose degree d is divisible by ${\ell}$. In this paper we define a subgroup $\tilde{C}_F$ of $\mathcal{O}^*_F$ which is generated by $\mathbb{F}^*_q$ and $\{{\eta}^{{\tau}^i}:0{\leq}i{\leq}{\ell}-1\}$ in $F=k(\sqrt[{\ell}]{P})$ and calculate the unit-index $[\mathcal{O}^*_F:\tilde{C}_F]={\ell}^{\ell-2}h(\mathcal{O}_F)$. This is a generalization of [3, Theorem 16.15].

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.2
• /
• pp.375-384
• /
• 2008

Let $k={\mathbb{F}}_q(T)$ and ${\mathbb{A}}={\mathbb{F}}_q[T]$. Fix a prime divisor ${\ell}$ q-1. In this paper, we consider a ${\ell}$-cyclic real function field $k(\sqrt[{\ell}]P)$ as a subfield of the imaginary bicyclic function field K = $k(\sqrt[{\ell}]P,\;(\sqrt[{\ell}]{-Q})$, which is a composite field of $k(\sqrt[{\ell}]P)$ wit a ${\ell}$-cyclic totally imaginary function field $k(\sqrt[{\ell}]{-Q})$ of class number one. und give various conditions for the class number of $k(\sqrt[{\ell}]{P})$ to be one by using invariants of the relatively cyclic unramified extensions $K/F_i$ over ${\ell}$-cyclic totally imaginary function field $F_i=k(\sqrt[{\ell}]{-P^iQ})$ for $1{\leq}i{\leq}{\ell}-1$.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.2
• /
• pp.233-239
• /
• 2007

Let $\mathbb{A}=\mathbb{F}_q$[T] be the polynomial ring over a finite field $\mathbb{F}_q$[T] and K=$\mathbb{F}_q$(T) its field of fractions. Let ${\ell}$ be a fixed prime divisor of q-1. Let J be a finite set of monic irreducible polynomials $P{\in}{\mathbb{A}}$ with deg $P{\equiv}0$ (mod ${\ell})$. In this paper we define the group $C_K$ of circular units in K=k$(\{\sqrt[{\ell}]P\;:\;P{\in}J\})$ in the sense of Kucera [4] and compute the index of $C_K$ in the full unit group $O^*_K$.

• Korean Journal of Mathematics
• /
• v.28 no.1
• /
• pp.65-73
• /
• 2020

This article concerns a property of local rings and domains. A ring R is called weakly local if for every a ∈ R, a is regular or 1-a is regular, where a regular element means a non-zero-divisor. We study the structure of weakly local rings in relation to several kinds of factor rings and ring extensions that play roles in ring theory. We prove that the characteristic of a weakly local ring is either zero or a power of a prime number. It is also shown that the weakly local property can go up to polynomial (power series) rings and a kind of Abelian matrix rings.

• Kyungpook Mathematical Journal
• /
• v.63 no.2
• /
• pp.167-173
• /
• 2023

Let G be a finite group and let ν(G) be the probability that two randomly selected elements of G produce a nilpotent group. In this article we show that for every positive integer n > 0, there is a finite group G such that ${\nu}(G)={\frac{1}{n}}$. We also classify all groups G with ${\nu}(G)={\frac{1}{2}}$. Further, we prove that if G is a solvable nonnilpotent group of even order, then ${\nu}(G){\leq}{\frac{p+3}{4p}}$, where p is the smallest odd prime divisor of |G|, and that equality exists if and only if $\frac{G}{Z_{\infty}(G)}$ is isomorphic to the dihedral group of order 2p where Z_∞(G) is the hypercenter of G. Finally we find an upper bound for ν(G) in terms of |G| where G ranges over all groups of odd square-free order.

• Bulletin of the Korean Mathematical Society
• /
• v.30 no.1
• /
• pp.71-77
• /
• 1993

Every ring considered in the paper will be assumed to be commutative and have a unit element. An ideal A of a ring R will be called primal if the elements of R which are zero divisors modulo A, form an ideal of R, say pp. If A is a primal ideal of R, P is called the adjoint ideal of A. The adjoint ideal of a primal ideal is prime [2]. The definition of primal ideals may also be formulated as follows: An ideal A of a ring R is primal if in the residue class ring R/A the zero divisors form an ideal of R/A. If Q is a primary idel of a ring R then every zero divisor of R/Q is nilpotent; therefore, Q is a primal ideal of R. That a primal ideal need not be primary, is shown by an example in [2]. Let R[X], and R[[X]] denote the polynomial ring and formal power series ring in an indeterminate X over a ring R, respectively. Let S be a multiplicative system in a ring R and S$^{-1}$ R the quotient ring of R. Let Q be a P-primary ideal of a ring R. Then Q[X] is a P[X]-primary ideal of R[X], and S$^{-1}$ Q is a S$^{-1}$ P-primary ideal of a ring S$^{-1}$ R if S.cap.P=.phi., and Q[[X]] is a P[[X]]-primary ideal of R[[X]] if R is Noetherian [1]. We search for analogous results when primary ideals are replaced with primal ideals. To show an ideal A of a ring R to be primal, it sufficies to show that a-b is a zero divisor modulo A whenever a and b are zero divisors modulo A.

• Journal of the Korean Mathematical Society
• /
• v.49 no.1
• /
• pp.85-98
• /
• 2012

Let R be a commutative ring and I its proper ideal, let S(I) be the set of all elements of R that are not prime to I. Here we introduce and study the total graph of a commutative ring R with respect to proper ideal I, denoted by T(${\Gamma}_I(R)$). It is the (undirected) graph with all elements of R as vertices, and for distinct x, y ${\in}$ R, the vertices x and y are adjacent if and only if x + y ${\in}$ S(I). The total graph of a commutative ring, that denoted by T(${\Gamma}(R)$), is the graph where the vertices are all elements of R and where there is an undirected edge between two distinct vertices x and y if and only if x + y ${\in}$ Z(R) which is due to Anderson and Badawi [2]. In the case I = {0}, $T({\Gamma}_I(R))=T({\Gamma}(R))$; this is an important result on the definition.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.163-172
• /
• 2002

Java Card API porvide benifit for development program based on smart card using limmited resource. This APIs does not support arithmetic operations such as modular arithmetic, greatest common divisor calculation, and generation and certification of prime number, which is necessary arithmetic in PKI algorithm implementation. In this paper, we implement class BigInteger acted in the Java Card platform because that Java Card APIs does not support class BigInteger necessary in implementation of PKI algorithm.

• School Mathematics
• /
• v.14 no.1
• /
• pp.45-64
• /
• 2012

The purpose of the present study was to investigate middle grades (Grade 5-7) mathematics teachers' knowledge of partitive fraction division. The data were derived from a part of 40-hour professional development course on fractions, decimals, and proportions with 13 in-service teachers. In this study, I attempted to develop a model of teachers' way of knowing partitive fraction division in terms of two knowledge components: knowledge of units and partitioning operations. As a result, teachers' capacities to deal with a sharing division problem situation where the dividend and the divisor were relatively prime differed with regard to the two components. Teachers who reasoned with only two levels of units were limited in that the two-level structure they used did not show how much of one unit one person would get whereas teachers with three levels of units indicated more flexibilities in solving processes.