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

推荐订阅源

奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
小众软件
小众软件
博客园 - 三生石上(FineUI控件)
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
博客园_首页
Last Week in AI
Last Week in AI
美团技术团队
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Apple Machine Learning Research
Apple Machine Learning Research
WordPress大学
WordPress大学
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园 - Franky
The Cloudflare Blog
罗磊的独立博客
月光博客
月光博客
N
Netflix TechBlog - Medium
C
Check Point Blog
Microsoft Security Blog
Microsoft Security Blog
F
Fortinet All Blogs
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Microsoft Azure Blog
Microsoft Azure Blog
IT之家
IT之家
Jina AI
Jina AI
J
Java Code Geeks

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
A Prompt Framework for LLM-Based Fully Automated Simple P...
2024-12-24 · via Cryptology ePrint Archive

Paper 2024/2069

A Prompt Framework for LLM-Based Fully Automated Simple Power Analysis on Cryptosystems

An Wang, Beijing Institute of Technology

Yaoling Ding, Beijing Institute of Technology

Congming Wei, Communication University of China

Jingqi Zhang, Beijing Institute of Technology

Jiakun Li, Beijing Institute of Technology

Liehuang Zhu, Beijing Institute of Technology

Abstract

Side-channel analysis is a powerful technique to extract secret data from cryptographic devices. However, this task heavily relies on experts and specialized tools, particularly in the case of simple power analysis (SPA). Meanwhile, large language models (LLMs) have demonstrated remarkable capabilities in assisting users with complex tasks, yet their potential for fully automated SPA remains unexplored. In this paper, we propose a novel prompt framework specifically designed for SPA tasks, enabling non-experts to perform end-to-end automated analysis by providing traces and prompts to an LLM in a single interaction. Our framework consists of six components: role, reinforce, input, task description, chain-of-thought, and expert strategies, with three expert strategies instantiated for SPA. To validate the framework's effectiveness and generalizability, we establish a dataset comprising seven sets of real power traces from various implementations of public-key cryptosystems, including RSA, ECC, and Kyber, as well as eighteen sets of simulated power traces that illustrate typical SPA leakage patterns. We compare against a representative unsupervised horizontal clustering attack, which achieves only 52.04% accuracy. In contrast, our framework enables GPT-4o and DeepSeek-V3.1 to achieve overall average accuracies of 98.02% and 97.83%, respectively. Furthermore, our framework reduces the analysis time by over 93.09% compared to manual analysis at comparable accuracy, enabling non-experts to complete SPA tasks in minutes rather than hours. Notably, this work represents the first successful application of LLMs to achieve fully automated SPA.

BibTeX

@misc{cryptoeprint:2024/2069,
      author = {Wenquan Zhou and An Wang and Yaoling Ding and Congming Wei and Jingqi Zhang and Jiakun Li and Liehuang Zhu},
      title = {A Prompt Framework for {LLM}-Based Fully Automated Simple Power Analysis on Cryptosystems},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/2069},
      year = {2024},
      url = {https://eprint.iacr.org/2024/2069}
}