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

• URL: http://arxiv.org/abs/2507.22306v1
• Date: Wed, 30 Jul 2025 00:39:27 GMT
• Title: SleepWalk: Exploiting Context Switching and Residual Power for Physical Side-Channel Attacks
• Abstract summary: We introduce a physical power side-channel leakage source that exploits the power spike observed during a context switch.<n>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.
• Score: 2.6490401904186758
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Communication-Efficient LLM Adaptation over Decentralized GPU Meshes [48.95736135870457]
  We propose an asynchronous two-circuit system for post-pretraining adaptation.<n>A fast compressed training circuit drives throughput using masking activation for pipeline-parallel transfer and compressed data-parallel synchronization.<n>We show that masking supports post-pretraining adaptation at high compression rates when anchored this way.
  arXiv  Detail & Related papers  (2026-09-13T06:56:50Z)
• Emulated Integrity Replica: Enabling Self-Healing on FPGA SoCs via Hierarchical Twins [4.079848915785294]
  Convolutional neural networks (CNNs) are increasingly being deployed on system-on-chip (SoC) platforms, where hardware-accelerated inference enables low-latency edge computing.<n>We propose Emulated Integrity Replica (EIR), a hierarchical digital-twin framework for FPGA SOCs that provides autonomous fault detection and recovery.
  arXiv  Detail & Related papers  (2026-07-14T03:14:00Z)
• Stalls and Spequlation: Pipelined Execution for Fault Tolerant Quantum Computation [1.6724455800127804]
  Current scheduling models treat logical operations as atomic, hiding the fact that these subsystems operate sequentially and spend significant time idle.<n>We present a pipelined execution framework that decomposes each logical operation into its component stages.<n>We show that pipelining with speculation reduces total pipeline steps by 20-40% compared to a no-speculation baseline.
  arXiv  Detail & Related papers  (2026-06-17T20:47:45Z)
• Latent Recurrent Transformer: Architecture Exploration, Training Strategies, and Scaling Behavior [107.2098567818173]
  Latent Recurrent Transformer (LRT) is a lightweight augmentation of autoregressive transformers.<n>LRT reuses a high-level source-layer hidden state from the previous token as recurrent memory for the next token.
  arXiv  Detail & Related papers  (2026-05-26T10:10:26Z)
• RedVisor: Reasoning-Aware Prompt Injection Defense via Zero-Copy KV Cache Reuse [47.85771791033142]
  We propose RedVisor, a framework that synthesizes the explainability of detection systems with the seamless integration of prevention strategies.<n>RedVisor is the first approach to leverage fine-grained reasoning paths to simultaneously detect attacks and guide the model's safe response.<n> Experiments demonstrate that RedVisor outperforms state-of-the-art defenses in detection accuracy and throughput while incurring negligible utility loss.
  arXiv  Detail & Related papers  (2026-02-02T08:26:51Z)
• Sleep Reveals the Nonce: Breaking ECDSA using Sleep-Based Power Side-Channel Vulnerability [2.6713452353326717]
  Elliptic Curve Digital Signature Algorithm (ECDSA) depends on the secrecy of the per-signature nonce.<n>Even partial nonce leakage can expose the long-term private key through lattice-based cryptanalysis.<n>We introduce a previously unexplored power side-channel vulnerability that exploits sleep-induced power spikes to extract ECDSA nonces.
  arXiv  Detail & Related papers  (2026-02-02T00:01:31Z)
• Influence of Parallelism in Vector-Multiplication Units on Correlation Power Analysis [0.5439798554380393]
  This work investigates the influence of parallel processing within hardware accelerators on side-channel attacks.<n>The focus is on neurons that are part of the same fully-connected layer, which run parallel and simultaneously process the same input value.
  arXiv  Detail & Related papers  (2026-01-09T15:01:47Z)
• ImplicitRDP: An End-to-End Visual-Force Diffusion Policy with Structural Slow-Fast Learning [52.86018040861575]
  We propose a unified end-to-end visual-force diffusion policy that integrates visual planning and reactive force control within a single network.<n>We introduce Structural Slow-Fast Learning, a mechanism utilizing causal attention to simultaneously process asynchronous visual and force tokens.<n>Experiments on contact-rich tasks demonstrate that ImplicitRDP significantly outperforms both vision-only and hierarchical baselines.
  arXiv  Detail & Related papers  (2025-12-11T18:59:46Z)
• PowerGrow: Feasible Co-Growth of Structures and Dynamics for Power Grid Synthesis [75.14189839277928]
  We present PowerGrow, a co-generative framework that significantly reduces computational overhead while maintaining operational validity.<n> Experiments across benchmark settings show that PowerGrow outperforms prior diffusion models in fidelity and diversity.<n>This demonstrates its ability to generate operationally valid and realistic power grid scenarios.
  arXiv  Detail & Related papers  (2025-08-29T01:47:27Z)
• Energy-Constrained Information Storage on Memristive Devices in the Presence of Resistive Drift [41.66366715982197]
  We study the problem of information storage on memristors affected by resistive drift noise under energy constraints.<n>We introduce a novel, fundamental trade-off between the information lifetime of memristive states and the energy that must be expended to bring the device into a particular state.<n>We propose a joint source-channel coding (JSCC) approach to storing images in an analogue fashion.
  arXiv  Detail & Related papers  (2024-12-16T10:40:13Z)
• AdaLog: Post-Training Quantization for Vision Transformers with Adaptive Logarithm Quantizer [54.713778961605115]
  Vision Transformer (ViT) has become one of the most prevailing fundamental backbone networks in the computer vision community. We propose a novel non-uniform quantizer, dubbed the Adaptive Logarithm AdaLog (AdaLog) quantizer.
  arXiv  Detail & Related papers  (2024-07-17T18:38:48Z)
• Green AI: A Preliminary Empirical Study on Energy Consumption in DL Models Across Different Runtime Infrastructures [56.200335252600354]
  It is common practice to deploy pre-trained models on environments distinct from their native development settings. This led to the introduction of interchange formats such as ONNX, which includes its infrastructure, and ONNX, which work as standard formats.
  arXiv  Detail & Related papers  (2024-02-21T09:18:44Z)
• RandOhm: Mitigating Impedance Side-channel Attacks using Randomized Circuit Configurations [6.388730198692013]
  We introduce RandOhm, which exploits a moving target defense (MTD) strategy based on the partial reconfiguration (PR) feature of mainstream FPGAs. We demonstrate that the information leakage through the PDN impedance could be significantly reduced via runtime reconfiguration of the secret-sensitive parts of the circuitry. In contrast to existing PR-based countermeasures, RandOhm deploys open-source bitstream manipulation tools to speed up the randomization and provide real-time protection.
  arXiv  Detail & Related papers  (2024-01-17T02:22:28Z)
• Uncovering Software-Based Power Side-Channel Attacks on Apple M1/M2 Systems [5.309199271673022]
  Research has shown that on-chip power meter capabilities exposed to a software interface might be used for power side-channel attacks without physical access. We show that such software-based power side-channel attack is also applicable on Apple silicon.
  arXiv  Detail & Related papers  (2023-06-28T17:36:16Z)
• SamurAI: A Versatile IoT Node With Event-Driven Wake-Up and Embedded ML Acceleration [37.89976990030855]
  This paper presents SamurAI, a versatile IoT node bridging this gap in processing and in energy by leveraging two on-chip sub-systems. AR contains a 1.7MOPS event-driven, asynchronous Wake-up Controller (WuC) with a 207ns wake-up time optimized for sporadic computing. OD combines a deep-sleep RISC-V CPU and 1.3TOPS/W Machine Learning (ML) for more complex tasks up to 36GOPS.
  arXiv  Detail & Related papers  (2023-04-11T08:52:48Z)
• Age of Semantics in Cooperative Communications: To Expedite Simulation Towards Real via Offline Reinforcement Learning [53.18060442931179]
  We propose the age of semantics (AoS) for measuring semantics freshness of status updates in a cooperative relay communication system. We derive an online deep actor-critic (DAC) learning scheme under the on-policy temporal difference learning framework. We then put forward a novel offline DAC scheme, which estimates the optimal control policy from a previously collected dataset.
  arXiv  Detail & Related papers  (2022-09-19T11:55:28Z)
• Deep Explicit Duration Switching Models for Time Series [84.33678003781908]
  We propose a flexible model that is capable of identifying both state- and time-dependent switching dynamics. State-dependent switching is enabled by a recurrent state-to-switch connection. An explicit duration count variable is used to improve the time-dependent switching behavior.
  arXiv  Detail & Related papers  (2021-10-26T17:35:21Z)
• Energy-Efficient Model Compression and Splitting for Collaborative Inference Over Time-Varying Channels [52.60092598312894]
  We propose a technique to reduce the total energy bill at the edge device by utilizing model compression and time-varying model split between the edge and remote nodes. Our proposed solution results in minimal energy consumption and $CO$ emission compared to the considered baselines.
  arXiv  Detail & Related papers  (2021-06-02T07:36:27Z)
• Low-Latency Asynchronous Logic Design for Inference at the Edge [0.9831489366502301]
  We propose a method for reduced area and power overhead of self-timed early-propagative asynchronous inference circuits. Due to natural resilience to timing as well as logic underpinning, the circuits are tolerant to variations in environment and supply voltage. Average latency of the proposed circuit is reduced by 10x compared with the synchronous implementation.
  arXiv  Detail & Related papers  (2020-12-07T00:40:52Z)
• Accelerating Deep Reinforcement Learning With the Aid of Partial Model: Energy-Efficient Predictive Video Streaming [97.75330397207742]
  Predictive power allocation is conceived for energy-efficient video streaming over mobile networks using deep reinforcement learning. To handle the continuous state and action spaces, we resort to deep deterministic policy gradient (DDPG) algorithm. Our simulation results show that the proposed policies converge to the optimal policy that is derived based on perfect large-scale channel prediction.
  arXiv  Detail & Related papers  (2020-03-21T17:36:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.