Jean-Pierre Flori

According to our database1, Jean-Pierre Flori authored at least 17 papers between 2010 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Computing isomorphisms and embeddings of finite fields.
ACM Commun. Comput. Algebra, 2018

2017
On a generalised combinatorial conjecture involving addition mod 2<sup>k</sup> - 1.
Int. J. Inf. Coding Theory, 2017

2016
A conjecture about Gauss sums and bentness of binomial Boolean functions.
IACR Cryptol. ePrint Arch., 2016

2015
Diversity and Transparency for ECC.
IACR Cryptol. ePrint Arch., 2015

2013
Hyperbent Functions via Dillon-Like Exponents.
IEEE Trans. Inf. Theory, 2013

An efficient characterization of a family of hyper-bent functions with multiple trace terms.
J. Math. Cryptol., 2013

2012
On the Number of Carries Occurring in an Addition Mod 2k-1.
Integers, 2012

A note on hyper-bent functions via Dillon-like exponents.
IACR Cryptol. ePrint Arch., 2012

Dickson polynomials, hyperelliptic curves and hyper-bent functions.
IACR Cryptol. ePrint Arch., 2012

Hyper-bent functions via Dillon-like exponents.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
On the Number of Carries Occuring in an Addition mod 2<sup>k</sup>-1.
IACR Cryptol. ePrint Arch., 2011

The Value 4 of Binary Kloosterman Sums.
IACR Cryptol. ePrint Arch., 2011

An efficient characterization of a family of hyperbent functions with multiple trace terms.
IACR Cryptol. ePrint Arch., 2011

On a generalized combinatorial conjecture involving addition mod 2<sup>k</sup>-1.
IACR Cryptol. ePrint Arch., 2011

Non-malleable codes from the wire-tap channel.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Binary Kloosterman Sums with Value 4.
Proceedings of the Cryptography and Coding - 13th IMA International Conference, 2011

2010
On a conjecture about binary strings distribution.
IACR Cryptol. ePrint Arch., 2010


  Loading...