Re: A basic question about hashing
From: MokKong Shen (mokkong.shen_at_tonline.de)
Date: 09/15/04
 Next message: MokKong Shen: "Re: A simple idea of text steganography"
 Previous message: MokKong Shen: "Re: A basic question about hashing"
 In reply to: MokKong Shen: "A basic question about hashing"
 Next in thread: MokKong Shen: "Re: A basic question about hashing"
 Reply: MokKong Shen: "Re: A basic question about hashing"
 Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Wed, 15 Sep 2004 11:27:39 +0200
MokKong Shen wrote:
.... I have actually also a second and simpler scheme
that employs similar methodology, which I like to mention
here: One employs a bijective polynomial to do the same
as a block cipher does in CBC. The process, if desired,
could be repeated, i.e. with the last value used as IV
for the next round, preferrably with a different polynomial.
(The final value could also be polynomial transformed a
last time.)
It may be mentioned that the motivation is that (1) While
a block cipher has a key and is invertible, a bijective
polynomial has no key and is (assumed to be) hard to invert,
which is what hashing would need, (2) The analogous CBCMAC
has been shown to be of value in practice and (3) Other
appropriate block chaning modes could be employed in place
of CBC, if desired, e.g. using the sum of all previous
outputblocks (corresponding to ciphertext blocks) to chain
instead of using simply the previous output block from the
polynomial.
M. K. Shen
 Next message: MokKong Shen: "Re: A simple idea of text steganography"
 Previous message: MokKong Shen: "Re: A basic question about hashing"
 In reply to: MokKong Shen: "A basic question about hashing"
 Next in thread: MokKong Shen: "Re: A basic question about hashing"
 Reply: MokKong Shen: "Re: A basic question about hashing"
 Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
