Antoine Joux

Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances (Invited Talk)

2017 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

The discrete logarithm problem is one of the few hard problems on which public-key cryptography can be based. It was introduced in the field by the famous Diffie-Hellman key exchange protocol. Initially, the cryptographic use …

Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms

2022 · Advances in Mathematics of Communications

Elliptic bases, introduced by Couveignes and Lercier in 2009, give an elegant way of representing finite field extensions. A natural question which seems to have been considered independently by several groups is to use this …

Fherret: Proof of FHE Correct-and-Honest Evaluation with Circuit Privacy from MPCitH

2026 · IACR Communications in Cryptology

The major Fully Homomorphic Encryption (FHE) schemes guarantee the privacy of the encrypted message only in the honest-but-curious setting, when the server follows the protocol without deviating. However, various attacks in the literature show that …