3,700,820 A 10/1972 Blasbalg et a1. 6,385,329 B1 5/2002 Sharma et a1. 6,580,694 B1 6/2003 Baker 6,584,125 B1 6/2003 Katto 6,728,678 B2 4/2004 Bhadkamkar et 211. 6,754,203 B2 6/2004 Wah et a1. 6,868,094 B1 3/2005 Bordonaro et a1. 6,956,871 B2 * 10/2005 Wang et a1. ................. .. 370/503 7,061,938 B2 6/2006 Hogeboom 7,260,220 B2 8/2007 Steenhof et a1. 7,295,578 B1 11/2007 Lyle et a1. 7,333,...

The most efficient technique for protecting the using Frobenius algorithms for scalar multiplication on Koblitz curves against the Side Channel Attacks seems to be the multiplier randomization technique proposed by Joye and Tymen. In this paper, an heuristic analysis on the security of the Joye and Tymen’s technique is given. A new method improving this technique is proposed. Analysis shows tha...

In the recent years, Higher-order Side Channel attacks have been widely investigated. In particular, 2nd-order DPA have been improved and successfully applied to break several masked implementations. In this context, the development of sound and practical countermeasures against attacks of arbitrary xed order d is of crucial interest. Surprisingly, while many studies have been dedicated to the ...

In October 2012 NIST announced that the SHA-3 hash standard will be based on Keccak. Besides hashing, Keccak can be used in many other modes, including ones operating on a secret value. Many applications of such modes require protection against sidechannel attacks, preferably at low cost. In this paper, we present threshold implementations (TI) of Keccak with three and four shares that build fu...

The development of masking schemes to secure AES implementations against side channel attacks is a topic of ongoing research. Many different approaches focus on the AES S-box and have been discussed in the previous years. Unfortunately, to our knowledge most of these countermeasures only address firstorder DPA. In this article, we discuss the theoretical background of higher order DPA. We give ...

In this paper, we propose a new fast and secure point multiplication algorithm. It is based on a particular kind of addition chains involving only additions (no doubling), providing a natural protection against side channel attacks. Moreover, we propose new addition formulae that take into account the specific structure of those chains making point multiplication very efficient.

A promising approach to defend against side channel attacks is to build programs that are leakage resilient, in a formal sense. One such formal notion of leakage resilience is the n-threshold-probing model proposed in the seminal work by Ishai et al. [15]. In a recent work [8], Eldib and Wang have proposed a method for automatically synthesizing programs that are leakage resilient according to ...

Pattern lock is a very popular mechanism to secure authenticated access to mobile terminals; this is mainly due to its ease of use and the fact that muscle memory endows it with an extreme memorability. Nonetheless, pattern lock is also very vulnerable to smudge and side channels attacks, thus its actual level of security has been often considered insufficient. In this paper we describe a mecha...

In this paper we show that, paradoxically, what looks like a “universal improvement” or a “straight-forward improvement” which enables better security and better reliability on a theoretical level, may in fact, within certain operational contexts, introduce new exposures and attacks, resulting in a weaker operational cryptosystem. We demonstrate a number of such dangerous “improvements”. This i...