A Study of Hyperelliptic Curves in Cryptography | Zendy

Reza Alimoradi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Study of Hyperelliptic Curves in Cryptography

Author(s) -

Reza Alimoradi

Publication year - 2016

Publication title -

international journal of computer network and information security

Language(s) - English

Resource type - Journals

eISSN - 2074-9104

pISSN - 2074-9090

DOI - 10.5815/ijcnis.2016.08.08

Subject(s) - hyperelliptic curve cryptography , elliptic curve cryptography , computer science , cryptography , elliptic curve , key size , curve25519 , encryption , counting points on elliptic curves , key (lock) , hyperelliptic curve , computation , integer (computer science) , theoretical computer science , arithmetic , algorithm , public key cryptography , mathematics , computer security , algebra over a field , pure mathematics , operating system

Elliptic curves are some specific type of curves known as hyper elliptic curves. Compared to the integer factorization problem(IFP) based systems, using elliptic curve based cryptography will significantly decrease key size of the encryption. Therefore, application of this type of cryptography in systems that need high security and smaller key size has found great attention. Hyperelliptic curves help to make key length shorter. Many investigations are done with regard to improving computations, hardware and software implementation of these curves, their security and resistance against attacks. This paper studies and analyzes researches done about security and efficiency of hyperelliptic curves.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research