- مبلغ: ۸۶,۰۰۰ تومان
- مبلغ: ۹۱,۰۰۰ تومان
The design of family of hash function based syndrome and its variants are based on a compression function, that uses a parity check matrix of an error correcting code (random, quasi-cyclic). The objective of this paper is to propose a one-way hash function (OHFGC) of variable size based on classical Goppa codes and the scheme of MERKLE and DAMGARAD. Classical Goppa codes, of pseudo-random characteristic, for regenerating parity check matrix from a primitive element of a finite field F m2 and an integer n m > 2 , and for the design of the compression function. The scheme of MERKLE and DAMGARAD [4,5,6] whose the compression function is based on the calculation of syndromes, the initial vector specific to each message and the reduction function of weight of a given word.