Timing attack

About: Timing attack is a research topic. Over the lifetime, 726 publications have been published within this topic receiving 25462 citations.

A New Sign-Change Attack on the Montgomery Ladders

Abstract: In the 1980s, Peter Montgomery developed a powerful, fast algorithm for calculating multiples of field elements. Over subsequent years, the algorithm was adapted to work in arbitrary abelian groups. By the year 2000, it had been developed further to resist standard power and timing attacks and became known as the ‘Montgomery ladder’. In the literature, the focus of this algorithm has been to compute from most to least significant bit, known as the ‘left-to-right’ version. In this paper, we first resurrect the corresponding ‘right-to-left’ version of the Montgomery powering ladder and then demonstrate a new attack on both versions in the context of elliptic curves.

Two-prime RSA immune cryptosystem and its FPGA implementation

Abstract: In this paper, an efficient immunity method is proposed for two-prime RSA cryptosystem against hardware fault attack. The proposed system has more immunity than the previous system and is targeted for FPGA implementation. For the 32-bit signing case, the proposed method is 15% faster than the previous design while requiring only 70% of the hardware resource.

Cache Side-Channel Attack to Recover Plaintext against Datagram TLS

Abstract: The DTLS (Datagram Transport Layer Security) protocol allows a huge number of delay-sensitive applications to communicate in a secure channel, and its security research is growing with significant importance. We propose an attack framework to recovery plaintext in DTLS. Our attack leverages the cache side-channel attack to obtain necessary information, and then a padding oracle attack is performed to recovery plaintext. Experimental results on an AES implementation verify the validity and the efficiency of our attack method. This new attack suggests that countermeasures must be provided to guarantee the security of DTLS.

Information theoretical evaluation of the bucketing technique to mitigate timing attacks

Abstract: Timing attack are regarded as serious threats to many practical security mechanisms. However, it is difficult to estimate the risk of attack because we cannot predict the ability and the behavior of attackers. To tackle this issue, Köpf et al. focus on the mutual information between a secret key and timing observations that an attacker acquires. Any attacker cannot learn more information than the mutual information, and the discussion of this approach gives a certain upperbound on the risk of timing attacks. Köpf et al. adopted this approach to evaluate the contribution of a bucketing technique that was proposed by themselves. However, the mathematical discussion therein needs more improvement. The purpose of this study is to refine the discussion of Köpf, and give more precise understanding of the contribution of the bucketing technique.

Optical Fault Attack on CRT-Based RSA

Abstract: The Chinese Remainder Theorem(CRT)based RSA algorithm is very suitable in smartcard and cryptosystem,however the security benefit people's interestThis paper showed a method to practice an optical injection in cryptographic deviceThe attack was used laser irradiation the depackaged device to impact cryptographic computation process,obtained the secret information from the inside of chipThis paper presented implementation CRT-RSA algorithm in cryptographic device existed security issue