Timeline for Homomorphic Encryption and the Approximate GCD Problem Confusion
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 20, 2017 at 14:08 | vote | accept | lioness99a | ||
| Apr 13, 2017 at 12:48 | history | edited | CommunityBot |
replaced http://crypto.stackexchange.com/ with https://crypto.stackexchange.com/
|
|
| Mar 24, 2017 at 8:44 | comment | added | lioness99a | @K.G. That's the conclusion I'm rapidly coming to! But yes, it is definitely helping my understanding while I don't have any knowledge of lattices | |
| Mar 23, 2017 at 19:43 | comment | added | K.G. | @lioness99a One of my students looked at an implementation, and the scheme is ridiculously inefficient. But you can explain it to almost anyone in 5 minutes, which is great. I use it to introduce people to a lot of concepts related to FHE. | |
| Mar 23, 2017 at 19:39 | comment | added | K.G. | @fgrieu Offset is good. | |
| Mar 23, 2017 at 9:03 | comment | added | lioness99a | Thanks for the edit, somehow I'd missed that definition in the notation section... Makes a whole lot more sense now! (and for reference, I'm currently playing around with writing a proof-of-concept in Python) | |
| Mar 23, 2017 at 8:55 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Addition per comment
|
| Mar 23, 2017 at 8:49 | comment | added | fgrieu♦ | @K.G.: +1 for nearest multiple of $p$. But distance is non-negative, when the result of that $\bmod$ can be negative. | |
| Mar 23, 2017 at 8:30 | comment | added | K.G. | The "mod p" part in this case should not be thought of as a standard modulo (remainder when divided by p), but rather as the distance to the nearest multiple of p. | |
| Mar 22, 2017 at 18:23 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Polish
|
| Mar 22, 2017 at 18:17 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
The reference gives a defintion of its notation
|
| Mar 22, 2017 at 15:46 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Simplify
|
| Mar 22, 2017 at 15:40 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Simplify
|
| Mar 22, 2017 at 14:29 | comment | added | lioness99a | Thank you, I'll give it a try. It just seems counterproductive that a concept which will inevitably need to be programmed uses a definition of $\mod{}$ which is non-standard in all major languages | |
| Mar 22, 2017 at 14:26 | history | answered | fgrieu♦ | CC BY-SA 3.0 |