Taking Roots over High Extensions of Finite Fields

by Javad Doliskani , Éric Schost
Citations:2 - 1 self

Documents Related by Co-Citation

571 Short signatures from the Weil pairing – Dan Boneh, Ben Lynn, Hovav Shacham - 2001
541 Uses of elliptic curves in cryptography – V Miller - 1986
299 Efficient algorithms for pairing-based cryptosystems – Paulo S. L. M. Barreto, Hae Y. Kim, Ben Lynn, Michael Scott - 2002
171 Elliptic curves over finite fields and the computation of square roots mod p – R Schoof - 1985
159 Pairing-friendly elliptic curves of prime order – Paulo S. L. M. Barreto, Michael Naehrig - 2006
79 Pairing-based Cryptography at High Security Levels – Neal Koblitz, Alfred Menezes - 2005
52 Constructing Elliptic Curves with Prescribed Embedding Degrees – Paulo S.L.M. Barreto, Ben Lynn, Michael Scott - 2002
21 Implementing cryptographic pairings over Barreto-Naehrig curves – Augusto Jun Devegili, Michael Scott, Ricardo Dahab
21 Software implementation of pairings – D Hankerson, A Menezes, M Scott - 2008
19 High-speed software implementation of the optimal ate pairing over Barreto–Naehrig curves – Jean-luc Beuchat, Jorge E. González-díaz, Shigeo Mitsunari, Eiji Okamoto, Francisco Rodríguez-henríquez, Tadanori Teruya - 2010