Abstract
The elliptic curve cryptosystem is very attractive for the use in portable devices due to small key size. the finite field multiplication over GF(2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> ) is the most important arithmetic for performing the elliptic curve cryptosystem. Design of low cost finite field multiplier for elliptic curve cryptosystem is needed. the proposed self-checking alternating logic (SCAL) GNB multiplier using multiplexer approach is with both concurrent error detection and off-line testing capabilities. the concurrent error detection capability can give countermeasure to fault-based cryptanalysis. the proposed SCAL GNB multiplier using multiplexer approach can save about 18% space complexity as compared to existing similar study.
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.
