Breaking the encryption scheme of the Moscow Internet voting system

Pierrick Gaudry 1 Alexander Golovnev 2
1 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : In September 2019, voters for the election at the Parliament of the city of Moscow were allowed to use an Internet voting system. The source code of it had been made available for public testing. In this paper we show two successful attacks on the encryption scheme implemented in the voting system. Both attacks were sent to the developers of the system, and both issues had been fixed after that. The encryption used in this system is a variant of ElGamal over finite fields. In the first attack we show that the used key sizes are too small. We explain how to retrieve the private keys from the public keys in a matter of minutes with easily available resources. When this issue had been fixed and the new system had become available for testing, we discovered that the new implementation was not semantically secure. We demonstrate how this newly found security vulnerability can be used for counting the number of votes cast for a candidate.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download

https://hal.inria.fr/hal-02266264
Contributor : Pierrick Gaudry <>
Submitted on : Wednesday, November 13, 2019 - 1:11:42 PM
Last modification on : Saturday, November 16, 2019 - 1:27:48 AM
Long-term archiving on: Friday, February 14, 2020 - 4:19:05 PM

Files

merger_arxiv.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02266264, version 2
  • ARXIV : 1908.05127

Collections

Citation

Pierrick Gaudry, Alexander Golovnev. Breaking the encryption scheme of the Moscow Internet voting system. 2019. ⟨hal-02266264v2⟩

Share

Metrics

Record views

52

Files downloads

83