Explore >> Select a destination
|
You are here 
|
rot256.dev | ||
| | | | |
andrea.corbellini.name
|
|
| | | | | [AI summary] The text provides an in-depth explanation of elliptic curve cryptography (ECC), covering fundamental concepts such as elliptic curves over finite fields, point addition, cyclic subgroups, subgroup orders, and the discrete logarithm problem. It also discusses practical aspects like finding base points, cofactors, and the importance of choosing subgroups with high order for cryptographic security. The text emphasizes that ECC relies on the difficulty of solving the discrete logarithm problem on elliptic curves, which is considered computationally hard and forms the basis for secure cryptographic protocols like ECDH and ECDSA. | |
| | | | |
www.jeremykun.com
|
|
| | | | | In this article I'll cover three techniques to compute special types of polynomial products that show up in lattice cryptography and fully homomorphic encryption. Namely, the negacyclic polynomial product, which is the product of two polynomials in the quotient ring $\mathbb{Z}[x] / (x^N + 1)$. As a precursor to the negacyclic product, we'll cover the simpler cyclic product. All of the Python code written for this article is on GitHub. | |
| | | | |
vitalik.eth.limo
|
|
| | | | | [AI summary] The user is interested in understanding polynomial commitments and their applications in privacy-preserving computations, particularly in blockchain. They have provided a detailed overview of FRI, Kate, and bulletproofs, along with finite field arithmetic and encoding computations into polynomial equations. The user is looking for a concise summary of the key points, further clarification on the concepts, and guidance on how to proceed with learning more about the topic. | |
| | | | |
francisbach.com
|
|
| | | [AI summary] This article explores the properties of matrix relative entropy and its convexity, linking it to machine learning and information theory. It discusses the use of positive definite matrices in various contexts, including concentration inequalities and kernel methods. The article also includes a lemma on matrix cumulant generating functions and its proof, as well as references to relevant literature. | ||
