IP Library › Patent Application 18674854
Patent Application
App. No. 18/674,854

FULLY HOMOMORPHIC ENCRYPTED PROCESSING ACCELERATION

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
18/674,854
Abstract

A method for conflict-free memory accesses comprises storing data in a memory. The memory can be accessed by row or column, and the data is arranged in a scrambled ordering. Further, the process includes defining a bank as a specified row exclusive or-ed with a specific column. When addressing a row, mapping a bank i to an index i xor the row. On the other hand, when addressing a column, mapping a bank i to an index i xor the row.

Claims (19)

1 . A method for conflict-free memory accesses, the method comprising:

storing data in a single-port memory, wherein:

the memory can be accessed by row or column; and

the data is arranged in a scrambled ordering;

defining a bank as a specified row exclusive or-ed with a specific column;

when addressing a row, mapping a bank i to an index i xor the row; and

when addressing a column, mapping a bank i to an index i xor the row.

2 . The method of claim 1 , further comprising:

using permutation processing elements to reorder the data from the memory.

3 . The method of claim 2 , wherein the memory is accessed via a single-cycle operation per chunk, wherein a chunk is defined as a number of coefficients to be accessed per cycle.

4 . The method of claim 3 , wherein using permutation processing elements to reorder the data from the memory comprises:

when addressing a row, a chunk of data is received from the columns.

5 . The method of claim 3 , wherein using permutation processing elements to reorder the data from the memory comprises:

when addressing a column, a chunk of data is received from the rows.

6 . The method of claim 2 , wherein:

the permutation processing elements includes a network of conditional step nodes, wherein the number of conditional step nodes is related to a size of the permutation processing element.

7 . The method of claim 2 , wherein:

the permutation processing elements includes a network of conditional step nodes, where the conditional swap nodes either swap inputs or keep the inputs the same based on a control value.

8 . The method of claim 1 , wherein an address bit determines whether the memory is to be accessed to address a row or column.

Assignments (2)
CORRECTIVE ASSIGNMENT TO CORRECT THE ASSIGNEE PREVIOUSLY RECORDED ON REEL 71860 FRAME 448. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Jan 5, 2026
From: DIMOU, GEORGIOS; ARCHER, DAVID; HUFFMAN, BRIAN; MCAULEY, TYNAN; VAN BEIRENDONCK, MICHIEL
To: NIOBIUM MICROSYSTEMS, INC.
Reel/Frame 073515/0487 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 29, 2025
From: DIMOU, GEORGIOS; ARCHER, DAVID A., DR.; HUFFMAN, BRIAN; MCAULEY, TYNAN; VAN BEIRENDONCK, MICHIEL
To: NIOBIUM MICROSYSTEMS
Reel/Frame 071860/0448 →