• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.4
• /
• pp.37-48
• /
• 1999

Current encryption methods have been applied to secure communication using discrete chaotic system whose output is a noise-like signal which differs from the conventional encryption methods that employ algebra and number theory[1-2] We propose an optical encryption method that transforms the primary pattern into the image pattern of discrete chaotic function first a primary pattern is encoded using permutation algorithm, In the proposed system we suggest the permutation algorithm using the output of key steam generator and its security level is analyzed. In this paper we worked out problem of the application about few discrete chaos function through a permutation algorithm and enhanced the security level. Experimental results with image signal demonstrate the proper of the implemented optical encryption system.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.4
• /
• pp.1145-1155
• /
• 2007

In this paper, we consider the permutation tests for the multivariate data under the two-sample problem setting. We review some testing procedures, which are parametric and nonparametric and compare them with the permutation ones. Then we consider to try to apply the permutation tests to the multivariate data having the continuous and discrete components together by choosing some suitable combining function through the partial testing. Finally we discuss more aspects for the permutation tests as concluding remarks.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.5
• /
• pp.3-14
• /
• 2007

In this paper, we observe that secure tweakable permutation families in the sense of strong pseudorandom permutation (SPRP) can be transformed to secure permutation families in the sense of SPRP against related-key attacks (SPRP-RKA). This fact allows us to construct a secure SPRP-RKA which is the most efficient to date. We also observe that secure function families of a certain form in the sense of a pseudorandom function (PRF) can be transformed to secure permutation families in the sense of PRP-RKA. We can exploit it to get various secure constructions against related-key attacks from known MAC algorithms. Furthermore, we define other security notions for related-key attacks, namely indistinguishability and non-malleability, and look into the relations between the security notions fur related-key attacks. We show that secure tweakable permutation families in the sense of indistinguishability (resp. non-malleability) can be transformed to secure permutation families in the sense of indistinguishability (resp. non-malleability) against related-key attacks.

• 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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.1
• /
• pp.42-48
• /
• 2008

The house of quality (HOQ) involves subjective and ambiguous information typically through a likert scale, It isimportant to validate consistency of such input in the HOQ before rating the fmal importance of technicalrequirements, Previously, a methodology was developed to test the consistency of relationship strengths in theHOQ between roof matrix and relationship matrix. We described disadvantages of the previous method andpropose a new approach based on the permutation test. Advantages of the proposed method are illustrated withan example.

• Journal of the Korean Mathematical Society
• /
• v.58 no.4
• /
• pp.921-948
• /
• 2021

We continue the investigations in [6] extending the Bruhat order on n × n alternating sign matrices to our more general setting. We show that the resulting partially ordered set is a graded lattice with a well-define rank function. Many illustrative examples are given.

• Journal of the Korean Mathematical Society
• /
• v.54 no.4
• /
• pp.1149-1161
• /
• 2017

An ($n_1,\;n_2,\;{\ldots},\;n_k$)-colored permutation is a permutation of $n_1+n_2+{\cdots}+n_k$ in which $1,\;2,\;{\ldots},\;n_1$ have color 1, and $n_1+1,\;n_1+2,\;{\ldots},\;n_1+n_2$ have color 2, and so on. We give a bijective proof of Steinhardt's result: the number of colored permutations with no monochromatic cycles is equal to the number of permutations with no fixed points after reordering the first $n_1$ elements, the next $n_2$ element, and so on, in ascending order. We then find the generating function for colored permutations with no monochromatic cycles. As an application we give a new proof of the well known generating function for colored permutations with no fixed colors, also known as multi-derangements.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.3
• /
• pp.1451-1458
• /
• 2013

This paper deals with the programs and algorithms that generate the full data set that satisfy the basic combinatorial requirement of combination, permutation, partial permutation or shortly r-permutation, which are used in the application of the total data testing or the simulation input. We search the programs able to meet the rules which is permutations and combinations, r-permutations, select the fastest program by field. With further study, we developed a new program reducing the time required to processing. Our research performs the following pre-study. Firstly, hundreds of algorithms and programs in the internet are collected and corrected to be executable. Secondly, we measure running time for all completed programs and select a few fast ones. Thirdly, the fast programs are analyzed in depth and its pseudo-code programs are provided. We succeeded in developing two programs that run faster. Firstly, the combination program can save the running time by removing recursive function and the r-permutation program become faster by combining the best combination program and the best permutation program. According to our performance test, the former and later program enhance the running speed by 22% to 34% and 62% to 226% respectively compared with the fastest collected program. The programs suggested in this study could apply to a particular cases easily based on Pseudo-code., Predicts the execution time spent on data processing, determine the validity of the processing, and also generates total data with minimum access programming.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.733-746
• /
• 2023

Let (X, d) be a semimetric space. A permutation Φ of the set X is a combinatorial self similarity of (X, d) if there is a bijective function f : d(X × X) → d(X × X) such that d(x, y) = f(d(Φ(x), Φ(y))) for all x, y ∈ X. We describe the set of all semimetrics ρ on an arbitrary nonempty set Y for which every permutation of Y is a combinatorial self similarity of (Y, ρ).

• Journal of the Korean Statistical Society
• /
• v.25 no.4
• /
• pp.499-514
• /
• 1996

Consider an additive regression model of Y on X = (X$_1$,X$_2$,. . .,$X_p$), Y = $sum_{j=1}^pf_j(X_j) + $\varepsilon$$, where $f_j$s are smooth functions to be estimated and $\varepsilon$ is a random error. If $X_j$s are fixed design points, we call it the fixed design additive model. Since the response variable Y is observed at fixed p-dimensional design points, the behavior of the nonparametric regression estimator depends on the design. We propose a fixed design called permutation fixed design, and fit the regression function by the kernel method. The estimator in the permutation fixed design achieves the univariate optimal rate of convergence in mean squared error for any p $\geq$ 2.