• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1995.11a
• /
• pp.200-210
• /
• 1995

Almost all hash functions suggested up till now provide security by using complicated operations on fixed size blocks, but still the security isn't guaranteed mathematically. The difficulty of making a secure hash function lies in the collision freeness, and this can be obtained from permutation polynomials. If a permutation polynomial has the property of one-wayness, it is suitable for a hash function. We have chosen Dickson polynomial for our hash algorithm, which is a kind of permutation polynomials. When certain conditions are satisfied, a Dickson polynomial has the property of one-wayness, which makes the resulting hash code mathematically secure. In this paper, a message digest algorithm will be designed using Dickson polynomial.

• Korean Journal of Radiology
• /
• v.25 no.7
• /
• pp.656-661
• /
• 2024

Evaluating the performance of a binary diagnostic test, including artificial intelligence classification algorithms, involves measuring sensitivity, specificity, positive predictive value, and negative predictive value. Particularly when comparing the performance of two diagnostic tests applied on the same set of patients, these metrics are crucial for identifying the more accurate test. However, comparing predictive values presents statistical challenges because their denominators depend on the test outcomes, unlike the comparison of sensitivities and specificities. This paper reviews existing methods for comparing predictive values and proposes using the permutation test. The permutation test is an intuitive, non-parametric method suitable for datasets with small sample sizes. We demonstrate each method using a dataset from MRI and combined modality of mammography and ultrasound in diagnosing breast cancer.

• Journal of Internet Technology
• /
• v.21 no.4
• /
• pp.1013-1024
• /
• 2020

In this paper, we introduce an image encryption algorithm that can be used in combination with compression algorithms. Existing encryption algorithms focus on either encryption strength or speed without compression, whereas the proposed algorithm improves compression efficiency while ensuring security. Our encryption algorithm decomposes images into pixel values and pixel intensity subsets, and computes the order of permutations. An encrypted image becomes unpredictable after permutation. Order permutation reduces the discontinuity between signals in an image, increasing compression efficiency. The experimental results show that the security strength of the proposed algorithm is similar to that of existing algorithms. Additionally, we tested the algorithm on the JPEG and the JPEG2000 with variable compression ratios. Compared to existing methods applied without encryption, the proposed algorithm significantly increases PSNR and SSIM values.

• Honam Mathematical Journal
• /
• v.34 no.4
• /
• pp.483-494
• /
• 2012

The set of all polynomial permutations of $\mathbb{Z}_{p^r}$ forms a group. We investigate the structure of the group and some related groups, and completely determine the structure of the group of all polynomial permutations of $\mathbb{Z}_{p^2}$.

• The Korean Journal of Applied Statistics
• /
• v.14 no.1
• /
• pp.191-199
• /
• 2001

본 소고는 n명의 심사자가 k개의 객체를 평가하여 얻어진 불완전 순위자료에서 객체간 선호도에 있어 차이가 없다는 영가설을 검정하는 방법에 관한 연구이다. 주어진 자료에서 결측값들을 다중대체하는 방식을 제안하고 이들을 평균 p-값으로 묶는 몬테칼로방식의 임의순열 검정을 제안한다.

• Journal for History of Mathematics
• /
• v.19 no.3
• /
• pp.85-94
• /
• 2006

We review Galois rings and permutation polynomials over Galois rings with emphasis on cryptological properties of Dickson polynomials and conclude that it is not plausible to obtain the Dickson scheme which has a Galois ring as a plaintext space.

• Communications of the Korean Mathematical Society
• /
• v.10 no.4
• /
• pp.823-829
• /
• 1995

In this paper, we prove that $x^{1+\frac{q-1}{5}} + ax (a \neq 0)$ is not a permutation polynomial over $F_{q^r} (r \geq 2)$ and we show some properties of $x^{1+\frac{q-1}{m}} + ax (a \neq 0)$ over $F_{q^r} (r \geq 2)$.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.888-891
• /
• 2002

Banyan network is a popular and basic structure of the multistage ATM switches. This paper presents a novel approach to resolve the internal blocking of the banyan network by using Non-Blocking Permutation Generator (NBPG). The NBPG performs two functions, i.e., the first is to extract the conflict cells from the incoming cells and the second is to re-assign new input port addresses to the conflict cells. As a result, NBPG generates non-blocking I/O permutations. To estimate the performance of NBPG, we provide several simulation results.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.1
• /
• pp.115-127
• /
• 1996

Based on a job insertion method, we developed a heuristic algorithm for the mean flowtime objective in a permutation flowshop environment. The simulation experiments are implemented to evaluate the effectiveness of the proposed algorithm against the existing heuristics. The experiments reveal the superiority of the proposed algorithm to other heuristics especially when the ratio of the number of jobs and number of machines is greater than or equal to two.

• Communications for Statistical Applications and Methods
• /
• v.7 no.3
• /
• pp.799-809
• /
• 2000

In this paper we propose a nonparametric one sided test for location parameters in p-variate(p$\geq$2) location translation model. The exact null distributions of test statistics are calculated by permutation principle in the case of relatively small sample sizes and the asymptotic distributions are also considered. The powers of various tests are compared through computer simulation and thep-values with real data are also suggested through example.