Randomised representations
Randomised representations
- Author(s): N.P. Smart ; E. Oswald ; D. Page
- DOI: 10.1049/iet-ifs:20070017
For access to this article, please select a purchase option:
Buy article PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
Thank you
Your recommendation has been sent to your librarian.
- Author(s): N.P. Smart 1 ; E. Oswald 1, 2 ; D. Page 1
-
-
View affiliations
-
Affiliations:
1: Department of Computer Science, University of Bristol, Bristol, UK
2: Institute for Applied Information Processing and Communications (IAIK), Graz University of Technology, Graz, Austria
-
Affiliations:
1: Department of Computer Science, University of Bristol, Bristol, UK
- Source:
Volume 2, Issue 2,
June 2008,
p.
19 – 27
DOI: 10.1049/iet-ifs:20070017 , Print ISSN 1751-8709, Online ISSN 1751-8717
- « Previous Article
- Table of contents
- Next Article »
The authors show that a number of existing methods for side-channel defence are essentially the same techniques presented in different contexts. By abstracting this technique, they present necessary conditions which need to be satisfied for it to be successful in preventing side-channel analysis. They also show that concrete application of the technique via randomised field representation produces more efficient implementations than application of the technique via randomised projective coordinates.
Inspec keywords: public key cryptography; digital arithmetic
Other keywords:
Subjects: Data security; Digital arithmetic methods; Cryptography theory; Cryptography
References
-
-
1)
- Standaert, F.-X., Malkin, T.G., Yung, M.: `A formal practice-oriented model for the analysis of side-channel attacks', Report 2006/139, 2006.
-
2)
- S. Chari , C.S. Jutla , J.R. Rao , P. Rohatgi . Towards sound approaches to counteract power-analysis attacks. LNCS , 398 - 412
-
3)
- Page, D., Vercauteren, F.: `Fault and side-channel attacks on pairing based cryptography', Fault Detection and Tolerance in Cryptography – FDTC '05, 2005, p. 56–66.
-
4)
- T.S. Messerges , E.A. Dabbish , R.H. Sloan . Power analysis attacks of modular exponentiation in smartcards. LNCS , 144 - 157
-
5)
- M. Scott . Computing the Tate pairing. LNCS , 293 - 304
-
6)
- Whelan, C., Scott, M.: `Side channel analysis of practical pairing implementations: which path is more secure?', Report 2006/237, 2006.
-
7)
- C. Doche . Redundant trinomials for finite fields of characteristic 2. LNCS , 122 - 133
-
8)
- P.C. Kocher , J. Jaffe , B. Jun . Differential power analysis. LNCS , 388 - 397
-
9)
- J.S. Coron . Resistance against differential power analysis for elliptic curve cryptosystems. LNCS , 292 - 302
-
10)
- M. Joye , C. Tymen . Protections against differential analysis for elliptic curve cryptography – an algebraic approach. LNCS , 377 - 390
-
11)
- D. Agrawal , B. Archambeault , J.R. Rao , P. Rohatgi . The EM side-channel(s). LNCS , 29 - 45
-
12)
- P.C. Kocher . Timing attacks on implementations of Diffie-Hellman, RSA, DSS and other systems. LNCS , 104 - 113
-
13)
- S. Mangard , E. Oswald , T. Popp . (2007) Power analysis attacks, revealing the secrets of smart cards.
-
14)
- C.D. Walter . Montgomery exponentiation needs no final subtractions. Electron. Lett. , 1831 - 1832
-
15)
- A.J. Menezes , P.C. Van Oorschot , S.A. Vanstone . (1997) Handbook of applied cryptography.
-
16)
- N.P. Smart . An analysis of Goubin? refined power analysis attack. LNCS , 281 - 290
-
17)
- E. Öztürk , B. Sunar , E. Savaş . Low-power elliptic curve cryptography using scaled modular arithmetic. LNCS , 92 - 106
-
18)
- S. Micali , M. Reyzin . Physically observable cryptography. LNCS , 278 - 296
-
19)
- J.D. Golić , C. Tymen . Multiplicative masking and power analysis of AES. LNCS , 198 - 212
-
20)
- D. Naccache , N.P. Smart , J. Stern . Projective coordinates leak. LNCS , 257 - 267
-
21)
- Solinas, J.: `Generalized Mersenne numbers', Technical report, 1999.
-
22)
- C.D. Walter . Faster modular multiplication by operand scaling. LNCS , 313 - 323
-
23)
- P.L. Montgomery . Modular multiplication without trial division. Math. Comput. , 519 - 521
-
24)
- L. Goubin . A refined power analysis attack on elliptic curve cryptosystems. LNCS , 199 - 211
-
1)
Related content
