Proceedings of the Korea Institutes of Information Security and Cryptology Conference (한국정보보호학회:학술대회논문집)
- 1995.11a
- /
- Pages.200-210
- /
- 1995
The design of a secure hash function using Dickson polynomial
- Nyang, Dae-Hun (Dept. of Computer Science, Yonsei University) ;
- Park, Seung-Joon (Dept. of Computer Science, Yonsei University) ;
- Song, Joo-Seok (Dept. of Computer Science, Yonsei University)
- Published : 1995.11.01
Abstract
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.
Keywords