惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Attack and Defense Labs
Attack and Defense Labs
Engineering at Meta
Engineering at Meta
腾讯CDC
J
Java Code Geeks
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
G
Google Developers Blog
博客园 - 三生石上(FineUI控件)
Microsoft Azure Blog
Microsoft Azure Blog
The Cloudflare Blog
aimingoo的专栏
aimingoo的专栏
T
The Blog of Author Tim Ferriss
D
Darknet – Hacking Tools, Hacker News & Cyber Security
WordPress大学
WordPress大学
博客园_首页
I
InfoQ
NISL@THU
NISL@THU
Recorded Future
Recorded Future
Security Latest
Security Latest
K
Kaspersky official blog
L
Lohrmann on Cybersecurity
T
The Exploit Database - CXSecurity.com
cs.AI updates on arXiv.org
cs.AI updates on arXiv.org
U
Unit 42
cs.CL updates on arXiv.org
cs.CL updates on arXiv.org
www.infosecurity-magazine.com
www.infosecurity-magazine.com
C
CERT Recently Published Vulnerability Notes
W
WeLiveSecurity
Webroot Blog
Webroot Blog
Last Week in AI
Last Week in AI
AWS News Blog
AWS News Blog
IT之家
IT之家
S
Schneier on Security
雷峰网
雷峰网
Know Your Adversary
Know Your Adversary
T
Threat Research - Cisco Blogs
C
CXSECURITY Database RSS Feed - CXSecurity.com
cs.CV updates on arXiv.org
cs.CV updates on arXiv.org
L
LangChain Blog
Application and Cybersecurity Blog
Application and Cybersecurity Blog
月光博客
月光博客
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Stack Overflow Blog
Stack Overflow Blog
有赞技术团队
有赞技术团队
云风的 BLOG
云风的 BLOG
G
GRAHAM CLULEY
O
OpenAI News
The Last Watchdog
The Last Watchdog
TaoSecurity Blog
TaoSecurity Blog
The GitHub Blog
The GitHub Blog
V
Vulnerabilities – Threatpost

Cryptology ePrint Archive

Fast Isogeny Evaluation on Binary Curves Quick Draw Queries: Lightweight Searchable Public-key Ciphertexts with Hidden Structures via Non-Interactive Key Exchange A Constructive Treatment of Authentication Boolean Arithmetic over $\mathbb{F}_2$ from Group Commutators HAWK with Hint: Algebraic Key Recovery from Side-Channel Leakage Post-Quantum Secure k-Times Traceable Ring Signature A Key Schedule Design and Evaluation under Boundary Round-Key Leakage 2G2T: Constant-Size, Statistically Sound MSM Outsourcing Proximity Signatures Breaking Optimized HQC: The First Cache-Timing Full Decryption Oracle Key-Recovery Attack in Post-Quantum Cryptography Efficient Partially Blind Signatures from Isogenies Evaluating PQC KEMs, Combiners, and Cascade Encryption via Adaptive IND-CPA Testing Using Deep Learning High-Throughput Side-Channel-Protected Stream Cipher Hardware for 6G Systems Efficient e = 3 Threshold RSA via Integer Coordinates for Intel SGX Zeal: PIR for Non-Cooperative Databases VEIL: Lightweight Zero-Knowledge for Hash-Based Multilinear Proof Systems Witness-Indistinguishable Arguments of Knowledge and One-Way Functions The many faces of Schnorr: a touch-up Open Problems in List Decoding and Correlated Agreement Compressed Key Exchange Protocol from Orientations of Large Discriminant Using AVX-512 SPLASH: SPeculative Leakage-Adaptive Secure Hardware An Efficient Identity-Based Blind Signature Scheme from SM9 Efficient Batch Threshold Encryption Using Partial Fraction Techniques A note on the Unsuitability of LIGA for Linkable Ring Signatures: The perils of non-commutativity Verification Facade: Masquerading Insecure Cryptographic Implementations as Verified Code Cryptographic Implications of Worst-Case Hardness of Time-Bounded Kolmogorov Complexity Efficient Merkle-Tree Consistent Accumulator FLOSS: Fast Linear Online Secret-Shared Shuffling Which Privacy Blanket is Optimal in the Shuffle Model? Applications of Bruhat-Chevalley-Renner Decomposition to Metric-Aware Code-Based Cryptography Expanders Meet Reed-Muller: Easy Instances of Noisy k-XOR Verifiable Divide-and-Conquer Pseudorandomness of UFLM: A Characterization via Its Linear Layer QED-Lite: Lightweight Detection of Quantum-Vulnerable ELF Binaries via Cryptographic Library Version Fingerprinting Reformulating the SNOVA Signature Scheme Game Theory Does Not Always Help: The Case of Statistical Multi-Party Coin Tossing Improved Codes and Decoders for HQC Delegate: Coalition Proof Incentivized Outsourced Computation with Smart Contracts Fast and Efficient Perfectly Secure Network-Agnostic Secure Computation Tighter Bounds for the Oblivious Bit-Fixing Inner Product Extractor on Biased Seeds Random Robust Secret Sharing with Perfect Privacy and its Applications Counting and recovering the quadratic relations of a vectorial function A Search-to-Decision Reduction for Continuous LWE Robot: Robust Threshold BBS+ in Two Rounds Perils of Parallelism: Transaction Fee Mechanisms under Execution Uncertainty Synthesis of RTL-based Characterization Programs for Fault Injection SSLE-DAG: A High-Throughput Proof-of-Stake Consensus Protocol Combining an Adaptive DAG with a Single Secret Leader Election On Optimal Information-Theoretic Security in Symmetric Encryption under Low-Entropy Keys Efficient and Parallel Implementation of Isogeny-based Deterministic Group Actions Fast and Compact Lattice-Based Registration-Based Encryption Graph-based Asynchrony with Quasilinear Complexity for Any Linear Verifiable Secret Sharing Scheme MTSF --- Market-Theoretic Security Framework: A Unified Paradigm For The Art Of Proving and Disproving Security Ticket to Hide: Private, Practical Proofs of Provenance for TLS Linear Code Equivalence via Plücker Coordinates Survey of isogeny-based signature schemes resistant to Castryck–Decru attack On the Need for (Quantum) Memory with Short Outputs Simulating Noisy Leakage with Bounded Leakage: Simpler, Better, Faster Relaxed Modular PCS from Arbitrary PCS and Applications to SNARKs for Integers Tripling on Hessian curves via isogeny decomposition Reducing the Number of Qubits in Quantum Discrete Logarithms on Elliptic Curves At-Compromise Security: The Case for Alert Blindness A Practical Neighborhood Search Attack on Oracle MLWE Designated-Verifier Dynamic zk-SNARKs with Applications to Dynamic Proofs of Index Abelian surfaces in Hesse form and explicit isogeny formulas Efficiently Provable Approximations for Non-Polynomial Functions Laminate: Succinct SIMD-Friendly Verifiable FHE Accelerating FrodoKEM in Hardware TSS-PV: Traceable Secret Sharing with Public Verifiability PIRANHAS: PrIvacy-Preserving Remote Attestation in Non-Hierarchical Asynchronous Swarms Small-field hash-based SNARGs are less sound than conjectured Hash-Based Blind Signatures: First Steps Partial Fraction Techniques for Cryptography VIA: Communication-Efficient Single-Server Private Information Retrieval Enabling Index-free Adjacency in Oblivious Graph Processing with Delayed Duplications Accurate BGV Parameters Selection: Accounting for Secret and Public Key Dependencies in Average-Case Analysis Multi-Party Functional Encryption (MPFE): A tool in the distributed and decentralized world Compact, Efficient and CCA-Secure Updatable Encryption from Isogenies Faster Homomorphic Integer Computer Tempo: An ML-KEM to PAKE Compiler Resilient to Timing Attacks OhLaLa: Combined Security against Region Fault Attacks in Constant Protection Order Threshold Signatures Reloaded: ML-DSA and Enhanced Raccoon with Identifiable Aborts The Pipes Model for Latency and Throughput Analysis Tighter Quantum Security for Fiat-Shamir-with-Aborts and Hash-and-Sign-with-Retry Signatures InstaRand: Instantly Available and Instantly Verifiable On-chain Randomness Simple and Efficient Lattice Threshold Signatures with Identifiable Aborts BERMUDA: A BPSec-Compatible Key Management Scheme for DTNs Making Uncertified DAG BFT Provably Live with Linear Payload and Quadratic Metadata Communication A proof of P≠NP (New symmetric encryption algorithm against any linear attacks and differential attacks) ETK: External-Operations TreeKEM and the Security of MLS in RFC 9420 A Combinatorial Attack on Ternary Sparse Learning with Errors (sLWE) A Divide-and-Conquer Strategy for Hard-Label Extraction of Deep Neural Networks via Side-Channel Attacks On the practicality of quantum sieving algorithms for the shortest vector problem Dynamic zk-SNARKs (with applications to sparse zk-SNARKs and IVC) ProxCode: Efficient Proximity Searchable Encryption from Error Correcting Codes Two-Round Threshold Signature from Algebraic One-More Learning with Errors The Last Challenge Attack on Fiat-Shamir in KZG-based SNARKs A New Perspective on Key Switching for BGV-like Schemes Improved Circuit Synthesis with Multi-Value Bootstrapping for FHEW-like Schemes DiStefano: Decentralized Infrastructure for Sharing Trusted Encrypted Facts and Nothing More Finding and Evaluating Parameters for BGV
Attacking Single-Cycle Ciphers on Modern FPGAs featuring Explainable Deep Learning
Mustafa Khai · 2025-03-13 · via Cryptology ePrint Archive

Paper 2025/478

Attacking Single-Cycle Ciphers on Modern FPGAs featuring Explainable Deep Learning

Trevor Yap, Nanyang Technological University

Abstract

In this paper, we revisit the question of key recovery using side-channel analysis for unrolled, single-cycle block ciphers. In particular, we study the Princev2 cipher. While it has been shown vulnerable in multiple previous studies, those studies were performed on side-channel friendly ASICs or older FPGAs (e.g., Xilinx Virtex II on the SASEBO-G board), and using mostly expensive equipment. We start with the goal of exploiting a cheap modern FPGA and board using power traces from a cheap oscilloscope. Particularly, we use Xilinx Artix 7 on the Chipwhisperer CW305 board and PicoScope 5000A, respectively. We split our study into three parts. First, we show that the new set-up still exhibits easily detectable leakage, using a non-specific t-test. Second, we replicate attacks from older FPGAs. Namely, we start with the attack by Yli-Mäyry et al., which is a simple chosen plaintext correlation power analysis attack using divide and conquer. However, we demonstrate that even this simple, powerful attack does not work, demonstrating a peculiar behavior. We study this behavior using a stochastic attack that attempts to extract the leakage model, and we show that models over a small part of the state are inconsistent and depend on more key bits than what is expected. We also attempt classical template attacks and get similar results. To further exploit the leakage, we employ deep learning techniques and succeed in key recovery, albeit using a large number of traces. We perform the explainability technique called Key Guessing Occlusion (KGO) to detect which points the neural networks exploit. When we use these points as features for the classical template attack, although it did not recover the secret key, its performance improves compared to other feature selection techniques.

BibTeX

@misc{cryptoeprint:2025/478,
      author = {Mustafa Khairallah and Trevor Yap},
      title = {Attacking Single-Cycle Ciphers on Modern {FPGAs} featuring Explainable Deep Learning},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/478},
      year = {2025},
      doi = {https://link.springer.com/chapter/10.1007/978-3-032-01799-4_2},
      url = {https://eprint.iacr.org/2025/478}
}