HashPIM: High-Throughput SHA-3 via Memristive Digital Processing-in-Memory
Batel Oved, Orian Leitersdorf, Ronny Ronen, and Shahar Kvatinsky

TL;DR
This paper introduces HashPIM, a memristive processing-in-memory architecture that significantly accelerates SHA-3 hashing, achieving high energy efficiency and outperforming previous accelerators by 4.6 times.
Contribution
It presents a novel in-memory algorithm and mapping strategy for SHA-3 on memristive PIM, enabling high parallelism and energy efficiency.
Findings
Achieves 1,422 Gbps/W energy efficiency.
Outperforms previous SHA-3 accelerators by 4.6x.
Demonstrates effective in-memory computation for cryptography.
Abstract
Recent research has sought to accelerate cryptographic hash functions as they are at the core of modern cryptography. Traditional designs, however, suffer from the von Neumann bottleneck that originates from the separation of processing and memory units. An emerging solution to overcome this bottleneck is processing-in-memory (PIM): performing logic within the same devices responsible for memory to eliminate data-transfer and simultaneously provide massive computational parallelism. In this paper, we seek to vastly accelerate the state-of-the-art SHA-3 cryptographic function using the memristive memory processing unit (mMPU), a general-purpose memristive PIM architecture. To that end, we propose a novel in-memory algorithm for variable rotation, and utilize an efficient mapping of the SHA-3 state vector for memristive crossbar arrays to efficiently exploit PIM parallelism. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Memory and Neural Computing · Physical Unclonable Functions (PUFs) and Hardware Security · DNA and Biological Computing
