Paper 2024/752
More Embedded Curves for SNARK-Pairing-Friendly Curves
Abstract
Embedded curves are elliptic curves defined over a prime field whose order (characteristic) is the prime subgroup order (the scalar field) of a pairing-friendly curve. Embedded curves have a large prime-order subgroup of cryptographic size but are not pairing-friendly themselves. Sanso and El Housni published families of embedded curves for BLS pairing-friendly curves. Their families are parameterized by polynomials, like families of pairing-friendly curves are. However their work did not found embedded families for KSS pairing-friendly curves. In this note we show how the problem of finding families of embedded curves is related to the problem of finding optimal formulas for
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- pairing-friendly curvesSNARKembedded curves
- Contact author(s)
- aurore guillevic @ inria fr
- History
- 2024-08-06: revised
- 2024-05-16: received
- See all versions
- Short URL
- https://ia.cr/2024/752
- License
-
CC BY-NC-SA
BibTeX
@misc{cryptoeprint:2024/752, author = {Aurore Guillevic}, title = {More Embedded Curves for {SNARK}-Pairing-Friendly Curves}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/752}, year = {2024}, url = {https://eprint.iacr.org/2024/752} }