<?xml version="1.0" encoding="UTF-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/"><channel><title>Timur Manjosov – Maths &amp; Cryptography</title><description>Mathematics from my studies and beyond, with a focus on cryptography.</description><link>https://timurmanjosov.com/en/blog/</link><language>en</language><atom:link href="https://timurmanjosov.com/en/blog/category/math-crypto/feed.xml" rel="self" type="application/rss+xml"/><item><title>The group law on elliptic curves, worked through</title><link>https://timurmanjosov.com/en/blog/elliptic-curve-group-law/</link><guid isPermaLink="true">https://timurmanjosov.com/en/blog/elliptic-curve-group-law/</guid><description>Why adding points on an elliptic curve gives a group, checked on a curve with 19 points, and why the discrete logarithm stays hard anyway.</description><pubDate>Fri, 30 Oct 2026 00:00:00 GMT</pubDate><dc:creator>Timur Manjosov</dc:creator><category>Maths &amp; Cryptography</category><category>elliptic-curves</category><category>group-theory</category><category>discrete-logarithm</category><category>cryptography</category></item></channel></rss>