Resisting Power Analysis Attack Scheme Based on Signed Factorial Expansions
Shu-Li Zhao · Computer and Digital Engineering · 2014
The scheme of binary representation power analysis attack for elliptic curve cryptogram is always inefficient.Scalar multiplication was turned into multiple scalar multiplication by coding the scalar with signed factorial expansions.And then a scheme based on Signed Factorial Expansions(SFE)was presented by the method of the pre-computation table and basic point masking algorithm.According to the efficiency analysis,the result showed that the scheme could resist multiple power analysis attacks and promote operation efficiency.