
GPU-Assisted FAEST v3 Signing: Challenge Grinding and CPU–GPU Pipelining
An IACR ePrint paper presenting a GPU-assisted implementation of FAEST v3 signing, a post-quantum signature scheme, focusing on two problems: preserving the correct minimum accepting counter when parallelizing "challenge grinding" across GPU threads, and building a two-slot CPU-GPU pipeline to overlap CPU work with GPU batches for multi-signature throughput. Across the six non-EM FAEST v3 parameter sets, the authors find the CPU-GPU path beats optimized CPU-only signing for single-sign latency in 4 of 6 cases (up to 1.6x speedup for FAEST-192s) and wins throughput in 9 of 18 parameter/batch-size combinations, with GPU correctness validated to match the reference signature output.
Organisations named here
- FAEST-192s
Technologies named here
- FAEST v3
- FAEST
- CUDA
- GPU
Techniques named here
- Challenge grinding
- CPU–GPU hybrid pipelining
Related in other

Rerandomizable Garbling for Arithmetic Circuits

