TY  - JOUR
  - A. Byrne, N. Meloni, A. Tisserand, E.M. Popovici, W.P. Marnane
  - 2007
  - January
  - Journal of Computers
  - Comparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryptosystem
  - Published
  - Scopus: 8 ()
  - Cryptography, ellitipic curves, side channel attacks, scheduling techniques
  - 2
  - 10
  - 52
  - 62
  - Side channel attacks such as Simple Power Analysis (SPA) attacks provide a new challenge for securing algorithms from an attacker. Algorithms for elliptic curve point scalar multiplication such as the double and add method are prone to these attacks. The protected double and add algorithm provides a simple solution to this problem but is costly in terms of performance. Another class of algorithm for point scalar multiplication that makes use of special addition chains can be used to protect against SPA attacks. A reconfigurable architecture for a cryptographic processor is presented and a number of algorithms for point multiplication are implemented and compared. These algorithms have a degree of parallism within their operations where a number of multiplications can be executed in parallel. Sophisticated scheduling techniques can exploit this parallelism in order to optimize the performance of the calculation. Post place and route results for the processor are given.
  - 10.4304/jcp.2.10.52-62
DA  - 2007/01
ER  - 

@article{V1194765,
   = {A. Byrne,  N. Meloni and  A. Tisserand,  E.M. Popovici and  W.P. Marnane },
   = {2007},
   = {January},
   = {Journal of Computers},
   = {Comparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryptosystem},
   = {Published},
   = {Scopus: 8 ()},
   = {Cryptography, ellitipic curves, side channel attacks, scheduling techniques},
   = {2},
   = {10},
  pages = {52--62},
   = {{Side channel attacks such as Simple Power Analysis (SPA) attacks provide a new challenge for securing algorithms from an attacker. Algorithms for elliptic curve point scalar multiplication such as the double and add method are prone to these attacks. The protected double and add algorithm provides a simple solution to this problem but is costly in terms of performance. Another class of algorithm for point scalar multiplication that makes use of special addition chains can be used to protect against SPA attacks. A reconfigurable architecture for a cryptographic processor is presented and a number of algorithms for point multiplication are implemented and compared. These algorithms have a degree of parallism within their operations where a number of multiplications can be executed in parallel. Sophisticated scheduling techniques can exploit this parallelism in order to optimize the performance of the calculation. Post place and route results for the processor are given.}},
   = {10.4304/jcp.2.10.52-62},
  source = {IRIS}
}