Sharing nonlinear gates in the presence of glitches

Alemneh, E. (2010) Sharing nonlinear gates in the presence of glitches.

[img]
Preview
PDF
1MB
Abstract:Side-channel attacks are based on measuring multiple physical characteristics of a hardware implementation while certain cryptographic operation is executed. These attacks can be mounted easily, and they are very effective.Masking techniques are used in order to make an implementation to resist side channel attack by concealing a vulnerable intermediate result using random values. Many masking schemes rely on unrealistic hardware assumptions. In particular, most of the known masking techniques in presence of glitches will leak information when non-linear functions are carried out. Recently, a new masking method that is based on secret sharing schemes and multi-party computation methods has been proposed by Nikova et al. This new approach can be used for implementations which can be proved to be secure even when glitches occur. In this thesis, we apply the method by Nikova et al. for constructing a secure implementations of two toy S-boxes Minikeccak and ToyAES. After discussing the technique, we have estimated the complexity of the search for applying the method to the SHA-3 candidate Keccak. We show that the construction is difficult to be achieved in the current hardware because of a huge search space that makes the search computationally unafordable. Finally, We applied the technique to the S-box of a reduced versions of Keccak and a reduced version of the AES S-Box. The results proved that both of them can not be shared successfully using three shares
Item Type:Essay (Master)
Faculty:EEMCS: Electrical Engineering, Mathematics and Computer Science
Subject:54 computer science
Programme:Computer Science MSc (60300)
Link to this item:http://purl.utwente.nl/essays/59599
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page