Abstract
Considering potential attacks from cloud-computing and quantum-computing, it is becoming necessary to provide higher security elliptic curves. The hidden Markov models are introduced for designing the trace-vector computation algorithm to accelerate the search for elliptic curve (EC) base-points. We present a new algorithm for secure Koblitz EC generation based on evolutionary cryptography theory. The algorithm is tested by selecting a secure Koblitz EC over the field F(22000), with experiments showing that both the base field and base point of the secure curve generated exceed the parameter range for Koblitz curves recommended by NIST. The base fields generated go beyond 1900 bits, which is higher than the 571 bits recommended by NIST. We also find new secure curves in the range F(2163)—F(2571) recommended by NIST. We perform a detailed security analysis of those secure curves, showing that those we propose satisfy the same security criteria as NIST.
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.
