Revisiting cycles of pairing-friendly elliptic curves

ePrint Report: Revisiting cycles of pairing-friendly elliptic curves

Marta Bellés-Muñoz, Jorge Jiménez Urroz, Javier Silva

A recent area of interest in cryptography is recursive composition of proof systems. One of the approaches to make recursive composition efficient involves cycles of pairing-friendly elliptic curves of prime order. However, known constructions have very low embedding degrees. This entails large parameter sizes, which makes the overall system inefficient.


In this paper, we explore $2$-cycles composed of curves from families parameterized by polynomials, and …

elliptic eprint report