most citedClose to Uniform Prime Number Generation With Fewer Random Bits

11 citations · 16 across the 3 of their papers we have counts for

collaborators

5 papers

cs.CR20232 cited

Your DRM Can Watch You Too: Exploring the Privacy Implications of Browsers (mis)Implementations of Widevine EME

Gwendal Patat, Mohamed Sabt, Pierre-Alain Fouque

Thanks to HTML5, users can now view videos on Web browsers without installing plug-ins or relying on specific devices. In 2017, W3C published Encrypted Media Extensions (EME) as th…

cs.CR20232 cited

From Dragondoom to Dragonstar: Side-channel Attacks and Formally Verified Implementation of WPA3 Dragonfly Handshake

Daniel De Almeida Braga, Natalia Kulatova, Mohamed Sabt +2

It is universally acknowledged that Wi-Fi communications are important to secure. Thus, the Wi-Fi Alliance published WPA3 in 2018 with a distinctive security feature: it leverages…

math.NT2023

Computing -th roots in number fields

Olivier Bernard, Pierre-Alain Fouque, Andrea Lesavourey

We describe several algorithms for computing -th roots of elements in a number field , where is an odd prime-power integer. In particular we generalize Couveignes' and Th…

cs.CR201411 cited

Close to Uniform Prime Number Generation With Fewer Random Bits

Pierre-Alain Fouque, Mehdi Tibouchi

In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime less than , the basic idea is to fix a…

cs.SC20145 cited

Solving the "Isomorphism of Polynomials with Two Secrets" Problem for all Pairs of Quadratic Forms

Jérôme Plût, Pierre-Alain Fouque, Gilles Macario-Rat

We study the Isomorphism of Polynomial (IP2S) problem with m=2 homogeneous quadratic polynomials of n variables over a finite field of odd characteristic: given two quadratic polyn…