2018 IEEE 36th International Conference on Computer Design (ICCD) 2018
DOI: 10.1109/iccd.2018.00020
|View full text |Cite
|
Sign up to set email alerts
|

A Timing Side-Channel Attack on a Mobile GPU

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 21 publications
(13 citation statements)
references
References 10 publications
0
12
0
Order By: Relevance
“…Side channel attacks on mobile GPUs. Existing attacks on mobile GPUs used GPU timing information to infer ciphertexts in AES encryption [27], and reverse engineered GPU hardware to implement Rowhammer attack on GPU memory [11]. These attacks, however, are not focusing on eavesdropping keyboard inputs and are orthogonal to our work.…”
Section: Moving Circles and Trianglesmentioning
confidence: 99%
“…Side channel attacks on mobile GPUs. Existing attacks on mobile GPUs used GPU timing information to infer ciphertexts in AES encryption [27], and reverse engineered GPU hardware to implement Rowhammer attack on GPU memory [11]. These attacks, however, are not focusing on eavesdropping keyboard inputs and are orthogonal to our work.…”
Section: Moving Circles and Trianglesmentioning
confidence: 99%
“…To port the implementation, we need to decide where to store T-tables in the GPU memory hierarchy and how to assign encryption jobs to GPU threads. In our prior work [13,16] we stored T-tables in the Global Memory unit, but the implementation becomes vulnerable to coalescing attacks [13,16]. Since T-tables are constant data and shared by all threads, they are a good candidate to store in the Shared Memory unit.…”
Section: Aes Encryptionmentioning
confidence: 99%
“…As an example, assuming a stride value 16, for a memory access instruction issued across a warp of 32 threads, we will generate the following 32 memory indices: {0, 16,32,48,64,80,96,112,128,144,160,176,192,208,224,240,256,272,288,304,320,336,352,368,384,400,416,432,448,464, 480, 496}. Using Equation 3, we have the following bank access indices for the warp: {0, 8,16,24,0,8,16,24,0,8,16,24,0,8,16,24,0,8,16,24,0,8,16,24,0,8,16,…”
Section: Cache Bank Conflicts-based Side-channel Timing Channelmentioning
confidence: 99%
See 2 more Smart Citations