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

推荐订阅源

博客园 - Franky
Apple Machine Learning Research
Apple Machine Learning Research
月光博客
月光博客
Vercel News
Vercel News
Recent Announcements
Recent Announcements
B
Blog RSS Feed
Y
Y Combinator Blog
M
MIT News - Artificial intelligence
MongoDB | Blog
MongoDB | Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
雷峰网
雷峰网
D
Docker
Jina AI
Jina AI
IT之家
IT之家
人人都是产品经理
人人都是产品经理
L
LangChain Blog
G
Google Developers Blog
Google DeepMind News
Google DeepMind News
MyScale Blog
MyScale Blog
博客园 - 叶小钗
The GitHub Blog
The GitHub Blog
The Cloudflare Blog
A
About on SuperTechFans
Hugging Face - Blog
Hugging Face - Blog

Cryptology ePrint Archive

Formalizing and Strengthening the Security Proof of NTOR Verifiable Anomaly and Similarity Detection Using Matrix Profile in Private Time-series Adaptor Signature Schemes with Deniable Presignatures Privacy Coins Under Viewing Key Compromise Adaptively-Secure Flexible and Identity-Based Broadcast Encryption from Decomposed LWE MERIDIAN: A Toroid-Inspired Permutation Block Cipher for Constrained Environments PPML Is More Vulnerable to Cryptanalytic Extraction Attacks Toward Practical Fair Data Exchange: Eliminating In-Circuit Public-Key Operations Fault Injection Attacks Against zkSTARKs Scale, Round, Break: Simple Leakage Attacks on Secret Sharing Schemes Private Delegation of (Non-)Membership Proof Updates in Cryptographic Accumulators Beyond Binary: crosscorrelation of Cubic, Quartic and Quintic Character Sequences ZEE200: Zero Knowledge for Everything and Everyone @ 200 KHz A Post-Quantum Accountable Sanitizable Signature Scheme Based on Unbalanced Oil and Vinegar Better Usability: Leakage-Resistant AEADs from Single-length Blockciphers TieredOMap: Skewness-Aware Oblivious Map From Rerandtopia to Interceptopia, the Anamorphic Encryption Saga Rises Non-Adaptive Programmable PRFs and Applications to Stacked Garbling Practical Post-Quantum Secure Publicly Verifiable Secret Sharing and Applications Mosaic: Practical Malicious Security for Garbled Circuits on Bitcoin Efficient Bootstrapping of Matrices in FHE Decomposing Multiplication: A Vertical Packing Approach for Faster TFHE Formal Verification, Integration and Physical Evaluation of Prime-Field Masking on Silicon New Techniques for Communication-Efficient Secure Comparison Protocols Pairing-Based Verifiable Shuffles with Logarithmic-Size Proofs Verifying Provenance of Digital Media: Security Analysis of C2PA and its Implementation EQuADiSE: Efficient Quantum-safe Adaptive Distributed Symmetric-key Encryption Secure and Updatable Single Password Authentication Batch-Puncturing Circuit CP-ABE (and More) from Lattices Panther: Robust Hybrid KEM Combiners via Structural Splicing
Differential Fault Attack on Atom: Bypassing the Double K...
Vaibhav Dixit, Indian Institute of Technology Madras · 2026-06-20 · via Cryptology ePrint Archive

Paper 2026/1294

Differential Fault Attack on Atom: Bypassing the Double Key Filter using Filtered Faults

Satyam Kumar, Indian Institute of Technology Madras

Santanu Sarkar, Indian Institute of Technology Madras

Abstract

In this paper, we present a Differential Fault Attack (DFA) on the lightweight stream cipher Atom, proposed by Banik et al. in IACR Transactions on Symmetric Cryptography (TOSC)-2021. It employs two key filters simultaneously during the pseudo-random generation algorithm phase, one of which depends on LFSR state bits. Due to this LFSR-dependent key filter, the authors claim that forming algebraic equations relating key and state bits as variables to the keystream bits is difficult unless the entire LFSR state is known. In contrast, we propose a method to formulate such algebraic equations without guessing any LFSR bits. This enables us to implement a successful DFA on Atom. To the best of our knowledge, this is the first successful DFA reported on Atom . In the proposed DFA, we identify the location of injected faults using a weighted ensemble of trained MLP and XGBoost models. To further improve accuracy, we filter out ML predictions with confidence below a predefined threshold. We found that this strategy significantly reduces the number of SAT solver invocations and improves the overall time complexity of the attack. Based on our experiments, we demonstrate a successful DFA on Atom within a practical time by injecting 18 faults, provided all are correctly identified. Obtaining a set of 18 correctly identified faults requires, on average, 52 fault injections. The attack requires a total of 70 keystream bits (normal and faulty combined) just after a fault injection and guessing two random key bits.

BibTeX

@misc{cryptoeprint:2026/1294,
      author = {Vaibhav Dixit and Satyam Kumar and Santanu Sarkar},
      title = {Differential Fault Attack on Atom: Bypassing the Double Key Filter using Filtered Faults},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/1294},
      year = {2026},
      url = {https://eprint.iacr.org/2026/1294}
}