<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Sagemath on Decentralized meta-learning</title>
    <link>https://blog.costan.ro/tags/sagemath/</link>
    <description>Recent content in Sagemath on Decentralized meta-learning</description>
    <generator>Hugo</generator>
    <language>en</language>
    <lastBuildDate>Wed, 25 Sep 2019 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://blog.costan.ro/tags/sagemath/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Elliptic curves</title>
      <link>https://blog.costan.ro/post/2019-09-25-elliptic-curves/</link>
      <pubDate>Wed, 25 Sep 2019 00:00:00 +0000</pubDate>
      <guid>https://blog.costan.ro/post/2019-09-25-elliptic-curves/</guid>
      <description>&lt;p&gt;The easiest way to understand Elliptic Curve (EC), point addition, scalar multiplication and trapdoor function; explained with simple graphs and animations.&lt;/p&gt;</description>
    </item>
    <item>
      <title>EC-Schnorr</title>
      <link>https://blog.costan.ro/post/2019-06-25-ec-schnorr/</link>
      <pubDate>Tue, 25 Jun 2019 00:00:00 +0000</pubDate>
      <guid>https://blog.costan.ro/post/2019-06-25-ec-schnorr/</guid>
      <description>&lt;div id=&#34;outline-container-headline-1&#34; class=&#34;outline-2&#34;&gt;&#xA;&lt;h2 id=&#34;headline-1&#34;&gt;&#xA;Overview&#xA;&lt;/h2&gt;&#xA;&lt;div id=&#34;outline-text-headline-1&#34; class=&#34;outline-text-2&#34;&gt;&#xA;&lt;p&gt;&#xA;EC-Schnorr, as the name suggests, is a Schnorr-type digital signature scheme over elliptic curve, it&amp;#39;s &lt;a href=&#34;https://blog.costan.ro/post/2019-04-09-ecdsa&#34;&gt;ECDSA&lt;/a&gt;&amp;#39;s little sister and &lt;a href=&#34;https://blog.costan.ro/post/2019-06-19-schnorr&#34;&gt;Schnorr&lt;/a&gt;&amp;#39;s big brother implemented in the upcoming &lt;a href=&#34;https://blockstream.com/2018/01/23/en-musig-key-aggregation-schnorr-signatures/&#34;&gt;MuSig&lt;/a&gt; in Bitcoin.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Schnorr</title>
      <link>https://blog.costan.ro/post/2019-06-19-schnorr/</link>
      <pubDate>Wed, 19 Jun 2019 00:00:00 +0000</pubDate>
      <guid>https://blog.costan.ro/post/2019-06-19-schnorr/</guid>
      <description>&lt;p&gt;&lt;a href=&#34;https://en.wikipedia.org/wiki/Schnorr_signature&#34;&gt;Schnorr&lt;/a&gt; is another digital signature scheme known for its simplicity, no division, no inversion, just plain old multiplication. Here is my simple 16 lines implementation in Python.&lt;/p&gt;</description>
    </item>
    <item>
      <title>ECDSA</title>
      <link>https://blog.costan.ro/post/2019-04-09-ecdsa/</link>
      <pubDate>Tue, 09 Apr 2019 00:00:00 +0000</pubDate>
      <guid>https://blog.costan.ro/post/2019-04-09-ecdsa/</guid>
      <description>&lt;p&gt;Elliptic curve cryptography (&lt;a href=&#34;https://en.wikipedia.org/wiki/Elliptic-curve_cryptography&#34;&gt;ECC&lt;/a&gt;) and digital signature algorithm (&lt;a href=&#34;https://en.wikipedia.org/wiki/Elliptic_Curve_Digital_Signature_Algorithm&#34;&gt;ECDSA&lt;/a&gt;) are more complex than RSA or ElGamal but I will try my best to hide the hairy math and the implementation details.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
