9 citations · 10 across the 2 of their papers we have counts for
3 papers
cs.SC2017★ 9 cited
Computing isomorphisms and embeddings of finite fields
Ludovic Brieulle, Luca De Feo, Javad Doliskani +2
Let be a finite field. Given two irreducible polynomials over , with dividing , the finite field embedding probl…
math.NT2016★ 1 cited
A conjecture about Gauss sums and bentness of binomial Boolean functions
Jean-Pierre Flori
In this note, the polar decomposition of binary fields of even extension degree is used to reduce the evaluation of the Walsh transform of binomial Boolean functions to that of Gau…
cs.CR2011
Non-Malleable Codes from the Wire-Tap Channel
Hervé Chabanne, Gérard Cohen, Jean-Pierre Flori +1
Recently, Dziembowski et al. introduced the notion of non-malleable codes (NMC), inspired from the notion of non-malleability in cryptography and the work of Gennaro et al. in 2004…