On binary signed digit representations of integers

Designs, Codes, and Cryptography

Volumn 42, Issue 1, 2007, Pages 43-65

  Ebeid, Nevine ^a   Hasan, M Anwar ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Binary signed digit representation; Non adjacent form; Randomization algorithms

Indexed keywords

ALGORITHMS; DIGITAL SIGNAL PROCESSING; INTEGER PROGRAMMING; PUBLIC KEY CRYPTOGRAPHY;

BINARY SIGNED DIGIT (BSD); COMPUTER ARITHMETIC; NON ADJACENT FORM; RANDOMIZATION ALGORITHMS;

BINARY CODES;

EID: 33845430064     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-006-9014-9     Document Type: Article

References (12)

1. Cohen H, Miyaji A, Ono T (1998) Efficient elliptic curve exponentiation using mixed coordinates. In: Advances in Cryptology-ASIACRYPT '98. vol 1514. LNCS, Springer-Verlag, Berlin, pp 51-65
2. Ebeid N, Hasan MA (2003) Analysis of DPA countermeasures based on randomizing the binary algorithm. CACR Technical Reports CORR 2003-14, University of Waterloo
3. Ebeid N, Hasan MA (2003) On randomizing private keys to counteract DPA attacks. In: Selected Areas in Cryptography-SAC '03. vol 3006. LNCS, Springer-Verlag, Berlin, pp 58-72
4. Fouque PA, Muller F, Poupard G, Valette F (2004) Defeating countermeasures based on randomized BSD representations. In: Cryptographic Hardware and Embedded Systems-CHES '04. vol 3156 LNCS, Springer-Verlag, Berlin, pp 312-327
5. Ha J, Moon S (2002) Randomized signed-scalar multiplication of ECC to resist power attacks. In: Cryptographic Hardware and Embedded Systems-CHES '02. vol 2523 LNCS, Springer-Verlag, Berlin, pp 551-563
6. Kalbfleisch JG (1985) Probability and statistical inference volume 1: probability. Springer-Verlag, Berlin
7. n ) without precomputation. In: Selected Areas in Cryptography-SAC '98. vol 1556 LNCS, Springer-Verlag, Berlin, pp 201-212
8. Morain F, Olivos J (1990) Speeding up the computations on an elliptic curve using addition-subtraction chains. Informatique théorique et Applications/Theoret Informatics Appl 24(6):531-544
9. Oswald E, Aigner M (2001) Randomized addition-subtraction chains as a countermeasure against power attacks. In: Cryptographic Hardware and Embedded Systems-CHES '01. vol 2162 LNCS, Springer-Verlag, Berlin, pp 39-50
10. Reitwiesner GW (1960) Binary arithmetic. Adv Comput 1:231-308
11. Sim SG, Park DJ, Lee PJ (2004) New power analysis on the Ha-Moon algorithm and the MIST algorithm. In: Information and communications security-ICICS '04. vol 3269 LNCS, Springer-Verlag, Berlin, pp 291-304
12. Solinas JA (2000) Efficient arithmetic on Koblitz curves. Designs, Codes Cryptogr 19:195-249