Speed of Davies attack
- From: Nikola Skoric <nick-news@xxxxxxxx>
- Date: Sun, 30 Sep 2007 12:24:01 +0000 (UTC)
I have skimmed through "Pairs and Triplets of DES S-Boxes" by Davies
and Murphy, and "An Improvement of Davies' Attack on DES" by Biham and
Biryukov, but I'm no expert in cryptanalysis, I'm still learning. So,
if anyone could tell me in simple language, this Biham-Biryukov
improvement od Davies' attack, how faster is it than brute force? Can
I ask something like "if breaking DES by brute force took 1 year, how
much would inproved Davies take"? Can efficiency of cryptanalytic
attacks be discussed in such a terms?
--
"Now the storm has passed over me
I'm left to drift on a dead calm sea
And watch her forever through the cracks in the beams
Nailed across the doorways of the bedrooms of my dreams"
.
- Prev by Date: Re: ADVERT: Secure comms
- Next by Date: how to accomplish berlekamp-massey algorithm
- Previous by thread: Re: The specialist in terms of Steven
- Next by thread: how to accomplish berlekamp-massey algorithm
- Index(es):
Relevant Pages
|
|