Jump to content

Intel corporation (20250007687). FULLY HOMOMORPHIC ENCRYPTION

From WikiPatents
Revision as of 02:43, 25 March 2025 by Unknown user (talk) (Creating a new page)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

FULLY HOMOMORPHIC ENCRYPTION

Organization Name

intel corporation

Inventor(s)

Sanu Mathew of Portland OR US

Vikram Suresh of Portland OR US

Sachin Taneja of Hillsboro OR US

Raghavan Kumar of Hillsboro OR US

Christopher Wilkerson of Portland OR US

FULLY HOMOMORPHIC ENCRYPTION

This abstract first appeared for US patent application 20250007687 titled 'FULLY HOMOMORPHIC ENCRYPTION

Original Abstract Submitted

techniques for fully homomorphic encryption are described. in some examples, a register file to store polynomials is coupled to a butterfly compute path. the butterfly compute path includes a multiplier coupled to a first input and a second input to multiply the first and second input to, when enabled, generate a multiplication output, a first multiplexer coupled to an output of the multiplier and to the first input to output a selection between the output of the multiplier and the first input, an adder to add, when enabled, a third input to the selected output of the first multiplexer, a subtractor to subtract, when enabled, an output of the multiplier from the third input, and a second multiplexer coupled to an output of the multiplier and to the first input to, when enabled, output a selection between the output of the multiplier and the subtractor.

Cookies help us deliver our services. By using our services, you agree to our use of cookies.