POST-QUANTUM KEY-EXCHANGE USING SUPERSINGULAR ISOGENY

• Main Author: ISHLAHUL HANIF (NIM: 10114042), MUHAMMAD
• Format: Final Project
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/29271
• Institution: Institut Teknologi Bandung

<p align="justify">Cryptography is the practice and study of techniques to secure an information from unwanted third parties. Most of the modern cryptography that is applied today is heavily based on mathematical theory, which is the integer factorization problem, the discrete logarithm problem or the elliptic-curve discrete logarithm problem. One of the favorite cryptography is Elliptic Curve Cryptography (ECC) because its cheapness on storing data. But since shor’s algorithm that runs on quantum computer could break these mathematics problem, in 2015 NSA announces plans to change their suite-B to quantum-resistant algorithms. One of the well-known post-quantum cryptography primitives is Supersingular Isogeny that proposed by Jao and De Feo in 2011 (SIDH). <br /> <br /> <br /> <br /> In this research we will explain how to generate the public parameters for SIDH and an ef&#64257;cient algorithm to compute isogeny without weight data. We will also try to prove why two curve generated from SIDH algorithm is isomorph. <br /> <br /> <br /> <br /> We will provide various algorithms to perform operations on the elements of the &#64257;eld Fp^2 with p &#8801; 3 mod 4, operations on elliptic curve group and algorithm for SIDH scheme in python. <p align="justify"> <br />