Silicon-Proven ASIC Design for the Polynomial Operations of Fully Homomorphic Encryption

Mohammed Nabeel, Homer Gamil, Deepraj Soni, Mohammed Ashraf, Mizan Abraha Gebremichael, Eduardo Chielle, Ramesh Karri, Mihai Sanduleanu, Michail Maniatakos

    Research output: Contribution to journalArticlepeer-review

    Abstract

    In this work, we elaborate on our endeavors to design, implement, fabricate, and post-silicon validate CoFHEE (Nabeel et al., 2023), a co-processor for low-level polynomial operations targeting fully homomorphic encryption execution. With a compact design area of 12 mm^2 , CoFHEE features ASIC implementations of fundamental polynomial operations, including polynomial addition and subtraction, Hadamard product, and number theoretic transform, which underlie most higher-level FHE primitives. CoFHEE is capable of natively supporting polynomial degrees of up to n = 2^14 with a coefficient size of 128 bits, and has been fabricated and silicon-verified using 55-nm CMOS technology. To evaluate it, we conduct performance and power experiments on our chip, and compare it to state-of-the-art software implementations and other ASIC designs.

    Original languageBritish English
    Pages (from-to)1924-1928
    Number of pages5
    JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
    Volume43
    Issue number6
    DOIs
    StatePublished - 1 Jun 2024

    Keywords

    • ASIC
    • co-processor
    • data privacy
    • encrypted computation
    • fully homomorphic encryption (FHE)

    Fingerprint

    Dive into the research topics of 'Silicon-Proven ASIC Design for the Polynomial Operations of Fully Homomorphic Encryption'. Together they form a unique fingerprint.

    Cite this