Research on Online Leakage Assessment

Author(s):  
Zhengguang Shi ◽  
Fan Huang ◽  
Mengce Zheng ◽  
Wenlong Cao ◽  
Ruizhe Gu ◽  
...  
Keyword(s):  
Cryptography ◽  
2018 ◽  
Vol 2 (3) ◽  
pp. 26 ◽  
Author(s):  
William Diehl ◽  
Abubakr Abdulgadir ◽  
Farnoud Farahmand ◽  
Jens-Peter Kaps ◽  
Kris Gaj

Authenticated ciphers, which combine the cryptographic services of confidentiality, integrity, and authentication into one algorithmic construct, can potentially provide improved security and efficiencies in the processing of sensitive data. However, they are vulnerable to side-channel attacks such as differential power analysis (DPA). Although the Test Vector Leakage Assessment (TVLA) methodology has been used to confirm improved resistance of block ciphers to DPA after application of countermeasures, extension of TVLA to authenticated ciphers is non-trivial, since authenticated ciphers have expanded input and output requirements, complex interfaces, and long test vectors which include protocol necessary to describe authenticated cipher operations. In this research, we upgrade the FOBOS test architecture with capability to perform TVLA on authenticated ciphers. We show that FPGA implementations of the CAESAR Round 3 candidates ACORN, Ascon, CLOC (with AES and TWINE primitives), SILC (with AES, PRESENT, and LED primitives), JAMBU (with AES and SIMON primitives), and Ketje Jr.; as well as AES-GCM, are vulnerable to 1st order DPA. We then use threshold implementations to protect the above cipher implementations against 1st order DPA, and verify the effectiveness of countermeasures using the TVLA methodology. Finally, we compare the unprotected and protected cipher implementations in terms of area, performance (maximum frequency and throughput), throughput-to-area (TP/A) ratio, power, and energy per bit (E/bit). Our results show that ACORN consumes the lowest number of resources, has the highest TP/A ratio, and is the most energy-efficient of all DPA-resistant implementations. However, Ketje Jr. has the highest throughput.


2014 ◽  
Vol 89 ◽  
pp. 4-12 ◽  
Author(s):  
O. Giustolisi ◽  
L. Berardi ◽  
D. Laucelli ◽  
D. Savic ◽  
T. Walski ◽  
...  

1997 ◽  
Vol 119 (1) ◽  
pp. 10-17 ◽  
Author(s):  
A. Bouzid ◽  
A. Chaaban

Bolted flanged joint assemblies may begin to leak some time following a successful hydrostatic test. One of the reasons is that the gasket experiences a drop in its initial compressive stress due to creep, thermal dilatation, and thermal degradation. The need to pay attention to the relaxation behavior of bolted joints for high-temperature applications is recognized by the ASME Code, but no specific guidelines are given to help engineers, neither at the design nor maintenance levels. This paper deals with the basic analytical tools that have been used to develop a computer program “SuperFlange” that can be used to make accurate predictions of the relaxation of bolted flanged joints, and hence be able to provide a reasonable leakage assessment over time. A simplified analytical method of relaxation analysis will also be presented. These proposed methods are supported by test results obtained on a real bolted joint fixture and by FE modeling. A strong emphasis will be put on flanged joint rigidity, which is one of the major controlling parameters of relaxation besides the material properties involved.


Author(s):  
Oscar Reparaz ◽  
Benedikt Gierlichs ◽  
Ingrid Verbauwhede
Keyword(s):  

Author(s):  
Takeshi Sugawara

Threshold implementation is studied as a countermeasure against sidechannel attack. There had been no threshold implementation for the AES and Keccak S-boxes that satisfies an important property called uniformity. In the conventional implementations, intermediate values are remasked to compensate for the lack of uniformity. The remasking consumes thousands of fresh random bits and its implementation cost is a serious concern. Daemen recently proposed a 3-share uniform threshold implementation of the Keccak S-box. This is enabled by a new technique called the changing of the guards which can be applied to any invertible functions. Subsequently, Wegener et al. proposed a 4-share threshold implementation of the AES S-box based on the changing of the guards technique. However, a 3-share threshold implementation of AES S-box remains open. The difficulty stays in 2-input multiplication, used in decomposed S-box representations, which is non-invertible because of different input and output sizes. In this study, this problem is addressed by introducing a certain generalization of the changing of the guards technique. The proposed method provides a generic way to construct a uniform sharing for a target function having different input and output sizes. The key idea is to transform a target function into an invertible one by adding additional inputs and outputs. Based on the proposed technique, the first 3-share threshold implementation of AES S-box without fresh randomness is presented. Performance evaluation and simulation-based leakage assessment of the implementation are also presented.


Sign in / Sign up

Export Citation Format

Share Document