Re: Weakness of Feistel ciphers
- From: kim@xxxxxxxxxxx (Kim G. S. Øyhus)
- Date: Thu, 20 Apr 2006 07:19:09 +0000 (UTC)
In article <06kih3-94n1.ln1@xxxxxxxxxxxxxxxxxxxxx>,
Kristian Gjøsteen <kristiag+news@xxxxxxxxxxxx> wrote:
Kim G. S. Øyhus <kim@xxxxxxxxxxx> wrote:
And how am I to know how many times i must iterate to decrypt?
If you think for a moment, you realise that you should stop when
you get a result less than the modulus. That is how many times
you must iterate.
And that is precisely what I thought tonight, in bed, away from Usenet.
Nice method, but with 2 disadvantages I can see now:
1. It is definitely slower than the cipher it is built upon.
2. It is only suitable for small decrements in the logarithm of its range.
i.e. it works badly if one wants to do 128bit -> 100bit because it
gets extremely slow.
I might still use the method some time, f.ex. in monte carlo integration,
but not now.
Kim0
.
- Follow-Ups:
- Re: Weakness of Feistel ciphers
- From: Paul Rubin
- Re: Weakness of Feistel ciphers
- References:
- Weakness of Feistel ciphers
- From: Kim G. S. Øyhus
- Re: Weakness of Feistel ciphers
- From: Kristian Gjøsteen
- Re: Weakness of Feistel ciphers
- From: Kim G. S. Øyhus
- Re: Weakness of Feistel ciphers
- From: Kristian Gjøsteen
- Weakness of Feistel ciphers
- Prev by Date: Re: AES Timing Attack Implementation & Karl Malbrain code...
- Next by Date: Re: Weakness of Feistel ciphers
- Previous by thread: Re: Weakness of Feistel ciphers
- Next by thread: Re: Weakness of Feistel ciphers
- Index(es):