Re: Question on CFB variant with c[i-N]
17 Dec
2003
17 Dec
'03
11:17 p.m.
cfb Ciphertext feeback mode c[i] = f1(K, c[i-1]) ^ p[i] p[i] = f1(K, c[i-1]) ^ c[i]
Suppose instead of c[i-1] you use c[i-N] where N is say 10.
Wouldn't the size of your IV have to grow as N grows? Jim Russell SynData Technologies
7720
Age (days ago)
7720
Last active (days ago)
0 comments
1 participants
participants (1)
-
Jim Russell