[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: CYPHERPUNKS TO THE RESCUE
In message <[email protected]> FutureNerd Steve Witham writes:
> But this raises an idle question: how much easier is it to break
> a DES key given a sequence of (n, DES(n)) where the n's are
> successive numbers, than it is if the n's are random (but still
> known)? I doubt this is a practical threat for garage doors.
This would be a known plaintext attack, well suited to differential
cryptanalysis.
Though the lifetime of the average garage door opener is probably small
enough that it would die before you had enough plaintext/ciphertext
pairs for a good attack