Nilanjan Datta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Nilanjan Datta has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Mridul Nandi
Indian Statistical Institute
3 shared publications - Debdeep Mukhopadhyay
Computer Science and Engineering, Indian Institute of Technology Kharagpur
2 shared publications - Avijit Dutta
Institute for Advancing Intelligence (IAI) TCG-CREST, Kolkata, India and Academy of Scientific and Innovative Research (AcSIR), Ghaziabad, India
1 shared publication Avik Chakraborti
Indian Statistical Institute, Kolkata
1 shared publication- Avik Chakraborti
Institute for Advancing Intelligence (IAI), TCG CREST
1 shared publication - Dirmanto Jap
Nanyang Technological University
1 shared publication
Latest Publications
- 6 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 27 (12) , 2829-2841
Power Efficiency of S-Boxes: From a Machine-Learning-Based Tool to a Deterministic Model
Designing cryptographically good and power-efficient 4x4 S-boxes is a challenging problem in the era of lightweight cryptography. Although the optimal cryptographic properties are easy to determine, verifying the power efficiency of an S-box is nontrivial. The conventional approach of determining the power consumption using commercially available CAD tools is highly time-consuming, which becomes formidable while dealing with a large pool of S-boxes. This mandates the development of automation that should quickly characterize the power efficiency from the Boolean function representation of an S-box. In this paper, we present a supervised machine-learning-assisted automated framework to resolve the problem for 4x4 S-boxes, which turns out to be 14 times faster than the traditional approach. The key idea is to extrapolate the knowledge of literal counts, and-or-not gate counts in the sum-of-products (SOP) form of the underlying Boolean functions to predict the dynamic power efficiency. We demonstrate the effectiveness of our framework by reporting on a set of power-efficient (involutive) optimal S-boxes from a large set of S-boxes. We also develop a deterministic model using results obtained from supervised learning to predict the dynamic power of an S-box that can be used in an evolutionary algorithm to generate cryptographically good and low-power S-boxes.
- 6 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 27 (12) , 2829-2841
Power Efficiency of S-Boxes: From a Machine-Learning-Based Tool to a Deterministic Model
Designing cryptographically good and power-efficient 4x4 S-boxes is a challenging problem in the era of lightweight cryptography. Although the optimal cryptographic properties are easy to determine, verifying the power efficiency of an S-box is nontrivial. The conventional approach of determining the power consumption using commercially available CAD tools is highly time-consuming, which becomes formidable while dealing with a large pool of S-boxes. This mandates the development of automation that should quickly characterize the power efficiency from the Boolean function representation of an S-box. In this paper, we present a supervised machine-learning-assisted automated framework to resolve the problem for 4x4 S-boxes, which turns out to be 14 times faster than the traditional approach. The key idea is to extrapolate the knowledge of literal counts, and-or-not gate counts in the sum-of-products (SOP) form of the underlying Boolean functions to predict the dynamic power efficiency. We demonstrate the effectiveness of our framework by reporting on a set of power-efficient (involutive) optimal S-boxes from a large set of S-boxes. We also develop a deterministic model using results obtained from supervised learning to predict the dynamic power of an S-box that can be used in an evolutionary algorithm to generate cryptographically good and low-power S-boxes.
- 26 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 68 (10) , 1498-1510
SCADFA: Combined SCA+DFA Attacks on Block Ciphers with Practical Validations
We present the first practically realizable side-channel assisted fault attack on any block-ciphers having bit-permutation with optimal diffusion, that can retrieve the round key efficiently using random nibble faults. The attack demonstrates how side-channel leakage can allow the adversary to precisely determine the fault mask resulting from a nibble fault injection instance. We first demonstrate the viability of such attack model via side-channel analysis experiments on top of a laser-based fault injection setup, targeting a PRESENT-80 and GIFT-128 (two popular block-ciphers based on bit-permutation having optimal diffusion) implementation on an ATmega328P microcontroller. Subsequently, we present a differential fault analysis (DFA) exploiting the knowledge of the output fault mask in the target round to recover multiple last round keys nibbles independently and in parallel. We show that the combined attack can recover the last round key of PRESENT-80 and GIFT-128 with 4 random nibble fault injections in the best case. In the average case, the number of random nibble faults required for PRESENT-80 and GIFT-128 are 9-18 and 6-9 respectively.
- 26 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 68 (10) , 1498-1510
SCADFA: Combined SCA+DFA Attacks on Block Ciphers with Practical Validations
We present the first practically realizable side-channel assisted fault attack on any block-ciphers having bit-permutation with optimal diffusion, that can retrieve the round key efficiently using random nibble faults. The attack demonstrates how side-channel leakage can allow the adversary to precisely determine the fault mask resulting from a nibble fault injection instance. We first demonstrate the viability of such attack model via side-channel analysis experiments on top of a laser-based fault injection setup, targeting a PRESENT-80 and GIFT-128 (two popular block-ciphers based on bit-permutation having optimal diffusion) implementation on an ATmega328P microcontroller. Subsequently, we present a differential fault analysis (DFA) exploiting the knowledge of the output fault mask in the target round to recover multiple last round keys nibbles independently and in parallel. We show that the combined attack can recover the last round key of PRESENT-80 and GIFT-128 with 4 random nibble fault injections in the best case. In the average case, the number of random nibble faults required for PRESENT-80 and GIFT-128 are 9-18 and 6-9 respectively.
- Open Access
- 1 January 2019
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 13 (4) , 705-732
$\textsf{DWCDM+}$: A BBB secure nonce based MAC
In CRYPTO 2016, Cogliati and Seurin have proposed a nonce-based MAC called Encrypted Wegman-Carter with Davies-Meyer ($\textsf{EWCDM}$ ), from an$n$ -bit block cipher$\textsf{E}$ and an$n$ -bit almost xor universal hash function$\textsf{H}$ as $\textsf{E}_{K_2}\bigl(\textsf{E}_{K_1}(N)\oplus N\oplus \textsf{H}_{K_h}(M)\bigr),$ for a nonce$N$ and a message$M$ that provides roughly$2n/3$ -bit MAC security. However, obtaining the similar security using a single block cipher key was posed as an open research problem. In this paper, we present Decrypted Wegman-Carter with Davies-Meyer ($\textsf{DWCDM+}$ ) construction based on a single block cipher key that provides$2n/3$ -bit MAC security from an$n$ -bit block cipher$\textsf{E}$ and an$n$ -bit$k$ -regular ($\forall k \leq n$ ), almost xor universal hash function$\textsf{H}$ as $ \textsf{E}^{-1}_{K}\bigl(\textsf{E}_{K}(N)\oplus N \oplus \textsf{H}_{K_h}(M)\bigr). $$\textsf{DWCDM+}$ is structurally very similar to its predecessor$\textsf{EWCDM}$ except that the facts that (i) the number of block cipher keys reduced from$2$ to$1$ and (ⅱ) the outer encryption call is replaced by a decryption one. To make the construction truely single-keyed, here we derive the hash key$K_h$ as the block cipher output of a fixed string$0^{n-2} \| 10$ as long as the hash key is of$n$ bits. We show that if the nonce space is restricted to$(n-1)$ bits,$\textsf{DWCDM+}$ is secured roughly up to$2^{2n/3}$ MAC queries ($2^{n/2}$ MAC queries) and$2^n$ verification queries against nonce respecting (nonce misuse resp.) adversaries.- 1 January 2019
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 13 (4) , 705-732
Open Access$\textsf{DWCDM+}$: A BBB secure nonce based MAC
In CRYPTO 2016, Cogliati and Seurin have proposed a nonce-based MAC called Encrypted Wegman-Carter with Davies-Meyer ($\textsf{EWCDM}$ ), from an$n$ -bit block cipher$\textsf{E}$ and an$n$ -bit almost xor universal hash function$\textsf{H}$ as $\textsf{E}_{K_2}\bigl(\textsf{E}_{K_1}(N)\oplus N\oplus \textsf{H}_{K_h}(M)\bigr),$ for a nonce$N$ and a message$M$ that provides roughly$2n/3$ -bit MAC security. However, obtaining the similar security using a single block cipher key was posed as an open research problem. In this paper, we present Decrypted Wegman-Carter with Davies-Meyer ($\textsf{DWCDM+}$ ) construction based on a single block cipher key that provides$2n/3$ -bit MAC security from an$n$ -bit block cipher$\textsf{E}$ and an$n$ -bit$k$ -regular ($\forall k \leq n$ ), almost xor universal hash function$\textsf{H}$ as $ \textsf{E}^{-1}_{K}\bigl(\textsf{E}_{K}(N)\oplus N \oplus \textsf{H}_{K_h}(M)\bigr). $$\textsf{DWCDM+}$ is structurally very similar to its predecessor$\textsf{EWCDM}$ except that the facts that (i) the number of block cipher keys reduced from$2$ to$1$ and (ⅱ) the outer encryption call is replaced by a decryption one. To make the construction truely single-keyed, here we derive the hash key$K_h$ as the block cipher output of a fixed string$0^{n-2} \| 10$ as long as the hash key is of$n$ bits. We show that if the nonce space is restricted to$(n-1)$ bits,$\textsf{DWCDM+}$ is secured roughly up to$2^{2n/3}$ MAC queries ($2^{n/2}$ MAC queries) and$2^n$ verification queries against nonce respecting (nonce misuse resp.) adversaries. - 22 November 2017
- Published by Springer Nature
- p. 111-132
Practical Fault Attacks on Minalpher: How to Recover Key with Minimum Faults?
- 22 November 2017
- Published by Springer Nature
- p. 111-132
Practical Fault Attacks on Minalpher: How to Recover Key with Minimum Faults?
- 2 February 2016
- Published by Springer Nature
- p. 39-54
INT-RUP Analysis of Block-cipher Based Authenticated Encryption Schemes
- 2 February 2016
- Published by Springer Nature
- p. 39-54
INT-RUP Analysis of Block-cipher Based Authenticated Encryption Schemes
- 25 June 2015
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 433-450
Generalizing PMAC Under Weaker Assumptions
- 25 June 2015
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 433-450
Generalizing PMAC Under Weaker Assumptions