As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Elliptic curve cryptography is an important public-key cryptography following RSA. Here a new RNS (residue number system) approach for fast elliptic curve point multiplication over prime fields is proposed. The approach applies the Montgomery ladder for parallel elliptic curve point doublings (EC-doub) and point additions (EC-add). Meanwhile, residue number system with a wide dynamic range is used to support continuous multiplications, after which only one RNS Montgomery algorithm is enough to bring down the temporary results to valid range. In other words, both tasks can be implemented as many multiplications and a last reduction to improve performance. Also, Barrett modular reductions over small multipliers or modular multiplications over generalized Mersenne numbers can be applied for modular reductions over RNS moduli. A first analysis shows that the computation time for elliptic curve point multiplication over Fp can be reduced to a great extent at the cost of extra multipliers.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.