Skip to Main content Skip to Navigation

Search by documents



...
tel-03299466v1  Theses
Édouard Rousseau. Arithmétique efficace des extensions de corps finis
Number Theory [math.NT]. Institut Polytechnique de Paris, 2021. English. ⟨NNT : 2021IPPAT013⟩
hal-03022508v1  Book sections
Olivier Hudry. Resolution of a Routing and Wavelength Assignment Problem by Independent Sets in Conflict Graphs
Proceedings of the 7th International Conference on Control, Decision and Information Technologies (CoDIT’20), IEEE, 2021
hal-03220027v1  Book sections
Thai DuongDuong Hieu PhanNi Trieu. Catalic: Delegated PSI Cardinality with Applications to Contact Tracing
Advances in Cryptology – ASIACRYPT 2020. ASIACRYPT 2020. Lecture Notes in Computer Science, vol 12493. Springer, pp.870-899, 2020, ⟨10.1007/978-3-030-64840-4_29⟩
...
hal-02916929v1  Book sections
Antoine LobsteinOlivier HudryIrène Charon. Locating-Domination and Identification
T. Haynes, S. Hedetniemi & M. Henning. Topics in Domination in Graphs, pp.251-299, 2020
hal-03048644v1  Journal articles
Sihem MesnagerK. H. KimJ. ChoeC. Tang. On the Menezes-Teske-Weng conjecture
Cryptography and Communications–Discrete Structures, Boolean Functions, and Sequences, 2020
hal-03085434v1  Journal articles
Z. DuC. LiSihem Mesnager. Constructions of self-orthogonal codes from hulls of BCH codes and their parameters
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2020
hal-03085420v1  Journal articles
Sihem MesnagerY. QiH. RuC. Tang. Minimal linear codes from characteristic functions
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2020
hal-03085423v1  Journal articles
N. LiSihem Mesnager. Recent results and problems on constructions of linear codes from cryptographic functions
Journal of Cryptography and Communications- Discrete Structures, Boolean Functions, and Sequences , 2020
hal-03053949v1  Journal articles
Y. QiSihem MesnagerC. Tang. Codebooks from generalized bent Z4-valued quadratic forms
Discrete Mathematics, Elsevier, 2020
hal-03053992v1  Journal articles
J. LiuSihem MesnagerD. Tang. Constructions of optimal locally recoverable codes via Dickson polynomials.
Journal of Designs, Codes, and Cryptography, 2020
hal-03048680v1  Journal articles
K. H. KimSihem Mesnager. Solving $x^{2^k+1}+x+a=0$ in $\mathbb{F}_{2^n}$ with $\gcd(n,k)=1$
Finite Fields and Their Applications, Elsevier, 2020
hal-03053979v1  Journal articles
Sihem MesnagerK.H. KimJ.H. ChoeD.N. LeeD.S. Go. Solving $x+x^{2^l}+\cdots+x^{2^{ml}}=a$ over $\mathbb{F}_{2^n}$.
Cryptography and Communications-Discrete Structures, Boolean Functions, and Sequences (CCDS), 2020
hal-03053931v1  Journal articles
Sihem MesnagerK.H. KimM.S. Jo.. On the number of the rational zeros of linearized polynomials and the second-order nonlinearity of cubic Boolean functions.
Cryptography and Communications- Discrete Structures, Boolean Functions, and Sequences (CCDS),, 2020
hal-03053939v1  Journal articles
Sihem Mesnager. On generalized hyper-bent functions
Cryptography and Communications-Discrete Structures, Boolean Functions, and Sequences (CCDS), 2020
hal-03085439v1  Journal articles
Sihem MesnagerC. TangM. Xiong. On the boomerang uniformity of quadratic permutations
Journal of Designs, Codes, and Cryptography, 2020
hal-03048656v1  Journal articles
Sihem MesnagerA. Sınak. Several classes of minimal linear codes with few weights from weakly regular plateaued function
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2020
...
hal-02919657v1  Journal articles
Wei ChengSylvain GuilleyClaude CarletSihem MesnagerJean-Luc Danger. Optimizing Inner Product Masking Scheme by A Coding Theory Approach
IEEE Transactions on Information Forensics and Security, Institute of Electrical and Electronics Engineers, 2020, 16, pp.220-235. ⟨10.1109/TIFS.2020.3009609⟩
hal-03084720v1  Book sections
Olivier Hudry. Complexity of voting procedures
Complex Social and Behavioral Systems. Encyclopedia of Complexity and Systems Science, 2020
hal-03022564v1  Journal articles
Olivier HudryAntoine Lobstein. On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path
Journal of Combinatorial Mathematics and Combinatorial Computing, Charles Babbage Research Centre, In press
hal-02931167v1  Book sections
Alain CouvreurHugues Randriambololona. Algebraic geometry codes and some applications
A Concise Encyclopedia of Coding Theory, In press, A Concise Encyclopedia of Coding Theory
...
hal-02916921v1  Journal articles
Olivier HudryAntoine Lobstein. Some Rainbow Problems in Graphs Have Complexity Equivalent to Satisfiability Problems
International Transactions in Operational Research, Wiley, In press
...
hal-01702966v1  Journal articles
Olivier HudryAntoine Lobstein. The Compared Costs of Domination, Location-Domination and Identification
Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2020, 40 (1), pp.127-147. ⟨10.7151/dmgt.2129⟩
hal-03189496v1  Conference papers
Olivier Hudry. Resolution of a Routing and Wavelength Assignment Problem by Independent Sets in Conflict Graphs
7th International Conference on Control, Decision and Information Technologies (CoDIT’20), 2020, Prague, Czech Republic