• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.556-563
• /
• 2009

A side channel analysis is a very efficient attack against small devices such as smart cards and wireless sensor nodes. In this paper, we propose an efficient key detection method using a peak selection algorithm in order to find the advanced encryption standard secret key from electromagnetic signals. The proposed method is applied to a correlation electromagnetic analysis (CEMA) attack against a wireless sensor node. Our approach results in increase in the correlation coefficient in comparison with the general CEMA. The experimental results show that the proposed method can efficiently and reliably uncover the entire 128-bit key with a small number of traces, whereas some extant methods can reveal only partial subkeys by using a large number of traces in the same conditions.

• Honam Mathematical Journal
• /
• v.36 no.4
• /
• pp.787-794
• /
• 2014

We prove three convex hull theorems on triangles and circles. Given a triangle ${\triangle}$ and a point p, let ${\triangle}^{\prime}$ be the triangle each of whose vertices is the intersection of the orthogonal line from p to an extended edge of ${\triangle}$. Let ${\triangle}^{{\prime}{\prime}}$ be the triangle whose vertices are the centers of three circles, each passing through p and two other vertices of ${\triangle}$. The first theorem characterizes when $p{\in}{\triangle}$ via a distance duality. The triangle algorithm in [1] utilizes a general version of this theorem to solve the convex hull membership problem in any dimension. The second theorem proves $p{\in}{\triangle}$ if and only if $p{\in}{\triangle}^{\prime}$. These are used to prove the third: Suppose p be does not lie on any extended edge of ${\triangle}$. Then $p{\in}{\triangle}$ if and only if $p{\in}{\triangle}^{{\prime{\prime}}$.

• Research in Mathematical Education
• /
• v.8 no.2
• /
• pp.81-93
• /
• 2004

This study investigated three preservice teachers' mathematical problem solving among hand-in-write-ups and final projects for each subject. All participants' activities and computer explorations were observed and video taped. If it was possible, an open-ended individual interview was performed before, during, and after each exploration. The method of data collection was observation, interviewing, field notes, students' written assignments, computer works, and audio and videotapes of preservice teachers' mathematical problem solving activities. At the beginning of the mathematical problem solving activities, all participants did not have strong procedural and conceptual knowledge of the graph, making a model by using data, and general concept of a sine function, but they built strong procedural and conceptual knowledge and connected them appropriately through mathematical problem solving activities by using the computer technology.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.1
• /
• pp.37-41
• /
• 2014

FFT (Fast Fourier Transform) has been widely used in various fields such as image processing, voice processing, physics, astronomy, applied mathematics and so forth. Much research has been conducted due to the importance of the FFT and recently new FFT algorithms using a GPU (Graphics Processing Unit) have been developed for the purpose of much faster processing. In this paper, the new optimal FFT algorithm using the Pease FFT algorithm has been proposed reflecting the hardware configuration of a GPGPU (General Purpose computing of GPU). According to the experiments, the proposed algorithm outperformed by between 3% to 43% compared to the CUFFT algorithm.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.1
• /
• pp.177-186
• /
• 2016

For a map $f:A{\rightarrow}X$, there are concepts of $H^f$-spaces, $T^f$-spaces, which are generalized ones of H-spaces [17,18]. In general, Any H-space is an $H^f$-space, any $H^f$-space is a $T^f$-space. For a principal fibration $E_k{\rightarrow}X$ induced by $k:X{\rightarrow}X^{\prime}$ from ${\epsilon}:PX^{\prime}{\rightarrow}X^{\prime}$, we obtain some sufficient conditions to having liftings $H^{\bar{f}}$-structures and $T^{\bar{f}}$-structures on $E_k$ of $H^f$-structures and $T^f$-structures on X respectively. We can also obtain some results about $H^f$-spaces and $T^f$-spaces in Postnikov systems for spaces, which are generalizations of Kahn's result about H-spaces.

• Journal of Integrative Natural Science
• /
• v.1 no.3
• /
• pp.216-220
• /
• 2008

In general the Banach space $L^1(T^1)$ doesn't admit convergence in norm. Thus the convergence in norm of the partial sums can not be characterized in terms of Fourier coefficients without additional assumptions about the sequence$\{^{\^}f(\xi)\}$. The problem of $L^1(T^1)$-convergence consists of finding the properties of Fourier coefficients such that the necessary and sufficient condition for (1.2) and (1.3). This paper showed that let $\{{\alpha}_{\kappa}\}{\in}BV$ and ${\xi}{\Delta}a_{\xi}=o(1),\;{\xi}{\rightarrow}{\infty}$. Then (1.1) is a Fourier series if and only if $\{{\alpha}_{\kappa}\}{\in}{\Gamma}$.

• Geomechanics and Engineering
• /
• v.23 no.4
• /
• pp.393-403
• /
• 2020

We design the Green-Naghdi model type III (GN-III) with widespread thermoelasticity for a thermoelectric half space using a memory-dependent derivative rule (MDD). Laplace transformations and state-space techniques are used in order to find the general solution for any set of limit conditions. A basic question of heat shock charging half space and a traction-free surface was added to the formulation in the present situation of a traveling heat source with consistent heating speed and ramp-type heating. The Laplace reverse transformations are numerically recorded. There are called the impacts of several calculations of the figure of the value, heat source spead, MDD parameters, magnetic number and the parameters of the ramping period.

• Communications of the Korean Mathematical Society
• /
• v.18 no.1
• /
• pp.105-115
• /
• 2003

It is well known that there exists a regular branched covering map from T$^2$ onto $\={C}$ iff the ramification indices are (2,2,2,2), (2,4,4), (2,3,6) and (3,3,3). In this paper we construct (count-ably many) chaotic homeomorphisms induced by hyperbolic toral automorphism and regular branched covering map corresponding to the ramification indices (2,2,2,2). And we also gave an example which shows that the above construction of a chaotic map is not true in general if the ramification indices is (2,4,4) and also show that there are no chaotic homeomorphisms induced by hyperbolic toral automorphism and regular branched covering map corresponding to the ramification indices (2,3,6) and (3,3,3).

• Journal of the Korean Mathematical Society
• /
• v.50 no.4
• /
• pp.727-753
• /
• 2013

In this paper, we introduce three new broad classes of second-order generalized convex functions, namely, ($\mathcal{F}$, $b$, ${\phi}$, ${\rho}$, ${\theta}$)-sounivex functions, ($\mathcal{F}$, $b$, ${\phi}$, ${\rho}$, ${\theta}$)-pseudosounivex functions, and ($\mathcal{F}$, $b$, ${\phi}$, ${\rho}$, ${\theta}$)-quasisounivex functions; formulate eight general second-order duality models; and prove appropriate duality theorems under various generalized ($\mathcal{F}$, $b$, ${\phi}$, ${\rho}$, ${\theta}$)-sounivexity assumptions for a multiobjective programming problem containing arbitrary norms.

• Journal of the Korean Mathematical Society
• /
• v.57 no.4
• /
• pp.1019-1030
• /
• 2020

Efficient computation of r-th root in 𝔽_q has many applications in computational number theory and many other related areas. We present a new r-th root formula which generalizes Müller's result on square root, and which provides a possible improvement of the Cipolla-Lehmer type algorithms for general case. More precisely, for given r-th power c ∈ 𝔽_q, we show that there exists α ∈ 𝔽_q^r such that $$Tr{\left(\begin{array}{cccc}{{\alpha}^{{\frac{({\sum}_{i=0}^{r-1}\;q^i)-r}{r^2}}}\atop{\text{ }}}\end{array}\right)}^r=c,$$ where $Tr({\alpha})={\alpha}+{\alpha}^q+{\alpha}^{q^2}+{\cdots}+{\alpha}^{q^{r-1}}$ and α is a root of certain irreducible polynomial of degree r over 𝔽_q.