jean-françois couchot
jean-françois couchot
Associate Professor, HDR, Univ. of Bourgogne Franche-Comté, FEMTO-ST
Verified email at - Homepage
TitleCited byYear
Handling polymorphism in automated deduction
JF Couchot, S Lescuyer
International Conference on Automated Deduction, 263-278, 2007
Scalable automated proving and debugging of set-based specifications
JF Couchot, D Déharbe, A Giorgetti, S Ranise
Journal of the Brazilian Computer Society 9 (2), 17-36, 2003
Steganography: a class of secure and robust algorithms
JM Bahi, JF Couchot, C Guyeux
The Computer Journal 55 (6), 653-666, 2012
Proving and debugging set-based specifications
JF Couchot, F Dadeau, D Déharbe, A Giorgetti, S Ranise
Electronic Notes in Theoretical Computer Science 95, 189-208, 2004
Steganalysis via a convolutional neural network using large convolution filters for embedding process with same stego key
JF Couchot, R Couturier, C Guyeux, M Salomon
arXiv preprint arXiv:1605.07946, 2016
Finding the core-genes of chloroplasts
B Alkindy, JF Couchot, C Guyeux, A Mouly, M Salomon, JM Bahi
arXiv preprint arXiv:1409.6369, 2014
On the link between strongly connected iteration graphs and chaotic boolean discrete-time dynamical systems
JM Bahi, JF Couchot, C Guyeux, A Richard
International Symposium on Fundamentals of Computation Theory, 126-137, 2011
Steganalysis via a convolutional neural network using large convolution filters for embedding process with same stego key: A deep learning approach for telemedicine
M Salomon, R Couturier, C Guyeux, JF Couchot, JM Bahi
European Research in Telemedicine/La Recherche Européenne en Télémédecine 6 …, 2017
Blind digital watermarking in PDF documents using Spread Transform Dither Modulation
AW Bitar, R Darazi, JF Couchot, R Couturier
Multimedia Tools and Applications 76 (1), 143-161, 2017
Random Walk in a -Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations
S Contassot-Vivier, JF Couchot, C Guyeux, PC Heam
International Journal of Bifurcation and Chaos 27 (01), 1750014, 2017
Hybrid genetic algorithm and lasso test approach for inferring well supported phylogenetic trees based on subsets of chloroplastic core genes
B AlKindy, C Guyeux, JF Couchot, M Salomon, C Parisod, JM Bahi
International Conference on Algorithms for Computational Biology, 83-96, 2015
Gene similarity-based approaches for determining core-genes of chloroplasts
B AlKindy, C Guyeux, JF Couchot, M Salomon, JM Bahi
2014 IEEE International Conference on Bioinformatics and Biomedicine (BIBM …, 2014
Instantiation of parameterized data structures for model-based testing
F Bouquet, JF Couchot, F Dadeau, A Giorgetti
International Conference of B Users, 94-108, 2007
A hardware and secure pseudorandom generator for constrained devices
M Bakiri, C Guyeux, JF Couchot, L Marangio, S Galatolo
IEEE Transactions on Industrial Informatics 14 (8), 3754-3765, 2018
CIPRNG: A VLSI Family of Chaotic Iterations Post-Processings for -Linear Pseudorandom Number Generation Based on Zynq MPSoC
M Bakiri, JF Couchot, C Guyeux
IEEE Transactions on Circuits and Systems I: Regular Papers 65 (5), 1628-1641, 2017
Class of trustworthy pseudo-random number generators
JM Bahi, JF Couchot, C Guyeux, Q Wang
arXiv preprint arXiv:1112.0950, 2011
Well-supported phylogenies using largest subsets of core-genes by discrete particle swarm optimization
R Alsrraj, B AlKindy, C Guyeux, L Philippe, JF Couchot
arXiv preprint arXiv:1706.08514, 2017
STABYLO: steganography with adaptive, bbs, and binary embedding at low cost
JF Couchot, R Couturier, C Guyeux
annals of telecommunications-annales des télécommunications 70 (9-10), 441-449, 2015
Pseudorandom number generators with balanced gray codes
JF Couchot, PC Heam, C Guyeux, Q Wang, JM Bahi
2014 11th International Conference on Security and Cryptography (SECRYPT), 1-7, 2014
Steganography: a class of algorithms having secure properties
JM Bahi, JF Couchot, C Guyeux
2011 Seventh International Conference on Intelligent Information Hiding and …, 2011
The system can't perform the operation now. Try again later.
Articles 1–20