// COMPLETE THREAD

Re: Question on CFB variant with c[i-N]

1 expanded post ยท every known parent and child

NODE 09db2a5fRe: Question on CFB variant with c[i-N]
>>>              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