0
votes
Vote
A Math Primer for Gentry’s Fully Homomorphic Encryption
Craig Stuntz's Weblog
– A couple of weeks ago, I wrote What Is Homomorphic Encryption, and Why Should I Care? In that post, I promised to share my C# implementation of the algorithm from Craig Gentry’s CACM article. Before I can do that, though, I need to explain some of the math involved. Perhaps surprisingly, it’s actually very simple. (I say "surprisingly" because much of the math and technical papers on encryption is decidedly not simple, including that of Gentry’s first fully homomorphic scheme, which was based on ideal lattices.) This scheme created by Marten van Dijk, Craig Gentry, Shai ...
Statistics
|
Visits by Source |
User Actions |
