US 12,470,364 B2
Circuits and systems for programmable in-memory encryption/decryption fabric including RA/CAM arrays for parallel processing of operations
Xiaobo Sharon Hu, South Bend, IN (US); Dayane Alfenas Reis, South Bend, IN (US); Michael Niemier, South Bend, IN (US); and Haoran Geng, South Bend, IN (US)
Assigned to University of Notre Dame du Lac, South Bend, IN (US)
Filed by University of Notre Dame du Lac, South Bend, IN (US)
Filed on May 15, 2023, as Appl. No. 18/317,130.
Claims priority of provisional application 63/365,020, filed on May 19, 2022.
Prior Publication US 2023/0379140 A1, Nov. 23, 2023
Int. Cl. H04L 9/00 (2022.01); H04L 9/06 (2006.01)
CPC H04L 9/0631 (2013.01) 17 Claims
OG exemplary drawing
 
1. A secure system configured to perform cryptographic operations on digital data, the secure system comprising:
a plurality of look-up-table fabric modules, each look-up-table fabric module comprising a plurality of memory elements including at least one memory device operable in a random access mode and a content addressable mode, each look-up-table fabric module operatively coupled to a respective portion of an input data structure; and
a processor circuit operatively coupled to the plurality of look-up-table fabric modules, the processor circuit configured to:
receive the input data structure, wherein the input data structure comprises a plurality of data segments for distributed processing by the plurality of look-up-table fabric modules;
provide the plurality of data segments to the plurality of look-up-table fabric modules for local cryptographic encryption operations, wherein the at least one memory devices of each look-up-table fabric module operates in the random access mode to retrieve precomputed values for cryptographic transformations, and
provide encrypted versions of the plurality of data segments to the plurality of look-up-table fabric modules for local cryptographic decryption using the memory devices operating in the content addressable mode to perform inverse transformation matching.