Abstract
The FIPS 186-2 standard recommends five prime fields with a modulus so-called NIST primes for elliptic curve cryptosystems. Primes of the special form such as NIST primes have a property yields modular reduction algorithms that are significantly fast. However the number of NIST primes are not large enough. In this paper, we further extend the idea of NIST primes. Then we find more primes can provide fast modular reduction computation that NIST prime family does not support. Our method provides more efficient modular arithmetic than Montgomery algorithm in prime fields that NIST primes does not support.
Sign-in/Register to access full text options 
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.
