Efficient Algorithms for Large Prime Characteristic Fields and Their Application to Bilinear Pairings and Supersingular Isogeny-Based Protocols

Patrick Longa. Efficient Algorithms for Large Prime Characteristic Fields and Their Application to Bilinear Pairings and Supersingular Isogeny-Based Protocols. IACR Cryptology ePrint Archive, 2022:367, 2022. [doi]

@article{Longa22,
  title = {Efficient Algorithms for Large Prime Characteristic Fields and Their Application to Bilinear Pairings and Supersingular Isogeny-Based Protocols},
  author = {Patrick Longa},
  year = {2022},
  url = {https://eprint.iacr.org/2022/367},
  researchr = {https://researchr.org/publication/Longa22},
  cites = {0},
  citedby = {0},
  journal = {IACR Cryptology ePrint Archive},
  volume = {2022},
  pages = {367},
}