@b degnan; Just made an answer with speculations on silicon technology applied to key search for 3DES with 2 keys, there. Main hypothesis (in study case 2) is an IC with a total 2 GByte of memory (e.g. DRAM or Flash) able to perform 256 searches in // at 3.7ns per search. Can you tell how far off that is?

If someone has a link to a justification of why NIST assigns 80-bit security to 2-Key Triple DES, it's welcome!

@fgrieu what happen to Wiener's work?

@kelalaka His article is in the JOC, and gets cited (example). On triple encryption with 2 keys, he only gives an asymptotic bound that "ignores the need for an enormous number of chosen plaintexts", thus not directly reducible to practice as far as I can see.

I see. You had little typos, there.

Good

(this might be more clear to people than actually writing "SO")

Tested and works, thanks.

WTF?

Ach, Stack Overflow.