Randomized windows for secure scalar multiplication on elliptic curves | IEEE Conference Publication | IEEE Xplore

Randomized windows for secure scalar multiplication on elliptic curves


Abstract:

Elliptic curve cryptosystems (ECCs) may be chosen instead of RSA in secure embedded systems, thanks to shorter keys. However, ECC may be vulnerable, as any other cryptogr...Show More

Abstract:

Elliptic curve cryptosystems (ECCs) may be chosen instead of RSA in secure embedded systems, thanks to shorter keys. However, ECC may be vulnerable, as any other cryptographic implementation, to side channel analysis, which may reveal secret information by analyzing collateral sources of information, such as power consumption. To protect the device against Timing, Simple and Differential Power Analysis, we propose the implementation of a new scalar multiplication algorithm based on randomized windows method.
Date of Conference: 18-20 June 2014
Date Added to IEEE Xplore: 31 July 2014
Electronic ISBN:978-1-4799-3609-0

ISSN Information:

Conference Location: Zurich, Switzerland

Contact IEEE to Subscribe

References

References is not available for this document.