Skip to content

Comment on SeL4 security proofs now complete on AArch64parent

Comments

I'm not so sure. It's pretty hard to know how many cycles a register load instruction will take if there is a cache, or worse a cache hierarchy. That's why I think it will be a lot easier to have a proof on simple cache less designs...

Your version is likely good enough in practice though.

You don't need to know how long a load will take, you just need to know the duration doesn't depend on secret data.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.