Pith. sign in

REVIEW 4 major objections 7 minor 44 references

SleepWalk: Exploiting Context Switching and Residual Power for Physical Side-Channel Attacks

T0 review · 4 major / 7 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A sleep call's power spike leaks cryptographic keys, the paper argues, by encoding both register state and residual power from prior computation.

desk verdict The sleep-spike leak observation is plausible and novel, but the AES attack is circular as written and the SIKE attack lacks statistics, so the paper overreaches. read the letter →

arxiv 2507.22306 v1 pith:QVT2PJVN submitted 2025-07-30 cs.CR

Sahan Sanjaya , Aruna Jayasena , Prabhat Mishra This is my paper · ORCID
classification cs.CR
keywords sleep-inducedpowerspikecontextswitchsidechannelresidualsignatureHammingweightmodelsingle-pointanalysisSIKEkeyrecoveryAES-128BCM2711
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

SleepWalk is a physical power side-channel that reads a single power spike at the moment the OS sleep function triggers a context switch, and shows that the spike's amplitude encodes both the power cost of saving and restoring registers and the residual power left over from the program that just ran. The paper demonstrates that this one sampling point, without trace alignment, external triggers, or preprocessing, is enough to recover the full secret key from SIKE decapsulation and ten of sixteen final-round bytes from AES-128 on the BCM2711. The authors build a power model relating the spike to Hamming weight of register data, Hamming weight and Hamming distance of processed data, and the number of executed instructions, via a power-temperature feedback loop. If true, this reduces the cost of a physical attack to measuring one voltage value after a sleep call, and extends the leak beyond live register contents to the history of prior computation.

What carries the argument

The central object is the sleep-induced power spike, a single high-amplitude sampling point at the onset of a context switch triggered by the kernel's built-in sleep function (the call chain runs through nanosleep to schedule). The spike's amplitude is modeled as $P_{total} = P_{dyn} + P_{leak} + P_{sc}$, with dynamic power responding to Hamming weight and Hamming distance and leakage power growing with temperature; the thermal model $C_{th} \, dT/dt = P_{total} - (T - T_{amb})/R_{th}$ turns a burst of instruction activity into an elevated die temperature, so the residual signature of past work survives into the spike. This single-point amplitude is the mechanism that removes trace alignment, external triggers, and high-dimensional feature extraction, and it is what both the SIKE threshold classification and the AES byte-level Hamming-weight comparison exploit.

What would settle it

Run the same SIKE and AES key-recovery procedure on a second, unmodified BCM2711 board at a different ambient temperature without re-tuning the SEP_LIMIT threshold; if the separation between the anomalous-zero and normal cases reverses or vanishes, the claimed single-spike monotonicity fails. Separately, attempt to run Algorithm 2 without access to the AES key schedule; since Decrypt(C) requires the full round key, the chosen-plaintext key-recovery attack cannot even begin for an attacker who lacks the key.

Watch

Extended reading notes

Core claim

On a stock Raspberry Pi 4 with the Linux kernel's sleep function, the paper discovers that the power spike produced when the kernel enters a context switch contains two superimposed signals: the switching activity of saving and restoring registers (captured by the Hamming weight of register values present at that moment) and the residual power signature of instructions executed before the switch, which persists through elevated die temperature and leakage current. Because the spike is present and prominent for sleep, usleep, and nanosleep, and because its peak amplitude is the only measurement needed, the authors use it for key recovery: with specially crafted SIKE ciphertexts that force zero-valued intermediates in the Montgomery ladder, the spike amplitude cleanly separates cases where the key bit flips from cases where it does not, yielding the full SIKE key with a threshold-based bit-by-bit algorithm; and with 150,000 AES encryptions before each sleep call, the amplitude distinguishes byte-level Hamming weights in the final S-box output, recovering 10 of 16 AES-128 final round key bytes and lowering brute-force complexity from $2^{128}$ to $2^{48}$.

Load-bearing premise

The whole attack treats the average amplitude of the sleep-spike as a stable, monotone measure of register Hamming weight plus residual power and thermal history, and assumes this mapping and the locally tuned SEP_LIMIT threshold transfer across key bits and ciphertexts; if the mapping drifts with temperature, board, or program, the bit classification collapses.

Editorial extensions

If this is right

  • An attacker with only a single power sample, taken after a sleep call, can distinguish which of several workloads ran before the sleep, including workloads that differ only in operand size.
  • The SIKE key-recovery procedure extracts the full secret key bit by bit even when the sleep call is placed only after the entire decapsulation, using residual power amplified by four decapsulation runs.
  • AES final-round key bytes are recoverable at byte granularity: ten of sixteen bytes are found, cutting exhaustive search from $2^{128}$ to $2^{48}$.
  • Because usleep, nanosleep, and other user-accessible system calls produce the same spike, the channel generalizes to any kernel context-switch trigger the attacker can invoke.
  • No external synchronization is needed because the spike is self-identifying and consistent, so trace collection reduces to peak-finding on a running average.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the spike amplitude's reliance on residual thermal history is as strong as the model suggests, the calibration (the SEP_LIMIT threshold) should be temperature-dependent: a fixed threshold may fail in a cooler or warmer room, which can be tested by repeating the SIKE attack at different ambient temperatures.
  • The AES plaintext generator assumes the attacker can decrypt chosen ciphertexts under the victim key, which is only possible if the attacker already possesses the key schedule or can query the victim as a decryption oracle; a purely black-box chosen-plaintext attacker cannot run Algorithm 2 as written.
  • The same single-point leakage could plausibly recover other secret-dependent data that ends in registers or in a sustained computation right before a sleep, such as DNN layer outputs or memory addresses, not just cryptographic keys.
  • On other CPUs or kernels, the size and stability of the context-switch spike may differ; if the spike is small or masked by frequency scaling, the method's single-sample advantage would shrink, so cross-platform transfer is an open question.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 7 minor

Summary. The paper introduces SleepWalk, a physical power side-channel based on the power spike observed when the Linux sleep() call triggers a context switch on a Raspberry Pi 4 (BCM2711). The authors report that the spike amplitude correlates with the Hamming weight of register contents and with residual power from previously executed instructions, and they develop a qualitative power-thermal model. They then present two end-to-end attacks: full secret-key recovery from the CIRCL SIKE decapsulation, exploiting zero-value states in the Montgomery ladder, and partial (10 out of 16 bytes) final-round key recovery from AES-128 using chosen plaintexts. The claimed advantages are that only a single power-spike amplitude is needed, eliminating trace alignment, external triggers, and complex preprocessing.

Significance. If the end-to-end claims were valid, SleepWalk would be a noteworthy simplification of physical power analysis: a single peak-amplitude measurement could leak both current register state and past computational activity, and the AES result would lower key-search complexity to 2^48. The controlled experiments in Section IV, showing monotone relationships between spike amplitude and register HWT, processed-data HWT/HD, and instruction count, are a plausible empirical contribution, and the anonymous code release and disclosure to Broadcom/ARM are positive practices. However, the AES attack's plaintext generator (Algorithm 2) requires the secret key or an unstated decryption oracle, making the reported key recovery circular in the stated chosen-plaintext model. The SIKE attack's threshold and success claims are also under-supported. As a result, the paper's central security claims are not established.

major comments (4)
  1. [Section VI, Algorithm 2] The instruction `P <- Decrypt(C)` is load-bearing and circular. In AES, decrypting a 128-bit ciphertext requires the full key schedule; setting a single ciphertext byte `C[T]` to a guessed key byte `k` does not make decryption possible without the secret key. An attacker in the stated chosen-plaintext threat model does not possess that key, and the paper does not state that a decryption oracle is available. If `Decrypt` is instead meant to be called with the victim's key, then the plaintexts that force a 0x00 final-round S-box output are generated using the very key the attack is supposed to recover. Levels 1-3 of the AES attack (Sections VI-A through VI-C) all depend on Algorithm 2, so the reported recovery of 10 key bytes is either circular or rests on an unstated, much stronger assumption.
  2. [Section V-B, Algorithm 1 and Figures 16-17] The key-recovery procedure hinges on `SEP_LIMIT`, which is "set by conducting multiple local experiments" rather than derived from the leakage model, and on the assumption that the mean peak power for anomalous-zero cases is always lower. The paper reports that the full SIKE key was recovered but gives no success rate, no number of independent trials, no error bars or confidence intervals for the means, and Figure 17 shows only the first ten key bits. The number of decapsulation iterations before sleep (four) is also a free parameter with no sensitivity analysis. These omissions make the full-key recovery claim impossible to verify.
  3. [Sections IV-A and VI-A] The claimed "single power-spike" / "single sampling point" advantage is not supported by the reported methodology. Every data point in Section IV is the average of 1,000 measured spikes, Section VI-A uses 10,000 traces per plaintext, and Section III-A applies a running-average window of 10 before peak extraction. The end-to-end attacks therefore depend on averaged and smoothed peak amplitudes, not on a single raw sampling point. The paper should either substantiate the single-point claim with single-trace results or soften the claim.
  4. [Section VI-C] The claim of recovering 10 out of 16 final-round key bytes is not accompanied by per-byte results for all positions, a success criterion, or an analysis of the failures. Figure 20 reports only bytes 15, 13, 3, and 1. Without knowing which bytes fail and why, the stated reduction from 2^128 to 2^48 cannot be assessed, and the reader cannot tell whether the attack is stable across keys.
minor comments (7)
  1. [Figure 13] The code uses the mnemonic `RSL` for a right shift; the ARM Cortex-A72 ISA has `LSR`, not `RSL`. Please correct or explain the macro.
  2. [Section IV-D] The text says HD = 4 x SHIFT_VALUE, while the Figure 14 caption says "the HD is always constant (4 x shift amount)"; these statements should be reconciled.
  3. [Section III-A] "GNU/Linux 12 Debian (Bookworm)" should read "Debian GNU/Linux 12 (Bookworm)".
  4. [Algorithm 2] The pseudocode overloads `C` for the ciphertext array and `T` for the target byte while `k` is both the loop variable and the key-byte guess; the notation is confusing and should be clarified.
  5. [Section V-B] The function `generate_ciphertext(K, t)` is never specified; since the zero-value ciphertext construction is central to the attack, the paper should provide pseudocode or a precise pointer to the construction in [44].
  6. [Section IV-E] The Cold and Hot tasks differ in both shift amount/HWT and instruction count, so the instruction-count effect is not cleanly isolated.
  7. [Section III-B] The claim that the spike is caused by the context switch rather than by syscall entry/exit or clock events is supported only by a call trace; an ablation that removes schedule() would strengthen the causal claim.

Circularity Check

1 steps flagged · score 6.0 of 10

AES plaintext generation is self-definitional: Algorithm 2's P ← Decrypt(C) requires the full AES key schedule (the target secret) or an unstated decryption oracle, so the chosen-plaintext AES key recovery cannot start as described; the SIKE attack and Section IV spike-correlation experiments are not circular.

  1. self definitional [Section VI-A, Algorithm 2 (Plaintext Generator), line 7: `P ← Decrypt(C)`]
    "Ciphertext: C ← Rand() Key byte guess: k for k = 0to 255 do C[T ] ← k P ← Decrypt(C) end for"

    Line 7 generates the 'chosen' plaintext by decrypting a ciphertext whose target byte has been set to the key guess k. AES decryption of a full 128-bit block requires the complete inverse key schedule, including the round-10 key byte at position T—the exact value the attack is supposed to recover. The paper describes the attack as a 'chosen plaintext approach' and never declares a decryption oracle, so as written the attacker must already possess the key (or an oracle that performs decryption under it) to run Algorithm 2. That makes the plaintexts that force the 0x00 SubBytes output depend on the target key; Levels 1-3 of the AES attack cannot start without this circular input, and the claimed 10-of-16-byte recovery is not a self-contained chosen-plaintext result.

full rationale

Section III-B and Section IV establish the sleep-induced spike empirically with controlled experiments using Hamming weight, Hamming distance, and instruction count; these are measurements rather than predictions derived from their own inputs, so they are not circular. The SIKE attack (Section V) is a known-ciphertext attack: Algorithm 1 builds ciphertexts from previously recovered key bits and measures two candidate cases; SEP_LIMIT is calibrated in separate local experiments, so it is a fitted threshold rather than a renamed output, and I do not count it as circular, though its robustness is a correctness concern. The only load-bearing circular step is the AES plaintext generator: Algorithm 2 defines P via Decrypt(C), which requires the AES key schedule or an undeclared decryption oracle and thus presupposes the key being recovered. Since AES key recovery is one of the two headline attacks and is the basis for the claimed reduction of key recovery complexity to 2^48, the paper is partially circular. The power-model and SIKE contributions remain independent, so the score is 6 rather than 8.

Assumptions & free parameters 4 free parameters · 5 assumptions · 0 invented entities

The paper's central claims rest on standard CMOS power/thermal equations, the observation that sleep() triggers a context switch, and the published SIKE zero-value anomaly. The nonstandard premises are the persistence and measurability of the residual power signature at a single spike, and the ability to generate chosen plaintexts for the AES attack without the secret key (the latter appears violated by Algorithm 2). The fitted threshold SEP_LIMIT and several amplification counts (150,000 encryptions, four decapsulations) are free parameters.

free parameters (4)
  • SEP_LIMIT (SIKE key recovery threshold) = not reported
    Chosen via 'multiple local experiments' (Section V-B) to separate anomalous-zero from non-anomalous cases; no value or cross-validation given.
  • running average window (trace smoothing) = 10
    Fixed by the authors for smoothing; affects peak amplitude estimates and thus the attack results.
  • number of decapsulation iterations before sleep (SIKE) = 4
    Chosen to amplify residual power; not justified by a cost model.
  • number of pre-sleep AES encryptions = 150000
    Chosen to amplify residual power; not justified by a cost model.
assumptions (5)
  • standard math CMOS power and thermal equations (Equations 1-3) describe total power as dynamic plus leakage plus short-circuit, with leakage growing with temperature.
    Taken from standard VLSI literature (citations [39], [40], [41]); used as the basis for the residual power explanation in Section IV-A.
  • domain assumption The sleep() function leads to schedule() and a context switch on Linux arm64.
    Verified by the authors via a function call trace in Figure 6; this is the premise that a sleep-induced spike corresponds to a context switch.
  • domain assumption Hamming weight and Hamming distance power models apply to the ARM Cortex-A72.
    Standard power models from the literature (citations [37], [15]) are adopted without validating them against this specific microarchitecture.
  • domain assumption The SIKE zero-value anomaly attack (De Feo et al., reference [44]) applies to the CIRCL implementation used here.
    The SIKE attack in Section V depends on previously published ciphertexts that force zero-value intermediates; the paper does not re-derive or validate this property.
  • ad hoc to paper The residual power signature persists long enough to affect a future context-switch spike and scales monotonically with instruction count, data HWT, and HD.
    This is the paper's core non-validated empirical premise, supported only by the qualitative controlled experiments in Sections IV-B to IV-E.

how reviews work

0 comments
Cite this review

Pith. "Pith review of SleepWalk: Exploiting Context Switching and Residual Power for Physical Side-Channel Attacks." pith.science (2026). https://pith.science/paper/QVT2PJVN

@misc{pith2026250722306,
  author       = {Pith},
  title        = {Pith review of: SleepWalk: Exploiting Context Switching and Residual Power for Physical Side-Channel Attacks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/QVT2PJVN}},
  note         = {Machine review of arXiv:2507.22306}
}
read the original abstract

Context switching is utilized by operating systems to change the execution context between application programs. It involves saving and restoring the states of multiple registers and performing a pipeline flush to remove any pre-fetched instructions, leading to a higher instantaneous power consumption compared to typical program execution. In this paper, we introduce a physical power side-channel leakage source that exploits the power spike observed during a context switch, triggered by the inbuilt sleep function of the system kernel. We observed that this power spike directly correlates with both the power consumption during context switching and the residual power consumption of the previously executed program. Notably, the persistence of residual power signatures from previous workloads extends the scope of this side-channel beyond extracting the data in registers during the context switch. Unlike traditional approaches that require analyzing full power traces, applying complex preprocessing, or relying on external synchronization triggers, this novel technique leverages only the amplitude of a single power spike, significantly simplifying the attack. We developed a power model to illustrate the feasibility of mounting end-to-end side-channel attacks using the sleep-induced power spikes. Experimental evaluation demonstrates that our framework can successfully perform cryptographic key recovery for both AES and SIKE implementations on Broadcom BCM2711.

Figures

Figures reproduced from arXiv: 2507.22306 by the authors.

Figure 1
Figure 1. We demonstrate the existence of a sleep-induced power spike (Figure 1b), which directly correlates with both the residual power consumption of the previously executed program and the power consumption during the context switch (Figure 1c). Unlike traditional power analysis (Figure 1a), this side-channel eliminates the need to analyze the entire power trace, perform advanced preprocessing, or use external triggers fo… view at source ↗
Figure 2
Figure 2. Overview of SleepWalk power side-channel analysis, which extracts residual and context-switch power signatures from a single sleep-induced power spike to recover secret information from the victim application (Task A). B. Contributions To demonstrate the potential of the SleepWalk side-channel, we explore a power model that enables practical side-channel attacks. Using this model, we showcase two attacks: key extrac… view at source ↗
Figure 3
Figure 3. Overview of Power Side-Channel analysis Trace Collection: The trace collection phase involves captur￾ing power variations corresponding to computations occurring within the targeted hardware. The trace can be collected by probing the power lines and measuring the voltage fluctuations across components of the device [8]. 2 [PITH_FULL_IMAGE:figures/full_fig_p002_3.png] view at source ↗
Figures from the paper (16 more)
Figure 4
Figure 4. Figure 4: Context switch and related pipeline flush routines [PITH_FULL_IMAGE:figures/full_fig_p003_4.png]
Figure 5
Figure 5. Figure 5: Timing flow of Linux kernel context switch: saving [PITH_FULL_IMAGE:figures/full_fig_p004_5.png]
Figure 6
Figure 6. Figure 6: sleep() function’s function call trace current process, prompting the scheduler to allocate CPU time to other processes [PITH_FULL_IMAGE:figures/full_fig_p004_6.png]
Figure 7
Figure 7. Figure 7: Power traces collected during the execution of various [PITH_FULL_IMAGE:figures/full_fig_p005_7.png]
Figure 8
Figure 8. Figure 8: Probability density distribution of sleep-induced peak power values for six workloads. The sleep function was inserted at the end of each program, and each program was executed for one second. The key takeaway from this experiment is that there exists a correlation bet…
Figure 10
Figure 10. Figure 10: Effect of varying the HWT of data in registers [PITH_FULL_IMAGE:figures/full_fig_p006_10.png]
Figure 9
Figure 9. Figure 9: Code for context switch HWT experiment. B. Hamming Weight of Data in Registers We start the experiment with the following hypothesis regarding the data in the registers during the context switch. Hypothesis 1: The effect of the Hamming weight of the data in registers h…
Figure 12
Figure 12. Figure 12: Effect of the HWT of data processed prior to the con [PITH_FULL_IMAGE:figures/full_fig_p007_12.png]
Figure 14
Figure 14. Figure 14: The effect of varying HD of processed data prior [PITH_FULL_IMAGE:figures/full_fig_p008_14.png]
Figure 13
Figure 13. Figure 13: Code for residual power HD experiment. (a) HWT_VALUE = 0 (b) HWT_VALUE = 16 (c) HWT_VALUE = 32 (d) HWT_VALUE = 48 (e) HWT_VALUE = 64 [PITH_FULL_IMAGE:figures/full_fig_p008_13.png]
Figure 15
Figure 15. Figure 15: Impact of loop iteration count on the sleep-induced power spike. At low iteration counts, the mean peak power remains low. As the iteration count increases, the mean peak power rises, reflecting the influence of accumulated instruction execution on residual power. res…
Figure 16
Figure 16. Figure 16: Probability distribution of measured sleep-induced peak power amplitudes over the first ten bits of the secret key used in SIKE implementation. Next, we perform a complete key extraction attack with a threshold-based key bit identification approach. We plot the mean v…
Figure 17
Figure 17. Figure 17: Mean values of the measured sleep-induced peak power amplitudes over the first ten bits of the SIKE secret key for both cases: when an anomalous zero is triggered (k[i−1] ̸= k[i]; green colored data points) and when it is not (k[i−1] = k[i]; orange colored data points…
Figure 18
Figure 18. Figure 18: Attack method for AES-128. For plaintexts generated [PITH_FULL_IMAGE:figures/full_fig_p011_18.png]
Figure 19
Figure 19. Figure 19: presents the mean difference between the sleep￾induced peak power of a given HWT and other HWT cases, evaluated over three different secret keys, with respect to varying HWT values in the last byte of the final round key. This means that the data point corresponding t…
Figure 20
Figure 20. Figure 20: presents the differences between the mean sleep-induced peak power of a given HWT and other HWT cases, with respect to varying HWT values at byte locations 15, 13, 3, and 1 of the final round key. We observe that for each target byte, the difference between HWT 0 and …

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

44 extracted references · 44 canonical work pages

  1. [1]

    Quantifying the cost of context switch,

    C. Li, C. Ding, and K. Shen, “Quantifying the cost of context switch,” in Proceedings of the 2007 workshop on Experimental computer science , 2007, pp. 2–es

    work page 2007

  2. [2]

    (2023) So2 lecture 3: Processes

    Linux Kernel Labs. (2023) So2 lecture 3: Processes. Accessed: 2025-03-21. [Online]. Available: https://linux-kernel-labs.github.io/refs/ heads/master/so2/lec3-processes.html

    work page 2023

  3. [3]

    Evilcs: An evaluation of information leakage through context switching on security enclaves,

    A. Jayasena, R. Bachmann, and P. Mishra, “Evilcs: An evaluation of information leakage through context switching on security enclaves,” in 2024 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 2024, pp. 1–6

    work page 2024

  4. [4]

    Differential power analysis,

    P. Kocher, J. Jaffe, and B. Jun, “Differential power analysis,” in International Cryptology Conference . Springer, 1999, pp. 388–397

    work page 1999

  5. [5]

    Controlled pre- emption: Amplifying side-channel attacks from userspace,

    Y . Zhu, B. Chen, Z. N. Zhao, and C. W. Fletcher, “Controlled pre- emption: Amplifying side-channel attacks from userspace,” in ACM International Conference on Architectural Support for Programming Languages and Operating Systems , 2025, pp. 162–177

    work page 2025

  6. [6]

    Faz-Hernandez and K

    A. Faz-Hernandez and K. Kwiatkowski. (2019) Introducing circl: An advanced cryptographic library. Cloudflare. Accessed: 2025-01-10. [Online]. Available: https://github.com/cloudflare/circl

    work page 2019

  7. [7]

    Advanced encryption standard (aes),

    M. J. Dworkin, E. Barker, J. R. Nechvatal, J. Foti, L. E. Bassham, E. Roback, J. F. Dray Jr et al. , “Advanced encryption standard (aes),” 2001

    work page 2001

  8. [8]

    Power analysis based side channel attack,

    H. Gamaarachchi and H. Ganegoda, “Power analysis based side channel attack,” 01 2018

    work page 2018

Show all 44 references
  1. [9]

    Virtual triggering: a technique to segment cryptographic processes in side-channel traces,

    J. Guillaume, M. Pelcat, A. Nafkha, and R. Salvador, “Virtual triggering: a technique to segment cryptographic processes in side-channel traces,” in 2022 IEEE Workshop on Signal Processing Systems (SiPS) . IEEE, 2022, pp. 1–6

    2022

  2. [10]

    Static power side-channel anal- ysis—an investigation of measurement factors,

    T. Moos, A. Moradi, and B. Richter, “Static power side-channel anal- ysis—an investigation of measurement factors,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 28, no. 2, pp. 376–389, 2019

    2019

  3. [11]

    Trace alignment preprocessing in side-channel analysis using the adaptive filter,

    S. Gu, Z. Luo, Y . Chu, Y . Xu, Y . Jiang, and J. Guo, “Trace alignment preprocessing in side-channel analysis using the adaptive filter,” IEEE Transactions on Information Forensics and Security , vol. 18, pp. 5580– 5591, 2023

    2023

  4. [12]

    Timing attacks on implementations of diffie-hellman, rsa, dss, and other systems,

    P. C. Kocher, “Timing attacks on implementations of diffie-hellman, rsa, dss, and other systems,” in International Cryptology Conference . Springer, 1996, pp. 104–113

    1996

  5. [13]

    Shield: An adaptive and lightweight defense against the remote power side-channel attacks on multi-tenant fpgas,

    M. M. Ahmadi, F. Khalid, R. Vaidya, F. Kriebel, A. Steininger, and M. Shafique, “Shield: An adaptive and lightweight defense against the remote power side-channel attacks on multi-tenant fpgas,” arXiv preprint arXiv:2303.06486, 2023

    2023 arXiv

  6. [14]

    Binary ring-lwe hardware with power side-channel countermeasures,

    A. Aysu, M. Orshansky, and M. Tiwari, “Binary ring-lwe hardware with power side-channel countermeasures,” in 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE) . IEEE, 2018, pp. 1253–1258

    2018

  7. [15]

    Correlation power analysis with a leakage model,

    E. Brier, C. Clavier, and F. Olivier, “Correlation power analysis with a leakage model,” in International Workshop on Cryptographic Hardware and Embedded Systems (CHES) , 2004, pp. 16–29. 13

    2004

  8. [16]

    Power-based side channel analysis and fault injection: Hacking techniques and combined countermeasure,

    N. Benhadjyoussef, M. Karmani, and M. Machhout, “Power-based side channel analysis and fault injection: Hacking techniques and combined countermeasure,” International Journal of Advanced Computer Science and Applications, vol. 12, no. 5, 2021

    2021

  9. [17]

    Deeptheft: Stealing dnn model architectures through power side channel,

    Y . Gao, H. Qiu, Z. Zhang, B. Wang, H. Ma, A. Abuadbba, M. Xue, A. Fu, and S. Nepal, “Deeptheft: Stealing dnn model architectures through power side channel,” in 2024 IEEE Symposium on Security and Privacy (SP). IEEE, 2024, pp. 3311–3326

    2024

  10. [18]

    Deep learning method for power side-channel analysis on chip leakages,

    A. A. Ahmed, R. A. Salim, and M. K. Hasan, “Deep learning method for power side-channel analysis on chip leakages,” Elektronika Ir Elek- trotechnika, vol. 29, no. 6, pp. 50–57, 2023

    2023

  11. [19]

    On inferring browsing activity on smartphones via usb power analysis side- channel,

    Q. Yang, P. Gasti, G. Zhou, A. Farajidavar, and K. S. Balagani, “On inferring browsing activity on smartphones via usb power analysis side- channel,” IEEE Transactions on Information Forensics and Security , vol. 12, no. 5, pp. 1056–1066, 2016

    2016

  12. [20]

    De- fensive charging: Mitigating power side-channel attacks on charging smartphones,

    R. Matovu, A. Serwadda, A. V . Bilbao, and I. Griswold-Steiner, “De- fensive charging: Mitigating power side-channel attacks on charging smartphones,” in Proceedings of the Tenth ACM Conference on Data and Application Security and Privacy , 2020, pp. 179–190

    2020

  13. [21]

    Powerful: Mobile app fingerprinting via power analysis,

    Y . Chen, X. Jin, J. Sun, R. Zhang, and Y . Zhang, “Powerful: Mobile app fingerprinting via power analysis,” in IEEE Conference on Computer Communications. IEEE, 2017, pp. 1–9

    2017

  14. [22]

    Platypus: Software-based power side-channel attacks on x86,

    M. Lipp, A. Kogler, D. Oswald, M. Schwarz, C. Easdon, C. Canella, and D. Gruss, “Platypus: Software-based power side-channel attacks on x86,” in 2021 IEEE Symposium on Security and Privacy (SP) . IEEE, 2021, pp. 355–371

    2021

  15. [23]

    Red alert for power leakage: Exploiting intel rapl-induced side channels,

    Z. Zhang, S. Liang, F. Yao, and X. Gao, “Red alert for power leakage: Exploiting intel rapl-induced side channels,” in Proceedings of the 2021 ACM Asia Conference on Computer and Communications Security , 2021, pp. 162–175

    2021

  16. [24]

    Hertzbleed: Turning power {Side-Channel} attacks into remote timing attacks on x86,

    Y . Wang, R. Paccagnella, E. T. He, H. Shacham, C. W. Fletcher, and D. Kohlbrenner, “Hertzbleed: Turning power {Side-Channel} attacks into remote timing attacks on x86,” in USENIX Security Symposium , 2022, pp. 679–697

    2022

  17. [25]

    Static power side-channel analysis of a threshold implementation prototype chip,

    T. Moos, A. Moradi, and B. Richter, “Static power side-channel analysis of a threshold implementation prototype chip,” in Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017. IEEE, 2017, pp. 1324–1329

    2017

  18. [26]

    Information leakage through physical layer supply voltage coupling vulnerability,

    S. Sanjaya, A. Jayasena, and P. Mishra, “Information leakage through physical layer supply voltage coupling vulnerability,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems , 2025

    2025

  19. [27]

    PSC-TG: RTL power side-channel leakage assessment with test pattern generation,

    T. Zhang, J. Park, M. Tehranipoor, and F. Farahmandi, “PSC-TG: RTL power side-channel leakage assessment with test pattern generation,” in ACM/IEEE Design Automation Conference (DAC) , 2021, pp. 709–714

    2021

  20. [28]

    Power side- channel leakage assessment framework at register-transfer level,

    N. Pundir, J. Park, F. Farahmandi, and M. Tehranipoor, “Power side- channel leakage assessment framework at register-transfer level,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems , 2022

    2022

  21. [29]

    Ciseleaks: Information leak- age assessment of cryptographic instruction set extension prototypes,

    A. Jayasena, R. Bachmann, and P. Mishra, “Ciseleaks: Information leak- age assessment of cryptographic instruction set extension prototypes,” IEEE Transactions on Information Forensics and Security , 2025

    2025

  22. [30]

    RTL-PSC: Automated power side-channel leakage assessment at register-transfer level,

    M. He, J. Park, A. Nahiyan, A. Vassilev, Y . Jin, and M. Tehra- nipoor, “RTL-PSC: Automated power side-channel leakage assessment at register-transfer level,” in IEEE VLSI Test Symposium (VTS) , 2019, pp. 1–6

    2019

  23. [31]

    Test Vector Leakage As- sessment on Hardware Implementations of Asymmetric Cryptography Algorithms,

    A. Jayasena, E. Andrews, and P. Mishra, “Test Vector Leakage As- sessment on Hardware Implementations of Asymmetric Cryptography Algorithms,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2023

    2023

  24. [32]

    {Collide+ Power }: Leaking inaccessible data with software-based power side channels,

    A. Kogler, J. Juffinger, L. Giner, L. Gerlach, M. Schwarzl, M. Schwarz, D. Gruss, and S. Mangard, “ {Collide+ Power }: Leaking inaccessible data with software-based power side channels,” in 32nd USENIX Secu- rity Symposium (USENIX Security 23) , 2023, pp. 7285–7302

    2023

  25. [33]

    {AMD} prefetch attacks through power and time,

    M. Lipp, D. Gruss, and M. Schwarz, “ {AMD} prefetch attacks through power and time,” in31st USENIX Security Symposium (USENIX Security 22), 2022, pp. 643–660

    2022

  26. [34]

    Keysight dsox1102g user manual,

    Keysight, “Keysight dsox1102g user manual,” 2023. [On- line]. Available: https://www.keysight.com/th/en/assets/7018-05520/ data-sheets/5992-1965.pdf

    2023

  27. [35]

    M. Kerrisk. (2025) Linux manual page. man7.org. [Online]. Available: https://man7.org/linux/man-pages

    2025

  28. [36]

    Stress-ng,

    C. I. King, “Stress-ng,” URL: https://github.com/ColinIanKing/stress-ng, vol. 39, 2017

    2017

  29. [37]

    Using second-order power analysis to attack dpa resis- tant software,

    T. S. Messerges, “Using second-order power analysis to attack dpa resis- tant software,” in International Workshop on Cryptographic Hardware and Embedded Systems . Springer, 2000, pp. 238–251

    2000

  30. [38]

    Open dnn box by power side-channel attack,

    Y . Xiang, Z. Chen, Z. Chen, Z. Fang, H. Hao, J. Chen, Y . Liu, Z. Wu, Q. Xuan, and X. Yang, “Open dnn box by power side-channel attack,” IEEE Transactions on Circuits and Systems II: Express Briefs , vol. 67, pp. 2717–2721, 11 2020

    2020

  31. [39]

    Thermal modeling, analysis, and manage- ment in vlsi circuits: Principles and methods,

    M. Pedram and S. Nazarian, “Thermal modeling, analysis, and manage- ment in vlsi circuits: Principles and methods,” Proceedings of the IEEE, vol. 94, no. 8, pp. 1487–1501, 2006

    2006

  32. [40]

    Accurate temperature- dependent integrated circuit leakage power estimation is easy,

    Y . Liu, R. P. Dick, L. Shang, and H. Yang, “Accurate temperature- dependent integrated circuit leakage power estimation is easy,” in 2007 Design, Automation & Test in Europe Conference & Exhibition . IEEE, 2007, pp. 1–6

    2007

  33. [41]

    Vassighi and M

    A. Vassighi and M. Sachdev, Thermal and power management of integrated circuits. Springer Science & Business Media, 2006

    2006

  34. [42]

    Cortex-a72 software optimization guide,

    “Cortex-a72 software optimization guide,” ARM Ltd., Tech. Rep. ARM UAN 0016A, 2015, available: https://documentation-service.arm.com/ static/5ed75eeeca06a95ce53f93c7

    2015

  35. [43]

    Supersingular isogeny key encapsulation,

    M. Campagna, C. Costello, B. Hess, A. Jalali, B. Koziel, B. LaMacchia, P. Longa, M. Naehrig, J. Renes, D. Urbanik et al. , “Supersingular isogeny key encapsulation,” 2019

    2019

  36. [44]

    Sike channels: Zero-value side-channel attacks on sike,

    L. De Feo, N. El Mrabet, A. Gen ˆet, N. Kaluderovi´c, N. L. de Guertechin, S. Ponti´e, and ´E. Tasso, “Sike channels: Zero-value side-channel attacks on sike,” IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2022, pp. 264–289, 2022. Sahan Sanjaya is a se...

    2022

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.