default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Pierre Flori
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j6]Ludovic Brieulle
, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost:
Computing isomorphisms and embeddings of finite fields. Math. Comput. 88(317): 1391-1426 (2019)- 2018
- [j5]Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost:
Computing isomorphisms and embeddings of finite fields. ACM Commun. Comput. Algebra 52(4): 117-119 (2018) - 2017
- [j4]Jean-Pierre Flori, Gérard D. Cohen:
On a generalised combinatorial conjecture involving addition mod 2k - 1. Int. J. Inf. Coding Theory 4(2/3): 107-115 (2017) - [i12]Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost:
Computing isomorphisms and embeddings of finite fields. CoRR abs/1705.01221 (2017) - 2016
- [c6]Jean-Pierre Flori:
A Conjecture About Gauss Sums and Bentness of Binomial Boolean Functions. WAIFI 2016: 143-159 - [i11]Jean-Pierre Flori:
A conjecture about Gauss sums and bentness of binomial Boolean functions. CoRR abs/1608.05008 (2016) - [i10]Jean-Pierre Flori:
A conjecture about Gauss sums and bentness of binomial Boolean functions. IACR Cryptol. ePrint Arch. 2016: 767 (2016) - 2015
- [i9]Jean-Pierre Flori, Jérôme Plût, Jean-René Reinhard, Martin Ekerå:
Diversity and Transparency for ECC. IACR Cryptol. ePrint Arch. 2015: 659 (2015) - 2013
- [j3]Jean-Pierre Flori, Sihem Mesnager:
An efficient characterization of a family of hyper-bent functions with multiple trace terms. J. Math. Cryptol. 7(1): 43-68 (2013) - [j2]Sihem Mesnager, Jean-Pierre Flori:
Hyperbent Functions via Dillon-Like Exponents. IEEE Trans. Inf. Theory 59(5): 3215-3232 (2013) - 2012
- [j1]Jean-Pierre Flori, Hugues Randriam:
On the Number of Carries Occurring in an Addition Mod 2k-1. Integers 12: A10 (2012) - [c5]Sihem Mesnager, Jean-Pierre Flori:
Hyper-bent functions via Dillon-like exponents. ISIT 2012: 836-840 - [c4]Jean-Pierre Flori, Sihem Mesnager:
Dickson Polynomials, Hyperelliptic Curves and Hyper-bent Functions. SETA 2012: 40-52 - [i8]Jean-Pierre Flori, Sihem Mesnager:
Dickson polynomials, hyperelliptic curves and hyper-bent functions. IACR Cryptol. ePrint Arch. 2012: 20 (2012) - [i7]Sihem Mesnager, Jean-Pierre Flori:
A note on hyper-bent functions via Dillon-like exponents. IACR Cryptol. ePrint Arch. 2012: 33 (2012) - 2011
- [c3]Jean-Pierre Flori, Sihem Mesnager, Gérard D. Cohen:
Binary Kloosterman Sums with Value 4. IMACC 2011: 61-78 - [c2]Hervé Chabanne, Gérard D. Cohen, Jean-Pierre Flori, Alain Patey:
Non-malleable codes from the wire-tap channel. ITW 2011: 55-59 - [i6]Hervé Chabanne, Gérard D. Cohen, Jean-Pierre Flori, Alain Patey:
Non-Malleable Codes from the Wire-Tap Channel. CoRR abs/1105.3879 (2011) - [i5]Jean-Pierre Flori, Hugues Randriam:
On the Number of Carries Occuring in an Addition mod 2k-1. IACR Cryptol. ePrint Arch. 2011: 245 (2011) - [i4]Jean-Pierre Flori, Sihem Mesnager, Gérard D. Cohen:
The Value 4 of Binary Kloosterman Sums. IACR Cryptol. ePrint Arch. 2011: 364 (2011) - [i3]Jean-Pierre Flori, Sihem Mesnager:
An efficient characterization of a family of hyperbent functions with multiple trace terms. IACR Cryptol. ePrint Arch. 2011: 373 (2011) - [i2]Gérard D. Cohen, Jean-Pierre Flori:
On a generalized combinatorial conjecture involving addition mod 2k-1. IACR Cryptol. ePrint Arch. 2011: 400 (2011) - 2010
- [c1]Jean-Pierre Flori, Hugues Randriam, Gérard D. Cohen, Sihem Mesnager:
On a Conjecture about Binary Strings Distribution. SETA 2010: 346-358 - [i1]Jean-Pierre Flori, Hugues Randriam, Gérard D. Cohen, Sihem Mesnager:
On a conjecture about binary strings distribution. IACR Cryptol. ePrint Arch. 2010: 170 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
