EDBT 2026 Demo / reviewers in the wild / expert
Bhagwan N. Bathe
dblp:209/5862
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 67% Hardware security and side channels · 33% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware security and side channels › fault attacks
differential fault analysis |
0.5 | 1 | 2021 | Differential Fault Attack on Kreyvium & FLIP · IEEE Trans. Computers 2021 |
Cryptographic primitives and cryptanalysis
stream cipher cryptanalysis |
0.5 | 1 | 2021 | Differential Fault Attack on Kreyvium & FLIP · IEEE Trans. Computers 2021 |
Methods — techniques the papers use, named apart from their topics
key recovery · 0.5differential fault analysis · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Differential Fault Attack on Kreyvium & FLIPabstractIn this article, we propose key recovery attack on two stream ciphers: Kreyvium and FLIP$_{530}(42,128,360)$using Differential Fault Attack (DFA) technique. These two ciphers are being used in Fully Homomorphic Encryption (FHE) due to their low error growth during keystream generation. Kreyvium is an NFSR-based stream cipher and FLIP is a permutation-based stream cipher. We first show that the complete state of the Kreyvium can be recovered by injecting 3 faults and considering 450 many keystream bits. In case of FLIP, we show that if there is a 1-bit fault in the state of the cipher then from 9000 normal and faulty keystream bits the state (i.e., the secret key) of the cipher can be recovered. For single bit fault, one will require to solve a system of equations for each 530 possible fault locations to recover the correct key of FLIP. To the best of our knowledge, this is the first article which analyzes the security of these two FHE supported stream ciphers under DFA and it has been observed that DFA completely reveals the secret keys of these two ciphers with very minimal faults. Dibyendu Roy 0001, Bhagwan N. Bathe, Subhamoy Maitra |
IEEE Trans. Computers | 2 |