Paper 2025/1319 Original: eprint.iacr.org/2025/1319 ↗

Bridging Usability and Performance: A Tensor Compiler for Autovectorizing Homomorphic Encryption

Edward Chen
Fraser Brown
Wenting Zheng
Abstract

Homomorphic encryption (HE) offers strong privacy guarantees by enabling computation over encrypted data. However, the performance of tensor operations in HE is highly sensitive to how the plaintext data is packed into ciphertexts. Large tensor programs introduce numerous possible layout assignments, making it both challenging and tedious for users to manually write efficient HE programs. In this paper, we present Rotom, a compilation framework that autovectorizes tensor programs into optimized HE programs. Rotom systematically explores a wide range of layout assignments, applies state-of-the-art optimizations, and automatically generates an equivalent, efficient HE program. At its core, Rotom utilizes a novel, lightweight ApplyRoll layout conversion operator to easily modify the underlying data layouts and unlock new avenues for performance gains. Our evaluation demonstrates Rotom scalably compiles all tensor workloads in under 5 minutes, reduces rotations in hand-tuned protocols by up to 3×, and achieves up to 80× performance improvement over prior autovectorization systems.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint.
History
2026-03-18: last updated
2025-07-18: published
Short URL
https://ia.cr/2025/1319
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2025/1319,
      author = {Edward Chen and Fraser Brown and Wenting Zheng},
      title = {Bridging Usability and Performance: A Tensor Compiler for Autovectorizing Homomorphic Encryption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1319},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1319}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.