My question is a continuation of the question [here][1].

It has been shown that `AES` keys can be identified in memory<sup>1</sup>. This identification relies on discovering expected *round keys* in memory that are contained within the `key schedule`. 

My question is: can we, by extension, assume that the same technique, at least theoretically, can be used to extract `Serpent` and `Twofish` keys from memory since they both have a key schedule<sup>2</sup> as well??


  [1]: https://crypto.stackexchange.com/questions/74586/extracting-rc4-and-3des-keys-from-system-memory

> 1. https://github.com/makomk/aeskeyfind
> 2. https://en.wikipedia.org/wiki/Key_schedule