ISOGENIES.PDFVIP

PUBLIC-KEY CRYPTOSYSTEM BASED ON ISOGENIES Alexander Rostovtsev and Anton Stolbunov Saint-Petersburg State Polytechnical University, Department of Security and Information Protection in Computer Systems, Russia rostovtsev@ssl.stu.neva.ru stolbunov@list.ru Abstract. A new general mathematical problem, suitable for public- key cryptosystems, is proposed: morphism computation in a category of Abelian groups. In connection with elliptic curves over finite fields, the problem becomes the following: compute an isogeny (an algebraic homomorphism) between the elliptic curves given. The problem seems to be hard for solving with a quantum computer. ElGamal public-key encryption and Diffie-Hellman key agreement are proposed for an isogeny cryptosystem. The paper describes theoretical background and a public- key encryption technique, followed by security analysis and consideration of cryptosystem parameters selection. A demonstrative example of encryption is included as well. public-key cryptography, elliptic curve cryptosystem, cryptosystem on isogenies of elliptic curves, isogeny star, isogeny cycle, quantum computer 1 Introduction Security of the known public-key cryptosystems is based on two general mathematical problems: determination of order and structure of a finite Abelian group, and discrete logarithm computation in a cyclic group with computable order. Both of the problems can be solved in polynomial time using Shor’s algorithm for a quantum computer [1]. Thus, most of the current public-key cryptosystems will become insecure when size of a quantum register is sufficient. Development of cryptosystems, which would be strong against a quantum computer, is necessary. A mathematical problem, which is hypothetically strong against a quantum computer, is proposed. It consists in searching for an isogeny (an algebraic homomorphism) between elliptic curves over a finite field. The problem is a special case of morphism computation in an Abelian groups category. A method of p