{"title":"Differential Fault Attack on HE-Friendly Stream Ciphers: Masta, Pasta, and Elisabeth","authors":"Weizhe Wang;Deng Tang","doi":"10.1109/TC.2025.3558036","DOIUrl":null,"url":null,"abstract":"In this paper, we propose the Differential Fault Attack (DFA) on three Homomorphic Encryption (HE) friendly stream ciphers <monospace>Masta</monospace>, <monospace>Pasta</monospace>, and <monospace>Elisabeth</monospace>. Both <monospace>Masta</monospace> and <monospace>Pasta</monospace> are <monospace>Rasta</monospace>-like ciphers with publicly derived and pseudorandom affine layers. The design of <monospace>Elisabeth</monospace> is an extension of <monospace>FLIP</monospace> and <monospace>FiLIP</monospace>, following the group filter permutator paradigm. All these three ciphers operate on elements over <inline-formula><tex-math>$\\mathbb{Z}_{p}$</tex-math></inline-formula> or <inline-formula><tex-math>$\\mathbb{Z}_{2^{n}}$</tex-math></inline-formula>, rather than <inline-formula><tex-math>$\\mathbb{Z}_{2}$</tex-math></inline-formula>. We can recover the secret keys of all the targeted ciphers through DFA. In particular, for <monospace>Elisabeth</monospace>, we present a new method to determine the filtering path, which is vital to make the attack practical. Our attacks on various instances of <monospace>Masta</monospace> are practical and require only one block of keystream and a single word-based fault. By injecting three word-based faults, we can theoretically mount DFA on two instances of <monospace>Pasta</monospace>, <monospace>Pasta</monospace>-3 and <monospace>Pasta</monospace>-4. For <monospace>Elisabeth</monospace>-4, the only instance of the <monospace>Elisabeth</monospace> family, we present two DFAs in which we inject four bit-based faults or a single word-based fault. With 15000 normal and faulty keystream words, the DFA on <monospace>Elisabeth</monospace>-4 can be completed in just a few minutes.","PeriodicalId":13087,"journal":{"name":"IEEE Transactions on Computers","volume":"74 7","pages":"2267-2277"},"PeriodicalIF":3.8000,"publicationDate":"2025-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computers","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10949832/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we propose the Differential Fault Attack (DFA) on three Homomorphic Encryption (HE) friendly stream ciphers Masta, Pasta, and Elisabeth. Both Masta and Pasta are Rasta-like ciphers with publicly derived and pseudorandom affine layers. The design of Elisabeth is an extension of FLIP and FiLIP, following the group filter permutator paradigm. All these three ciphers operate on elements over $\mathbb{Z}_{p}$ or $\mathbb{Z}_{2^{n}}$, rather than $\mathbb{Z}_{2}$. We can recover the secret keys of all the targeted ciphers through DFA. In particular, for Elisabeth, we present a new method to determine the filtering path, which is vital to make the attack practical. Our attacks on various instances of Masta are practical and require only one block of keystream and a single word-based fault. By injecting three word-based faults, we can theoretically mount DFA on two instances of Pasta, Pasta-3 and Pasta-4. For Elisabeth-4, the only instance of the Elisabeth family, we present two DFAs in which we inject four bit-based faults or a single word-based fault. With 15000 normal and faulty keystream words, the DFA on Elisabeth-4 can be completed in just a few minutes.
期刊介绍:
The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field. It publishes papers on research in areas of current interest to the readers. These areas include, but are not limited to, the following: a) computer organizations and architectures; b) operating systems, software systems, and communication protocols; c) real-time systems and embedded systems; d) digital devices, computer components, and interconnection networks; e) specification, design, prototyping, and testing methods and tools; f) performance, fault tolerance, reliability, security, and testability; g) case studies and experimental and theoretical evaluations; and h) new and important applications and trends.