Re: A poorman's block encryption algorithm
 From: MokKong Shen <mokkong.shen@xxxxxxxxxxx>
 Date: Fri, 12 Mar 2010 18:24:59 +0100
Maaartin wrote:
There's a problem with polynomials you was already told about: They
propagate only towards higher bits (unless you use nonpower of two
modulus which is slow). So you can be sure, that a couple of least
significant bits can be found out easily, no matter how many rounds
you do. Starting from them, higher bit can be found, etc. I already
recomennded a remedy, so use it or find another.
Extremely sorry for my poor memory. Could you kindly sketch your remedy
once again or provide a pointer? Concerning predictability of
congruential PRNGs, I previously suggested to use (pseudorandom)
cyclic shift of bits in computer words of the output as a counter
measure. That could also be done in the present context.
Thanks,
M. K. Shen
.
 FollowUps:
 Re: A poorman's block encryption algorithm
 From: Maaartin
 Re: A poorman's block encryption algorithm
 References:
 A poorman's block encryption algorithm
 From: MokKong Shen
 Re: A poorman's block encryption algorithm
 From: Maaartin
 A poorman's block encryption algorithm
 Prev by Date: Re: A poorman's block encryption algorithm
 Next by Date: Re: Why is Kerberos ever used, rather than modern public key cryptography?
 Previous by thread: Re: A poorman's block encryption algorithm
 Next by thread: Re: A poorman's block encryption algorithm
 Index(es):
Relevant Pages
