Talk:Protecting Memory Secrets: Difference between revisions
Content added Content deleted
(→Perhaps missing the point: new section) |
|||
| Line 51: | Line 51: | ||
In other words, secrets need to be mixed in with garbage such that a snoop has a high probability of picking up plausible looking garbage when looking for secrets. |
In other words, secrets need to be mixed in with garbage such that a snoop has a high probability of picking up plausible looking garbage when looking for secrets. |
||
Worse, from a rosettacode point of view, the fact that there is no "task" here, means that there's no way for us to compare implementations, let along judge the viability of any claims about implementations for the general case. (We might judge in the context of specific machines, but without intimate knowledge of the machine architecture we'll have difficulty even there.) --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 03:31, 13 January 2023 (UTC) |
Worse, from a rosettacode point of view (partially because the approach outlined here can assist in the creation of plausible looking garbage), the fact that there is no "task" here, means that there's no way for us to compare implementations, let along judge the viability of any claims about implementations for the general case. (We might judge in the context of specific machines, but without intimate knowledge of the machine architecture we'll have difficulty even there.) --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 03:31, 13 January 2023 (UTC) |
||