A Compute-in-Memory Ascon Implementation Based on a Novel 11T SRAM Processing Macro

Over the past decade, a new paradigm of computing called Compute-In-Memory (CIM) has emerged wherein traditional memory circuits, such as static random access memories (SRAMs), can be modified to perform computations on data insitu, leading to enhanced energy efficiency and performance for many applications. At the same time, the increasing importance and ubiquity of resource-constrained edge devices has led to the need for lightweight cryptography (LWC) algorithms for security applications. The potential of CIM architectures has not previously been explored in LWC hardware implementations. In this work, we present a novel 11 transistor SRAM cell and digital CIM processing macro which implements all Boolean operations (INV/NAND/NOR/XOR) completely in-memory within a single cycle. We use our design to develop a CIM implementation of the Ascon-AEAD128 (encryption) and Ascon-Hash256 (hashing) algorithms and validate our results in 65 nm CMOS technology. Our design occupies only 3.1 kGEs, consumes <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$694 \mu W$</tex> at 250 MHz, and has a maximum frequency of 1.5 GHz. With a maximum throughput of 509 Mbs and energy efficiencies of 369 Gbit/J and 126 Gbit/J for AEAD and Hash modes, our CIM macro is competitive with state-of-the-art ASICs while remaining reprogrammable for general-purpose computation.

Authors

Institutions

Publication Details

Published
2025-04-16
DOI
https://doi.org/10.1109/coolchips65488.2025.11018599
Primary Topic
VLSI and Analog Circuit Testing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Compute-in-Memory Ascon Implementation Based on a Novel 11T SRAM Processing Macro

Saibal Mukhopadhyay, Chris Clark, Mark Lee
VLSI and Analog Circuit Testing
article

A Compute-in-Memory Ascon Implementation Based on a Novel 11T SRAM Processing Macro

Saibal Mukhopadhyay, Chris Clark, Mark Lee
article en

Abstract

Over the past decade, a new paradigm of computing called Compute-In-Memory (CIM) has emerged wherein traditional memory circuits, such as static random access memories (SRAMs), can be modified to perform computations on data insitu, leading to enhanced energy efficiency and performance for many applications. At the same time, the increasing importance and ubiquity of resource-constrained edge devices has led to the need for lightweight cryptography (LWC) algorithms for security applications. The potential of CIM architectures has not previously been explored in LWC hardware implementations. In this work, we present a novel 11 transistor SRAM cell and digital CIM processing macro which implements all Boolean operations (INV/NAND/NOR/XOR) completely in-memory within a single cycle. We use our design to develop a CIM implementation of the Ascon-AEAD128 (encryption) and Ascon-Hash256 (hashing) algorithms and validate our results in 65 nm CMOS technology. Our design occupies only 3.1 kGEs, consumes <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$694 \mu W$</tex> at 250 MHz, and has a maximum frequency of 1.5 GHz. With a maximum throughput of 509 Mbs and energy efficiencies of 369 Gbit/J and 126 Gbit/J for AEAD and Hash modes, our CIM macro is competitive with state-of-the-art ASICs while remaining reprogrammable for general-purpose computation.

Georgia Institute of Technology (US), Georgia Tech Research Institute
Openalex Percentile: Top 88%
VLSI and Analog Circuit Testing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.