Cryptanalysis of DES Implemented on Computers with Cache

Tsunoo, Yukiyasu; Saito, Teruo; Suzaki, T.; Shigeri, Maki; Miyauchi, Hiroshi

doi:10.1007/978-3-540-45238-6_6

Cited by 198 publications

(149 citation statements)

References 5 publications

Supporting

Mentioning

148

Contrasting

Unclassified

Order By: Relevance

“…A Pseudorandom Number Generators (PRNG) are well-known techniques with broad applications in such areas as cryptography (Tusnoo et al, 2003;Ozturk et al, 2004;Panneton et al, 2006), simulation of stochastic processes (Entacher, 1998), comprehensive testing of technical systems (Leeb and Wegenkittl, 1997;Park and Miller, 1998), medical (Menyaev and Zharov, 2006a;2006b;Menyaev and Zharova, 2006;2013;2016;Sarimollaoglu et al, 2014;Cai et al, 2016a;2016b) and biological research (Wiese et al, 2005;Leonard and Jackson, 2015;Juratly et al, 2015;2016) and others (Rababbah 2004;2007;Politano et al, 2014;2016;Riguzzi, 2016). In these publications, the concept of uniform random numbers in PRNG actively uses the operations of bit logic.…”

Section: Related Workmentioning

confidence: 99%

Parametrical Tuning of Twisting Generators

Deon¹,

Menyaev²

2016

Journal of Computer Science

View full text Add to dashboard Cite

Generators of uniformly distributed random numbers are broadly applied in simulations of stochastic processes that rely on normal and other distributions. In a point of fact, the uniform random numbers are actively used for applications that range from, modeling different phenomena such as theoretical mathematics and technical designing, to evidence-based medicine. This paper proposes a novel approach which consists of a combination of global twister with circular technique and initial congruential generation with complete stochastic sequences. It has been experimentally confirmed that for complete sequences this type of generation provides uniformity in distribution of random numbers. The offered program codes include the tuning methods for the generation technique where random numbers may take any bit length. Moreover, the automatic switching of generator parameters such as initial congruential constants depending on intervals for generated numbers is considered as well. Demonstrated results of testing confirm the uniformity of distribution without any repeated or skipped generated elements.

show abstract

Section: Related Workmentioning

confidence: 99%

Parametrical Tuning of Twisting Generators

Deon¹,

Menyaev²

2016

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…we have a cache with a granularity of 16 bytes) we can only be sure of the high nibble of the approximation given. Therefore ( 16 with at most sixteen different messages i.e. all sixteen possible values for the high nibble of p 2 can be tried until a cache hit is observed.…”

Section: The Power Consumptionmentioning

confidence: 99%

“…In all the equations used to test key hypotheses, the values generated are always compared with the neighbouring byte. If, for example, all bytes in the algorithm are masked with the random R the first phase of the attack described in section 4 will give (k 1 ⊕R⊕k 2 ⊕R)∧F0 16 . The R's will cancel leaving (k 1 ⊕ k 2 ) ∧ F0 16 as with the approach detailed in section 4.…”

Section: Implementing the Attackmentioning

confidence: 99%

“…The attack can continue in the same manner as the attack described in Section 5.2 but the total attack will require around 480 acquisitions and an exhaustive search of 2 16 to derive the entire key.…”

Section: The Xtime Functionmentioning

confidence: 99%

“…Several attacks have been published on using cache access events as a sidechannel [2,3,11,16] on DES and AES. These are predominately timing attacks taking into account the total number of cache misses in the algorithm to determine information on the secret key being used.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Cache Based Power Analysis Attacks on AES

Fournier

Tunstall

2006

Information Security and Privacy

View full text Add to dashboard Cite

Abstract. This paper describes possible attacks against software implementations of AES running on processors with cache mechanisms, particularly in the case of smart cards. These attacks are based on sidechannel information gained by observing cache hits and misses in the current drawn by the smart card. Two different attacks are described. The first is a combination of ideas proposed in [2] and [11] to produce an attack that only requires the manipulation of the plain text and the observation of the current. The second is an attack based on specific implementations of the xtime function [10]. These attacks are shown to also work against algorithms using Boolean data masking techniques as a DPA countermeasure.

show abstract

Theoretical and practical aspects of multiple samples correlation power analysis

Zhang

Zhou

Feng

2016

Security Comm Networks

View full text Add to dashboard Cite

There is more than one sample in a power trace, corresponding to the process of the target intermediate value, which are known as interesting points. One can exploit the power leakages at multiple samples to recover the secret key used by the crypto device, and that is the idea of multiple samples correlation power analysis (MSCPA). Considering that the leakage exploitation of MSCPA is more efficient than that of correlation power analysis (CPA), the power of MSCPA should be stronger than that of CPA. We theoretically prove and practically verify this fact. Theoretically, we show the advantage of MSCPA over CPA in terms of the correct key distinguishing level. We show that compared with CPA, MSCPA enlarges the gap between the correlation coefficient computed under the correct key and the correlation coefficients computed under wrong key guesses, which makes the correct key easier to be distinguished. Practically, we evaluate the performance of MSCPA in real scenarios. Using power traces provided by DPA Contest v2 and v4.1, we compare the key‐recovery efficiency of MSCPA with that of CPA. Experimental results show that compared with CPA, MSCPA can reach a higher key‐recovery efficiency in the same scenario. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Cryptanalysis of DES Implemented on Computers with Cache

Cited by 198 publications

References 5 publications

Parametrical Tuning of Twisting Generators

Parametrical Tuning of Twisting Generators

Cache Based Power Analysis Attacks on AES

Theoretical and practical aspects of multiple samples correlation power analysis

Contact Info

Product

Resources

About