Abstract
AbstractDue to its shorter key size, elliptic curve cryptography (ECC) is gaining more and more popularity. However, if not properly implemented, the resulting cryptosystems may be susceptible to fault attacks. Over the past few years, several techniques for secure implementations have been published. This paper revisits the ring extension method and its adaptation to the elliptic curve setting.
Highlights
This paper deals with secure implementations [24] for elliptic curve cryptography (ECC)-based cryptosystems [10, 11, 20, 45, 49, 50] and, with the development of efficient detection methods against fault attacks [14]
If not properly implemented, the resulting cryptosystems may be susceptible to fault attacks
This paper deals with secure implementations [24] for ECC-based cryptosystems [10, 11, 20, 45, 49, 50] and, with the development of efficient detection methods against fault attacks [14]
Summary
This paper deals with secure implementations [24] for ECC-based cryptosystems [10, 11, 20, 45, 49, 50] and, with the development of efficient detection methods against fault attacks (or errors) [14]. See [39, Part III] for a more recent and complete account
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
