Fast hash functions and convolution product

Journal of mathematical cryptology

article

Sami Omar¹  Houssem Sabri¹ 

[1] Department of Mathematics, Faculty of Science of Tunis, 2092 Campus Universitaire El Manar

关键词: Hash functions;    knapsack hash;    Toeplitz hash;    SWIFFT;    FFT;   

DOI  :  10.1515/jmc-2013-0014

学科分类：社会科学、人文和艺术（综合）

来源: De Gruyter

【 摘 要 】

Abstract. We propose a new simple and efficient family of hash functions based on matrix-vector multiplications with a competitive software implementation. The hash design combines a hard mathematical problem based on solving a system of linear equations with special-random requirements and the fast computation of the convolution product algorithm. Such a mixing was often unrealizable. For security, the one-way and collision resistant criteria are based on the fact that inverting the compression function for random values is infeasible in reasonable time. In a subsequent result, we conjecture a general framework for producing secure matrix multiplication hash functions.

【 授权许可】

CC BY|CC BY-NC-ND