Abstract
Hyperelliptic curves have been used to define discrete logarithm problems as cryptographic one-way functions. However, no efficient algorithm for construction of secure hyperelliptic curves is known until now. In this paper, efficient algorithms are presented to construct secure discrete logarithm problems on hyperelliptic curves whose Jacobian varieties are either simple or isogenous to a product of simple abelian varieties.
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.
