Hardcaml MSM: A High-Performance Split CPU-FPGA Multi-Scalar Multiplication Engine
Open Access
- 2 April 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 33-39
Abstract
This paper presents a split CPU-FPGA Multi-Scalar Multiplication (MSM) engine written in Hardcaml. Hardcaml MSM was submitted to the 2022 ZPrize cryptography competition and won 1st place in the FPGA track. Hardcaml MSM targets the BLS12-377 elliptic curve and is currently the lowest-latency implementation utilizing FPGAs published. For a MSM of order 2^26 we achieve a single-round MSM latency of 5.518s and average power of 52W, with our design running at 278MHz. When performing multiple rounds of MSM with the same base points but random scalars, we are able to further mask host I/O and memory latency and reduce latency to 5.083s. This is a latency improvement of 13% over the previously fastest reported FPGA solution, and an improvement of 472% when compared to state of the art open-source CPU library gnark-crypto.Keywords
This publication has 14 references indexed in Scilit:
- Fast Computation of Multi-Scalar Multiplication for Pairing-Based zkSNARK Applications2023
- GZKP: A GPU Accelerated Zero-Knowledge Proof System2023
- PipeZK: Accelerating Zero-Knowledge Proof with a Pipelined Architecture2021
- Blockchain Based Anonymous Voting System Using zkSNARKs2019
- Cinderella: Turning Shabby X.509 Certificates into Elegant Anonymous Credentials with the Magic of Verifiable Computation2016
- On the Size of Pairing-Based Non-interactive Arguments2016
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again2012
- Non-interactive zero-knowledge and its applications1988
- Speeding the Pollard and elliptic curve methods of factorizationMathematics of Computation, 1987
- On the Evaluation of Powers and MonomialsSIAM Journal on Computing, 1980