@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?
@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.
@kelalaka FYI: If you write [so] in a comment or here in chat it will auto-expand to Stack Overflow. Similar rules apply for [<site-name-in-url.se>], e.g. Mathematics.
When you know the Salsa20's keystream, how do you know the next keystream?
In other words, can I infer the next keystream when I don't know the Key and IV of Salsa20, but the keystream is 0x100000?
If you have any related attack papers, please recommend it.
Or, I'd like to ask for some search key...
The Side Channel
The Side Channel