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

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

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.4
• /
• pp.779-790
• /
• 2000

Let $D_3$ be the Dickson invariant algebra of $F_2[X_1,\; X_2,\; X_3] \; by \; GL(3,\; F_2)$. In this paper, we provide an elementary proof of Theorem 3.2 of [2]; each element in $D_3$ is hit by the Steenrod square in $F_2[X_1,\; X_2,\; X_3]$.

• Communications of the Korean Mathematical Society
• /
• v.24 no.2
• /
• pp.171-180
• /
• 2009

In this paper, we give three criteria for non-polynomial functions interpolated from the set of univariate polynomials of degree less than m over a finite field to be a permutation on the same set.