François Arnault

According to our database1, François Arnault authored at least 20 papers between 1995 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Luxury Toys for Men: When women will let us decide and buy on our own?
Proceedings of the 5th International Conference on Information Technology and Quantitative Management, 2017

2015
A qutrit Quantum Key Distribution protocol using Bell inequalities with larger violation capabilities.
Quantum Inf. Comput., 2015

Multidimensional Bell Inequalities and Quantum Cryptography.
Proceedings of the Codes, Cryptology, and Information Security, 2015

2014
A qutrit Quantum Key Distribution protocol with better noise resistance.
CoRR, 2014

Formes quadratiques de discriminants emboîtés.
CoRR, 2014

2012
Construction of self-dual normal bases and their complexity.
Finite Fields Their Appl., 2012

2011
Revisiting LFSRs for Cryptographic Applications.
IEEE Trans. Inf. Theory, 2011

A matrix approach for FCSR automata.
Cryptogr. Commun., 2011

2010
Revisiting LFSMs
CoRR, 2010

2009
A new approach for FCSRs.
IACR Cryptol. ePrint Arch., 2009

2008
F-FCSR Stream Ciphers.
Proceedings of the New Stream Cipher Designs - The eSTREAM Finalists, 2008

Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators.
IEEE Trans. Inf. Theory, 2008

Correction to "Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm" [May 04 910-917].
IEEE Trans. Inf. Theory, 2008

2007
X-FCSR: a new software oriented stream cipher based upon FCSRs.
IACR Cryptol. ePrint Arch., 2007

2005
Design and Properties of a New Pseudorandom Generator Based on a Filtered FCSR Automaton.
IEEE Trans. Computers, 2005

F-FCSR: Design of a New Class of Stream Ciphers.
Proceedings of the Fast Software Encryption: 12th International Workshop, 2005

2004
Feedback with carry shift registers synthesis with the Euclidean algorithm.
IEEE Trans. Inf. Theory, 2004

2002
A New Class of Stream Ciphers Combining LFSR and FCSR Architectures.
Proceedings of the Progress in Cryptology, 2002

1997
The Rabin-Monier theorem for Lucas pseudoprimes.
Math. Comput., 1997

1995
Constructing Carmichael Numbers which are Strong Pseudoprimes to Several Bases.
J. Symb. Comput., 1995


  Loading...