Polynomial Structures in Code-Based Cryptography. - Vlad Dragoi; Pierre-Louis Cayrel; Brice Colombier; Tania Richmond (INDOCRYPT, 2013)

Weak Keys for the Quasi-Cyclic MDPC Public Key Encryption Scheme. - Magali Bardet; Vlad Dragoi; Jean-Gabriel Luque; Ayoub Otmani (AFRICACRYPT, 2016)

Algebraic properties of polar codes from a new polynomial formalism. - Magali Bardet; Vlad Dragoi; Ayoub Otmani; Jean-Pierre Tillich (ISIT, 2016)

Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes. - Magali Bardet; Julia Chaulet; Vlad Dragoi; Ayoub Otmani; Jean-Pierre Tillich (PQCrypto, 2016)

Evolution of the McEliece Public Key Encryption Scheme. - Dominic Bucerzan; Vlad Dragoi; Hervé Talé Kalachi (SECITC, 2017)

Improved Timing Attacks against the Secret Permutation in the McEliece PKC. - Dominic Bucerzan; Pierre-Louis Cayrel; Vlad Dragoi; Tania Richmond (Int. J. Comput. Commun. Control, 2017)

Algebraic approach for the study of algorithmic problems coming from cryptography and the theory of error correcting codes. (Approche algébrique pour l'étude et la résolution de problèmes algorithmiques issus de la cryptographie et de la théorie des codes ). - Vlad Dragoi (2017)

Vulnerabilities of the McEliece Variants Based on Polar Codes. - Vlad Dragoi; Valeriu Beiu; Dominic Bucerzan (SecITC, 2018)

On Posets for Reliability: How Fine Can They Be? - Valeriu Beiu; Simon Robin Cowell; Vlad-Florin Dragoi (SOFA (1), 2018)

Cryptanalysis of a Public Key Encryption Scheme Based on QC-LDPC and QC-MDPC Codes. - Vlad Dragoi; Hervé Talé Kalachi (IEEE Commun. Lett., 2018)

How Reliable are Compositions of Series and Parallel Networks Compared with Hammocks? - Vlad Dragoi; Simon Robin Cowell; Valeriu Beiu; Sorin Hoara; Pastorel Gaspar (Int. J. Comput. Commun. Control, 2018)

Cubic spline approximation of the reliability polynomials of two dual hammock networks. - Gabriela Cristescu; Vlad-Florin Dragoi (CoRR, 2019)

Why Reliability for Computing Needs Rethinking. - Valeriu Beiu; Vlad-Florin Dragoi; Roxana-Mariana Beiu (ICRC, 2020)

Consecutive Systems Asymptotic Threshold Behaviors. - Vlad-Florin Dragoi; Valeriu Beiu (SOFA, 2020)

Combinatorial Algorithms for Integer Syndrome Decoding Problem. - Vlad-Florin Dragoi; Alin Tiberiu Lacatus; Alexandru Popoviciu (SOFA, 2020)

Tight Bounds on the Coeffcients of Consecutive k-out-of-n: F Systems. - Vlad-Florin Dragoi; Simon Robin Cowell; Valeriu Beiu (CoRR, 2020)

On recursively defined combinatorial classes and labelled trees. - Ali Chouria; Vlad-Florin Dragoi; Jean-Gabriel Luque (CoRR, 2020)

Message-recovery Laser Fault Injection Attack on Code-based Cryptosystems. - Pierre-Louis Cayrel; Brice Colombier; Vlad-Florin Dragoi; Alexandre Menu; Lilian Bossuet (IACR Cryptol. ePrint Arch., 2020)

Studying the Binary Erasure Polarization Subchannels Using Network Reliability. - Vlad Dragoi; Valeriu Beiu (IEEE Commun. Lett., 2020)

Solving a Modified Syndrome Decoding Problem using Integer Programming. - Vlad-Florin Dragoi; Pierre-Louis Cayrel; Brice Colombier; Dominic Bucerzan; Sorin Hoara (Int. J. Comput. Commun. Control, 2020)

Message-Recovery Laser Fault Injection Attack on the Classic McEliece Cryptosystem. - Pierre-Louis Cayrel; Brice Colombier; Vlad-Florin Dragoi; Alexandre Menu; Lilian Bossuet (EUROCRYPT (2), 2021)

Structural Properties of Self-dual Monomial Codes with Application to Code-Based Cryptography. - Vlad-Florin Dragoi; Andreea Szocs (IMACC, 2021)

Bhattacharyya parameter of monomials codes for the Binary Erasure Channel: from pointwise to average reliability. - Vlad-Florin Dragoi; Gabriela Cristescu (CoRR, 2021)

Generalized Convexity Properties and Shape Based Approximation in Networks Reliability. - Gabriela Cristescu; Vlad-Florin Dragoi; Sorin-Horatiu Hoara (CoRR, 2021)

Bhattacharyya Parameter of Monomial Codes for the Binary Erasure Channel: From Pointwise to Average Reliability. - Vlad-Florin Dragoi; Gabriela Cristescu (Sensors, 2021)

Efficient Approximation of Two-Terminal Networks Reliability Polynomials Using Cubic Splines. - Gabriela Cristescu; Vlad-Florin Dragoi (IEEE Trans. Reliab., 2021)

Key-Recovery by Side-Channel Information on the Matrix-Vector Product in Code-Based Cryptosystems. - Boly Seck; Pierre-Louis Cayrel; Idy Diop; Vlad-Florin Dragoi; Kalen Couzon; Brice Colombier; Vincent Grosso (ICISC, 2022)

Generalized Inverse Based Decoding. - Ferucio Laurentiu Tiplea; Vlad-Florin Dragoi (ISIT, 2022)

Consecutive k-out-of-n: F Systems Have Unbounded Roots. - Marilena Jianu; Leonard Daus; Vlad-Florin Dragoi; Valeriu Beiu (CoRR, 2022)

Message-recovery Profiled Side-channel Attack on the Classic McEliece Cryptosystem. - Brice Colombier; Vlad-Florin Dragoi; Pierre-Louis Cayrel; Vincent Grosso (IACR Cryptol. ePrint Arch., 2022)

Fast reliability ranking of matchstick minimal networks. - Vlad-Florin Dragoi; Valeriu Beiu (Networks, 2022)

Profiled Side-Channel Attack on Cryptosystems Based on the Binary Syndrome Decoding Problem. - Brice Colombier; Vlad-Florin Dragoi; Pierre-Louis Cayrel; Vincent Grosso (IEEE Trans. Inf. Forensics Secur., 2022)

A Side-Channel Attack Against Classic McEliece When Loading the Goppa Polynomial. - Boly Seck; Pierre-Louis Cayrel; Vlad-Florin Dragoi; Idy Diop; Morgan Barbier; Jean Belo Klamti; Vincent Grosso; Brice Colombier (AFRICACRYPT, 2023)

Fast Methods for Ranking Synthetic BECs. - Hsin-Po Wang 001; Vlad-Florin Dragoi (ISIT, 2023)

Horizontal Correlation Attack on Classic McEliece. - Brice Colombier; Vincent Grosso; Pierre-Louis Cayrel; Vlad-Florin Dragoi (IACR Cryptol. ePrint Arch., 2023)

Punctured Syndrome Decoding Problem Efficient Side-Channel Attacks Against Classic McEliece. - Vincent Grosso; Pierre-Louis Cayrel; Brice Colombier; Vlad-Florin Dragoi (IACR Cryptol. ePrint Arch., 2023)

Reliability polynomials of consecutive-k-out-of-n:Fsystems have unbounded roots. - Marilena Jianu; Leonard Daus; Vlad-Florin Dragoi; Valeriu Beiu (Networks, 2023)

Weight Structure of Low/High-Rate Polar Codes and Its Applications. - Mohammad Rowshan; Vlad-Florin Dragoi; Jinhong Yuan (ISIT, 2024)

Integer syndrome decoding in the presence of noise. - Vlad-Florin Dragoi; Brice Colombier; Pierre-Louis Cayrel; Vincent Grosso (Cryptogr. Commun., 2024)

Which Coefficients Matter Most - Consecutive $k$-Out-of-$n$:$F$ Systems Revisited. - Vlad-Florin Dragoi; Valeriu Beiu (IEEE Trans. Reliab., 2024)

On the Closed-Form Weight Enumeration of Polar Codes: 1.5d -Weight Codewords. - Vlad-Florin Dragoi; Mohammad Rowshan; Jinhong Yuan (IEEE Trans. Commun., 2024)

Optimizing Key Recovery in Classic McEliece: Advanced Error Correction for Noisy Side-Channel Measurements. - Nicolas Vallet; Pierre-Louis Cayrel; Brice Colombier; Vlad-Florin Dragoi; Vincent Grosso (IACR Commun. Cryptol., 2025)

Full Key-Recovery Cubic-Time Template Attack on Classic McEliece Decapsulation. - Vlad-Florin Dragoi; Brice Colombier; Nicolas Vallet; Pierre-Louis Cayrel; Vincent Grosso (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2025)

On Weight Enumeration and Structure Characterization of Polar Codes via Group Actions. - Vlad-Florin Dragoi; Mohammad Rowshan (CoRR, 2025)

Towards Weight Distribution-Aware Polar Codes. - Mohammad Rowshan; Vlad-Florin Dragoi (CoRR, 2025)