Skip to main content
Tweeted twitter.com/StackCrypto/status/1179229557481771008
Became Hot Network Question
correct formatting; lead with the question and not with related material
Source Link

My question is a continuation of the question here.

It has been shown that AES keys can be identified in memory1AES keys that are in use can be identified in memory. This identification relies on discovering expected round keys in memory that are contained within the key schedulekey schedule.

My question is: can we, by extension, assume that the same technique, at least theoretically, can be used to extract SerpentSerpent and TwofishTwofish keys from memory since they both have a key schedule2key schedule as well??

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

(See also Extracting RC4 and 3DES keys from system memory)

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??

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

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

(See also Extracting RC4 and 3DES keys from system memory)

added 25 characters in body
Source Link
learnerX
  • 687
  • 1
  • 8
  • 15

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??

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

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 can be used to extract Serpent and Twofish keys from memory since they both have a key schedule2 as well??

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

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??

  1. https://github.com/makomk/aeskeyfind
  2. https://en.wikipedia.org/wiki/Key_schedule
Source Link
learnerX
  • 687
  • 1
  • 8
  • 15

Is it possible to identify a Serpent encryption key in memory?

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 can be used to extract Serpent and Twofish keys from memory since they both have a key schedule2 as well??

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