A new approach for side channel analysis on stream ciphers and related constructions

Side Channel Analysis (SCA) is among the newly emerged threats to small scale devices performing a cryptographic operation. While such analysis is well studied against the block ciphers, we observe that the stream cipher counterpart is not that much explored. We propose novel modelling that can work...

Full description

Saved in:
Bibliographic Details
Main Authors: Baksi, Anubhab, Kumar, Satyam, Sarkar, Santanu
Other Authors: School of Computer Science and Engineering
Format: Article
Language:English
Published: 2022
Subjects:
Online Access:https://hdl.handle.net/10356/163769
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-163769
record_format dspace
spelling sg-ntu-dr.10356-1637692022-12-16T03:35:21Z A new approach for side channel analysis on stream ciphers and related constructions Baksi, Anubhab Kumar, Satyam Sarkar, Santanu School of Computer Science and Engineering Engineering::Computer science and engineering Ciphers Hamming Weight Side Channel Analysis (SCA) is among the newly emerged threats to small scale devices performing a cryptographic operation. While such analysis is well studied against the block ciphers, we observe that the stream cipher counterpart is not that much explored. We propose novel modelling that can work with a number of stream ciphers and related constructions. We show practical state/key recovery attacks on the lightweight ciphers, LIZARD, PLANTLET and GRAIN-128-AEAD. We consider the software platform (where the Hamming weight leakage is available) as well as the hardware platform (where the Hamming distance leakage is available). Through the modelling of Satisfiability Modulo Theory (SMT), we show that the solution can be obtained in a matter of seconds in most cases. In a handful of cases, however, the entire state/key recovery is not feasible in a practical amount of time. For those cases, we show full recovery is possible when a small number of bits are guessed. We also study the effect of increasing/decreasing the number of keystream bits on the solution time. Following a number of literature, we initially assume the traces that are obtained are noiseless. Later, we show how an extension of our model can deal with the noisy traces (which is a more general assumption). The second author would like to acknowledge NBHM and SERB for the funding. 2022-12-16T03:35:21Z 2022-12-16T03:35:21Z 2021 Journal Article Baksi, A., Kumar, S. & Sarkar, S. (2021). A new approach for side channel analysis on stream ciphers and related constructions. IEEE Transactions On Computers, 71(10), 2527-2537. https://dx.doi.org/10.1109/TC.2021.3135191 0018-9340 https://hdl.handle.net/10356/163769 10.1109/TC.2021.3135191 2-s2.0-85121773009 10 71 2527 2537 en IEEE Transactions on Computers © 2021 IEEE. All rights reserved.
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Engineering::Computer science and engineering
Ciphers
Hamming Weight
spellingShingle Engineering::Computer science and engineering
Ciphers
Hamming Weight
Baksi, Anubhab
Kumar, Satyam
Sarkar, Santanu
A new approach for side channel analysis on stream ciphers and related constructions
description Side Channel Analysis (SCA) is among the newly emerged threats to small scale devices performing a cryptographic operation. While such analysis is well studied against the block ciphers, we observe that the stream cipher counterpart is not that much explored. We propose novel modelling that can work with a number of stream ciphers and related constructions. We show practical state/key recovery attacks on the lightweight ciphers, LIZARD, PLANTLET and GRAIN-128-AEAD. We consider the software platform (where the Hamming weight leakage is available) as well as the hardware platform (where the Hamming distance leakage is available). Through the modelling of Satisfiability Modulo Theory (SMT), we show that the solution can be obtained in a matter of seconds in most cases. In a handful of cases, however, the entire state/key recovery is not feasible in a practical amount of time. For those cases, we show full recovery is possible when a small number of bits are guessed. We also study the effect of increasing/decreasing the number of keystream bits on the solution time. Following a number of literature, we initially assume the traces that are obtained are noiseless. Later, we show how an extension of our model can deal with the noisy traces (which is a more general assumption).
author2 School of Computer Science and Engineering
author_facet School of Computer Science and Engineering
Baksi, Anubhab
Kumar, Satyam
Sarkar, Santanu
format Article
author Baksi, Anubhab
Kumar, Satyam
Sarkar, Santanu
author_sort Baksi, Anubhab
title A new approach for side channel analysis on stream ciphers and related constructions
title_short A new approach for side channel analysis on stream ciphers and related constructions
title_full A new approach for side channel analysis on stream ciphers and related constructions
title_fullStr A new approach for side channel analysis on stream ciphers and related constructions
title_full_unstemmed A new approach for side channel analysis on stream ciphers and related constructions
title_sort new approach for side channel analysis on stream ciphers and related constructions
publishDate 2022
url https://hdl.handle.net/10356/163769
_version_ 1753801125793890304