It has been shown that [AES keys that are in use can be identified in memory][1]. 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][2] as well??

(See also 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