An application of index forms in cryptography (Q1046753): Difference between revisions

\textit{A. Bérczes} and \textit{J. Ködmön} [Publ. Math. 63, No. 4, 751--768 (2003; Zbl 1050.11103)] investigated the possibility of cryptographical applications of norm forms. They provided a detailed complexity analysis of the computation of values of norm forms, and suggested the use of a hash function based on norm form. Moreover they proved that in a probabilistic sense their hash function is collision resistant. In this paper the possibility of using index forms was investigated as basic ingredients of cryptographically important functions. The authors prove some important properties of the hash function based on index forms, e.g. about properties of the probability of collision for their function. They also gave an application for this construction where they used one of the roots of the following polynomial: \[ x^7+x^6-6x^5-5x^4+8x^3+5x^2-2x-1. \] Using their results they proved that the suggested function was collision resistant and was also promising form point of view of the avalanche effect. These facts guarantee its security.