Paper 2025/252

Chiplet-Based Techniques for Scalable and Memory-Aware Multi-Scalar Multiplication

Florian Hirner, Graz University of Technology
Florian Krieger, Graz University of Technology
Sujoy Sinha Roy, Graz University of Technology
Abstract

This paper presents a high-performance architecture for accelerating Multi-Scalar Multiplication (MSM) on ASIC platforms, targeting cryptographic applications with high throughput and scalability demands. Current MSM accelerators on FPGA and ASIC platforms typically focus on designing efficient processing elements (PEs) to perform resource-intensive elliptic curve point operations, which require a high number of 384-bit modular multipliers. Our approach diverges from existing works by adopting a chiplet-based design, which optimally balances area, power consumption, and computational throughput. By analyzing memory requirements across window sizes, we determine an optimal mixed configuration of 12- and 13-bit windows, which allows efficient integration of multiple PEs per chiplet. Considering the single-PE case, our design achieves a 1.37x speedup and a 1.3x area reduction over prior works. Moreover, our multi-PE chiplet design outperforms monolithic designs by 2.2x in area-time product while allowing lower production costs and higher yield.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Published elsewhere. IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Keywords
MultiplicationZero-knowledge proofsHardware AccelerationScalable Chiplet ArchitectureParallel Computing
Contact author(s)
florian hirner @ tugraz at
florian krieger @ tugraz at
sujoy sinharoy @ tugraz at
History
2026-07-01: revised
2025-02-17: received
See all versions
Short URL
https://ia.cr/2025/252
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2025/252,
      author = {Florian Hirner and Florian Krieger and Sujoy Sinha Roy},
      title = {Chiplet-Based Techniques for Scalable and Memory-Aware Multi-Scalar Multiplication},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/252},
      year = {2025},
      url = {https://eprint.iacr.org/2025/252}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.