<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Breaking the encryption scheme of the Moscow Internet voting system · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1908.05127/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1908.05127/feed.xml" rel="self" type="application/rss+xml" /><item><title>Breaking the encryption scheme of the Moscow Internet voting system — mentioned by aazaa</title><link>https://news.ycombinator.com/item?id=20799399</link><guid isPermaLink="false">urn:hackerpapers:mention:1908.05127:20799399</guid><pubDate>Mon, 26 Aug 2019 12:50:14 GMT</pubDate><description>&lt;p&gt;The paper notes another, distinct, attack possibility: &amp;gt; Before going to this, we mention quickly another mistake in the design that could in itself have led to devastating attacks. The generators that are given in public- key.json are generators of the whole multiplicative group. However, due to the Chinese remainder theorem, it is a good practice to use a generator of prime order. In the present case, the generators will have their order divisible by 2, and therefore there is a huge risk that one bit of information leaks from a ciphertext. In a context like e-voting where a ballot can have…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1908.05127/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CR</category></item><item><title>Breaking the encryption scheme of the Moscow Internet voting system — mentioned by cyphar</title><link>https://news.ycombinator.com/item?id=20798524</link><guid isPermaLink="false">urn:hackerpapers:mention:1908.05127:20798524</guid><pubDate>Mon, 26 Aug 2019 09:58:59 GMT</pubDate><description>&lt;p&gt;The paper[1] makes it much clearer. They aren&amp;#x27;t using elliptic curves, they&amp;#x27;re using prime fields with ElGamal (with a weird construction using three separate keys for some reason). The security is similar to RSA-256 (in other words, &amp;quot;awful&amp;quot;) -- it makes sense that they could crack it in 20 minutes. [1]: https://arxiv.org/pdf/1908.05127.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1908.05127/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CR</category></item><item><title>Breaking the encryption scheme of the Moscow Internet voting system — mentioned by cyphar</title><link>https://news.ycombinator.com/item?id=20798512</link><guid isPermaLink="false">urn:hackerpapers:mention:1908.05127:20798512</guid><pubDate>Mon, 26 Aug 2019 09:55:38 GMT</pubDate><description>&lt;p&gt;The article doesn&amp;#x27;t mention this, but if you look at the paper[1] it turns out they aren&amp;#x27;t using ElGamal with elliptic curve fields -- instead they&amp;#x27;re using prime fields. In that case, you&amp;#x27;d want similar key sizes to RSA. (The &amp;quot;less than 256 bit&amp;quot; part is a red herring, the problem is that they are using key sizes that would only be safe if they were using elliptic curves.) [1]: https://arxiv.org/pdf/1908.05127.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1908.05127/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CR</category></item><item><title>Breaking the encryption scheme of the Moscow Internet voting system — HN submission</title><link>https://news.ycombinator.com/item?id=20758482</link><guid isPermaLink="false">urn:hackerpapers:submission:1908.05127:20758482</guid><pubDate>Wed, 21 Aug 2019 15:58:17 GMT</pubDate><description>&lt;p&gt;Breaking the encryption scheme of the Moscow internet voting system&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1908.05127/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CR</category></item><item><title>Breaking the encryption scheme of the Moscow Internet voting system — HN submission</title><link>https://news.ycombinator.com/item?id=20712779</link><guid isPermaLink="false">urn:hackerpapers:submission:1908.05127:20712779</guid><pubDate>Fri, 16 Aug 2019 06:57:13 GMT</pubDate><description>&lt;p&gt;Breaking the encryption scheme of the Moscow internet voting system&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1908.05127/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CR</category></item></channel></rss>
