Journal ArticleDOI
Cryptanalysis of a Hash Function Based on Norm Form Equations
Reads0
Chats0
TLDR
It is demonstrated that the cryptographic hash function Codefish is insecure for cryptographic applications by presenting practical attacks for solving the problems Second Preimage and Collision.Abstract:
The cryptographic hash function Codefish is an outcome of a research project led by the company KRIPTO Research and the University of Debrecen in Hungary and sponsored by the European Union and the Hungarian Government. It is commercialised by KRIPTO Research for use in security protocols like digital signature, authentication, or message checksum. Codefish benefits from strong mathematical foundations, since it grounds its security on the difficulty of solving norm form equations. This paper demonstrates that it is insecure for cryptographic applications by presenting practical attacks for solving the problems Second Preimage and Collision.read more
Citations
More filters
Journal ArticleDOI
On a family of preimage-resistant functions
TL;DR: It is proved that (working in a large enough finite field) finding a preimage by chance of such a function is computationally infeasible, and it is mentioned that methods for solving the equation corresponding to the preimage problem for such polynomials are also out of reach.
Journal ArticleDOI
Notes on a preimage-resistant hash function
TL;DR: In this article, a necessary and sufficient condition for being planar is given for Dembowski-Ostrom monomials, and in the even characteristic case both a weaker asymptotic statement and practical test results are presented regarding the avalanche criterion.
References
More filters
Journal ArticleDOI
Inversion of circulant matrices over Z m
TL;DR: In this paper, the problem of inverting an n A-n circulant matrix with entries over Zm was considered, and three different algorithms were presented for this problem.
Journal ArticleDOI
A one-way function based on norm form equations
TL;DR: It is proved that this function is collision resistant, so it can be used as a one- way hash function, and it is shown that this construction probably provides a family of one-way functions.
Book ChapterDOI
Inversion of Circulant Matrices over Zm
TL;DR: The algorithm for inverting circulants, based on the reduction to diagonal form by means of FFT, has some drawbacks when working over Z m, and three different algorithms which do not use this approach are presented.