Efficient four-dimensional GLV curve with high security [article]

Olivier Bernard, Renaud Dubois, Simon Masson
2018 IACR Cryptology ePrint Archive  
We apply Smith's construction [9] to generate four-dimensional GLV curves with fast arithmetic in the group law as well as in the base eld. As Costello and Longa did in [5] for a 128-bit security level, we obtained an interesting curve for fast GLV scalar multiplication, providing a high level of security (254 bits). Our curve is dened over a well-known nite eld: F p 2 where p = 2 255 − 19. We nally explicit the two endomorphisms used during GLV decomposition.
dblp:journals/iacr/BernardDM18 fatcat:kycgpb5vbnenhpgdlzx65v53ii