Software implementations of discrete logarithm based cryptosystems over finite fields typically make the assumption that any domain parameters they encounter define cyclic groups for which the discrete logarithm problem is assumed to be hard.
Articles About Crypto
-
Indiscreet Logs: Diffie-Hellman Backdoors in TLS
Aleksander Essex February 27, 2017
Categories: Crypto TLS Vulnerabilities Papers -
A Security Analysis of Helios
Aleksander Essex December 08, 2016
Categories: Crypto E2E Internet-voting PapersHelios is an open-audit internet voting system providing cryptographic protections to voter privacy, and election integrity. As part of these protections, Helios produces a cryptographic audit trail that can be used to verify ballots were correctly counted. Cryptographic end-to-end (E2E) election verification schemes of this kind are a promising...