My question is a continuation of the question here.
It has been shown that AES keys can be identified in memory1. 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 schedule2 as well??