JOURNAL BROWSE
Search
Advanced SearchSearch Tips
An Algorithm for Switching from Arithmetic to Boolean Masking with Low Memory
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
An Algorithm for Switching from Arithmetic to Boolean Masking with Low Memory
Kim, HanBit; Kim, HeeSeok; Kim, TaeWon; Hong, SeokHie;
  PDF(new window)
 Abstract
Power analysis attacks are techniques to analyze power signals to find out the secrets when cryptographic algorithm is performed. One of the most famous countermeasure against power analysis attacks is masking methods. Masking types are largely classified into two types which are boolean masking and arithmetic masking. For the cryptographic algorithm to be used with boolean and arithmetic masking at the same time, the converting algorithm can switch between boolean and arithmetic masking. In this paper we propose an algorithm for switching from boolean to arithmetic masking using storage size at less cost than ones. The proposed algorithm is configured to convert using the look-up table without the least significant bit(LSB), because of equal the bit of boolean and arithmetic masking. This makes it possible to design a converting algorithm compared to the previous algorithm at a lower cost without sacrificing performance. In addition, by applying the technique at the LEA it showed up to 26 percent performance improvement over existing techniques.
 Keywords
Side-channel;Arithmetic to Boolean masking;Masking;Countermeasure;
 Language
Korean
 Cited by
 References
1.
P. Kocher, J. Jaffe, and B. Jun, "Differential power analysis," CRYPTO'9, pp.388-397, Springer-Verlag, Dec. 1999.

2.
Kocher, Paul C. "Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems," Advances in Cryptology-CRYPTO'96. Springer Berlin Heidelberg, July. 1996.

3.
Ors, Siddika Berna, et al. "Power-Analysis Attack on an ASIC AES implementation," Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. International Conference on. Vol. 2. IEEE, April. 2004.

4.
Agrawal, Dakshi, et al. "The EM side- channel (s)," Cryptographic Hardware and Embedded Systems-CHES 2002. Springer Berlin Heidelberg, 29-45. Feb. 2003.

5.
Gandolfi, Karine, Christophe Mourtel, and Francis Olivier. "Electromagnetic analysis: Concrete results," Cryptographic Hardware and Embedded Systems-CHES 2001. Springer Berlin Heidelberg, Sep. 2001.

6.
ISO/IEC 15408-1/2/3, "Common Criteria for Information Technology Security Evaluation," Ver. 3.1, Revision 4, Sep. 2012.

7.
"FIPS-140 -3: DRAFT Security Requirements for Cryptographic Modules (Revised Draft)," NIST. 2013-03-07. Retrieved May. 2013.

8.
"Integrated Circuit Card Specifications for Payment Systems," EMVCo. Retrieved 26 March. 2012.

9.
E. Oswald and K. Schramm. "An Efficient Masking Scheme for AES Software Implementations," WISA 2005, LNCS 3786, pp. 292-305, Springer, Aug. 2006.

10.
J. Blomer, J. Guajardo, and V. Krummel. "Provably Secure Masking of AES," SAC2004, LNCS 3357, pp. 69-83, Springer, Aug. 2005.

11.
Thomas S. Messerges, "Power Analysis Attacks and Countermeasures for Cryptographic Algorithms," Ph.D Thesis, pp.541-548, Feb. 2000.

12.
Jean-Sébastien Coron, Louis Goubin, "On Boolean and Arithmetic Masking against Differential Power Analysis," CHES 2000, Lecture Notes in Computer Science Volume 1965, pp 231-237, Dec. 2000.

13.
Louis Goubin, "A Sound Method for Switching between Boolean and Arithmetic Masking," CHES 2001, Lecture Notes in Computer Science Volume 2162, pp 3-15, July. 2001.

14.
Coron, Jean-Sebastien, et al. "Conversion from arithmetic to boolean masking with logarithmic complexity," Fast Software Encryption. Springer Berlin Heidelberg, Aug. 2015.

15.
Coron, Jean-Sebastien, and Alexei Tchulkine. "A new algorithm for switching from arithmetic to boolean masking," Cryptographic Hardware and Embedded Systems-CHES 2003. Springer Berlin Heidelberg, 89-97, Sep. 2003.

16.
Debraize, Blandine. "Efficient and provably secure methods for switching from arithmetic to boolean masking," Cryptographic Hardware and Embedded Systems-CHES2012. Springer Berlin Heidelberg, 107-121, Sep. 2012.

17.
J. Park et al., "128-Bit Block Cipher LEA,"TTAK.KO-12.0223, Dec. 2013