One-way compression function: Difference between revisions

Revision as of 12:03, 24 May 2022

Revision as of 12:04, 24 May 2022

Line 119:

== Miyaguchi–Preneel ==

[[Image:Miyaguchi-Preneel hash.svg|thumb|230px|right|The Miyaguchi–Preneel one-way compression function]]

The Miyaguchi–Preneel single-block-length one-way compression function is an extended variant of Matyas–Meyer–Oseas. It was independently proposed by [[Shoji Miyaguchi]] and [[Bart Preneel]].

It feeds each block of the message (<math>m_i</math>) as the plaintext to be encrypted. The output ciphertext is then XORed (⊕) with the same message block (<math>m_i</math>) and then also XORed with the previous hash value (<math>H_{i-1}</math>) to produce the next hash value (<math>H_i</math>). The previous hash value (<math>H_{i-1}</math>) is fed as the key to the block cipher. In the first round when there is no previous hash value it uses a constant pre-specified initial value (<math>H_0</math>).

Line 156 ⟶ 158:

Hirose also provides a proof in the Ideal Cipher Model.

== Sponge construction==

The [[sponge construction]] can be used to build one-way compression functions.

== See also ==