• 정보보호학회논문지
• /
• 제17권3호
• /
• pp.3-15
• /
• 2007

본 논문에서는, 기존의 암호시스템에 사용되는 치환상자(S-box)를 변형시키는 방법을 제안한다. 제안된 기법은 부울(Boolean) 함수의 벡터공간 상에서의 표현을 유한체 상에서의 다항식으로 변환하는 방법을 이용한다. Rijndael 암호시스템의 치환상자에 제안된 기법을 적용하여, 치환상자를 구성하는 부울 함수의 선형복잡도가 증가한 새로운 치환상자를 생성한다. 변환 영역 해석 (Transform Domain Analysis)을 중심으로 이들의 암호학적 특성을 분석한다.

• 대한수학회지
• /
• 제37권4호
• /
• pp.545-563
• /
• 2000

An integral transform with the Bessel function Jv(z) in the kernel is considered. The transform is relatd to a singular Sturm-Liouville problem on a half line. This relation yields a Plancherel's theorem for the transform. A Paley-Wiener-type theorem for the transform is also derived.

• Korean Journal of Mathematics
• /
• 제24권4호
• /
• pp.693-722
• /
• 2016

In this paper, we characterize the support for the Dunkl transform on the generalized Lebesgue spaces via the Dunkl resolvent function. The behavior of the sequence of $L^p_k$-norms of iterated Dunkl potentials is studied depending on the support of their Dunkl transform. We systematically develop real Paley-Wiener theory for the Dunkl transform on ${\mathbb{R}}^d$ for distributions, in an elementary treatment based on the inversion theorem. Next, we improve the Roe's theorem associated to the Dunkl operators.

• Korean Journal of Mathematics
• /
• 제23권1호
• /
• pp.129-151
• /
• 2015

In this paper, we prove an $L^p$ version of Donoho-Stark's uncertainty principle for the inverse of the hypergeometric Fourier transform on $\mathbb{R}^d$. Next, using the ultracontractive properties of the semigroups generated by the Heckman-Opdam Laplacian operator, we obtain an $L^p$ Heisenberg-Pauli-Weyl uncertainty principle for the inverse of the hypergeometric Fourier transform on $\mathbb{R}^d$.

• 대한수학회논문집
• /
• 제18권1호
• /
• pp.39-57
• /
• 2003

Some inequalities for the Hilbert transform of the product of two functions are given.

• Journal of applied mathematics & informatics
• /
• 제30권3_4호
• /
• pp.555-560
• /
• 2012

In this paper, differential transform method (DTM) is considered to obtain solution to the generalized Fisher's equation. This method is easy to apply and because of high level of accuracy can be used to solve other linear and nonlinear problems. Furthermore, is capable of reducing the size of computational work. In the present work, the generalization of the two-dimensional transform method that is based on generalized Taylor's formula is applied to solve the generalized Fisher equation and numerical example demonstrates the accuracy of the present method.

• 대한수학회보
• /
• 제52권5호
• /
• pp.1607-1619
• /
• 2015

We investigate some generalization of a class of Hankel-Clifford transformations having Fox H-function as part of its kernel on a class of Boehmians. The generalized transform is a one-to-one and onto mapping compatible with the classical transform. The inverse Hankel-Clifford transforms are also considered in the sense of Boehmians.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(3)
• /
• pp.23-26
• /
• 2000

In this paper, to perform iris recognition, the iris is changed to 1-D iris signature and methods of efficient iris pattern transformation are discussed. To represent iris signature's frequency characteristics, Fourier transform, Gabor filtering, and wavelet transform are proposed. The consistency between same person's iris and the discrimination between different person's iris are defined by using correlation. Based on these, three transform methods are compared and analyzed.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제8권1호
• /
• pp.31-40
• /
• 2004

In this paper we point out an approximation for the Fourier transform for functions of bounded variation and study the approximation error of certain associated quadrature rules.

• International Journal of Reliability and Applications
• /
• 제3권4호
• /
• pp.199-202
• /
• 2002

In this paper, we obtain an explicit formula of the Laplace transform of the forward recurrence time at finite time t > 0 in an alternating renewal process, by adopting a Markovian approach. As a consequence, we obtain the first two moments of the forward recurrence time.