Jean-Pierre Flori

Int. J. Inf. Coding Theory, 2017

2016

A Conjecture About Gauss Sums and Bentness of Binomial Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Arithmetic of Finite Fields - 6th International Workshop, 2016

2015

Diversity and Transparency for ECC.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

2013

Hyperbent Functions via Dillon-Like Exponents.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

An efficient characterization of a family of hyper-bent functions with multiple trace terms.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2013

2012

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

[BibT_eX]

[DOI]

Hugues Randriam

Integers, 2012

A note on hyper-bent functions via Dillon-like exponents.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Dickson Polynomials, Hyperelliptic Curves and Hyper-bent Functions.

[BibT_eX]

[DOI]

Proceedings of the Sequences and Their Applications - SETA 2012, 2012

Hyper-bent functions via Dillon-like exponents.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

On the Number of Carries Occuring in an Addition mod 2k-1.

[BibT_eX]

[DOI]

Hugues Randriam

IACR Cryptol. ePrint Arch., 2011

The Value 4 of Binary Kloosterman Sums.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

An efficient characterization of a family of hyperbent functions with multiple trace terms.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

On a generalized combinatorial conjecture involving addition mod 2k-1.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Non-malleable codes from the wire-tap channel.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Binary Kloosterman Sums with Value 4.

[BibT_eX]

[DOI]