Efficient Isogeny Computations on Huff Curve

IBC (Isogeny-based cryptography) is the important part of post-quantum cryptography (PQC). Because of compatibility and smaller key sizes, it is extremely used. Isogeny computations and point operations serve as the primary building blocks in the implementation of the IBC. Since the cryptosystem advances along the isogeny graph, it is impossible to optimize the isogeny formula for a particular elliptic curve coefficient. As a result of the effective point operation on any elliptic curve, Montgomery curves are utilised in the literature. Present work pro­­­poses the schemes for computing two, three and four-isogenies on Huff curve, by using the transformation from affine plane to projective plane. The proposed schemes found efficient when compared their computational cost with Edwards and Montgomery curves.