<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
    <channel>
        <title>Cryptography - Tag - HEJTAO</title>
        <link>https://hejtao.netlify.app/tags/cryptography/</link>
        <description>Cryptography - Tag - HEJTAO</description>
        <generator>Hugo -- gohugo.io</generator><language>en-us</language><lastBuildDate>Sat, 23 Nov 2024 00:00:00 &#43;0000</lastBuildDate><atom:link href="https://hejtao.netlify.app/tags/cryptography/" rel="self" type="application/rss+xml" /><item>
    <title>Verkle Trie of Ethereum</title>
    <link>https://hejtao.netlify.app/posts/cs-kzg-commitment/</link>
    <pubDate>Sat, 23 Nov 2024 00:00:00 &#43;0000</pubDate>
    <author>HEJTAO.COM</author>
    <guid>https://hejtao.netlify.app/posts/cs-kzg-commitment/</guid>
    <description><![CDATA[Polynomial Coefficient representation $$f(x) = x^3 - 2x + 1$$
Point-values representation (0,1), (1,0), (2,5), (3,22) Point-values to coefficients How many points do we need?
if $d$ is the degree of the polynomial, then $d+1$ points are needed. How to find the coefficients? (method 1) solve the linear equation in $d+1$ variables (method 2) use Lagrange interpolation Reed-Solomon code: Let $d+1$ points be the stored data, and add other $n$ points as the parity data.]]></description>
</item>
<item>
    <title>Elliptic Curve Cryptography</title>
    <link>https://hejtao.netlify.app/posts/cs-ecc/</link>
    <pubDate>Mon, 28 Oct 2024 00:00:00 &#43;0000</pubDate>
    <author>HEJTAO.COM</author>
    <guid>https://hejtao.netlify.app/posts/cs-ecc/</guid>
    <description><![CDATA[Elliptic Curve $$y^2 = x^3 + ax + b$$
Point Addition The point has to be reflected on the x-axis to keep the associactivity of addition
Point Doubling Naturally consider the tangent line
Elliptic curve cryptography To guess the private key $n$ is super super hard
The problem of elliptic curve over real numbers The consecutive points of curve $y^2 = x^3 + x + 1$ with the beginning point $(0,1)$ are as follows.]]></description>
</item>
</channel>
</rss>
