HackerPapers

arXiv:2109.14652cs.CR

Seeds of SEED: A Side-Channel Resilient Cache Skewed by a Linear Function over a Galois Field

Scott Constable, Thomas Unterluggauer

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

Consider a set-associative cache with $p^n$ sets and $p^n$ ways where $p$ is prime and $n>0$. Furthermore, assume that the cache may be shared among $p^n$ mutually distrusting principals that may use the Prime+Probe side-channel attack against one another; architecturally, these principals occupy separate security domains (for example, separate processes, virtual machines, sandboxes, etc.). This paper shows that there exists a linear skewing of cache sets over the Galois field $G_{p^n}$ that exhibits the following property: each cache set of each security domain intersects every cache set of every other security domain exactly once. Therefore, a random eviction from a single cache set in security domain $A$ may be observed via Prime+Probe in any of security domain $B$'s cache sets. This paper characterizes this linear skewing and describes how it can be implemented efficiently in hardware.

arXiv comments
8 pages, 5 figures
Journal reference
DOI
doi:10.1109/SEED51797.2021.00012
Subjects
cs.CRCryptography and Security cs.ARHardware Architecture

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Oct 2021 to Oct 2021. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.