Explore >> Select a destination
|
You are here 
|
www.jeremykun.com | ||
| | | | |
www.daniellowengrub.com
|
|
| | | | | [AI summary] The text discusses the implementation of homomorphic operations in the context of RLWE (Ring Learning With Errors) and GSW (Gentry-Sahai-Waters) encryption schemes. Key concepts include the use of encryptions of zero to facilitate homomorphic multiplication, the structure of GSW ciphertexts as matrices of RLWE ciphertexts, and the role of scaling factors to manage error growth during multiplication. The main goal is to enable secure computation of polynomial products without revealing the underlying plaintexts. | |
| | | | |
jeremykun.com
|
|
| | | | | In this article I'll derive a trick used in FHE called sample extraction. In brief, it allows one to partially convert a ciphertext in the Ring Learning With Errors (RLWE) scheme to the Learning With Errors (LWE) scheme. Here are some other articles I've written about other FHE building blocks, though they are not prerequisites... | |
| | | | |
blog.openmined.org
|
|
| | | | | From the math and the hard problem behind most of today's homomorphic encryption scheme to implementing your own in python. | |
| | | | |
andrea.corbellini.name
|
|
| | | [AI summary] The text discusses the fundamentals of Elliptic Curve Cryptography (ECC), focusing on Elliptic Curve Diffie-Hellman (ECDH) and Elliptic Curve Digital Signature Algorithm (ECDSA). It explains how ECDH enables secure key exchange and how ECDSA allows for digital signatures. The text also covers the importance of secure random number generation in ECDSA, highlighting the risks of using a predictable or static secret key, as seen in the PlayStation 3 incident. The discussion includes code examples for ECDH and ECDSA operations and the consequences of poor implementation practices. The text concludes by mentioning future articles on solving discrete logarithms and ECC compared to RSA. | ||
