Bandersnatch: a fast elliptic curve built over the BLS12-381 scalar field

6Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we introduce Bandersnatch, a new elliptic curve built over the BLS12-381 scalar field. The curve is equipped with an efficient endomorphism, allowing a fast scalar multiplication algorithm. Our benchmark shows that the multiplication is 42% faster, 21% reduction in terms of circuit size in the form of rank 1 constraint systems (R1CS), and 10% reduction in terms of Plonk circuit, compared to another curve, called Jubjub, having similar properties. Many zero-knowledge proof systems that rely on the Jubjub curve can benefit from our result.

Author supplied keywords

Cite

CITATION STYLE

APA

Masson, S., Sanso, A., & Zhang, Z. (2024). Bandersnatch: a fast elliptic curve built over the BLS12-381 scalar field. Designs, Codes, and Cryptography, 92(12), 4131–4143. https://doi.org/10.1007/s10623-024-01472-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free