Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Let denote the maximum number of points of an elliptic curve over . Given a prime power and an integern satisfying , we present an algorithm which on inputq andn produces an optimal bilinear algorithm of length for multiplication in . The algorithm takes roughly -operations or equivalently bit- operations to compute the output data.
Alcherio Martinoli, Cyrill Silvan Baumann, Jonas Perolini, Emna Tourki