Vlad Dragoi

Orcid: 0000-0002-8673-9097

According to our database1, Vlad Dragoi authored at least 42 papers between 2013 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Closed-Form Weight Enumeration of Polar Codes: 1.5d -Weight Codewords.
IEEE Trans. Commun., October, 2024

Which Coefficients Matter Most - Consecutive $k$-Out-of-$n$:$F$ Systems Revisited.
IEEE Trans. Reliab., September, 2024

Integer syndrome decoding in the presence of noise.
Cryptogr. Commun., September, 2024

Full Key-Recovery Cubic-Time Template Attack on Classic McEliece Decapsulation.
IACR Cryptol. ePrint Arch., 2024

Weight Structure of Low/High-Rate Polar Codes and Its Applications.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Reliability polynomials of consecutive-<i>k</i>-out-of-<i>n</i>:<i>F</i>systems have unbounded roots.
Networks, October, 2023

Punctured Syndrome Decoding Problem Efficient Side-Channel Attacks Against Classic McEliece.
IACR Cryptol. ePrint Arch., 2023

Horizontal Correlation Attack on Classic McEliece.
IACR Cryptol. ePrint Arch., 2023

Fast Methods for Ranking Synthetic BECs.
Proceedings of the IEEE International Symposium on Information Theory, 2023

A Side-Channel Attack Against Classic McEliece When Loading the Goppa Polynomial.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2023, 2023

2022
Profiled Side-Channel Attack on Cryptosystems Based on the Binary Syndrome Decoding Problem.
IEEE Trans. Inf. Forensics Secur., 2022

Fast reliability ranking of matchstick minimal networks.
Networks, 2022

Message-recovery Profiled Side-channel Attack on the Classic McEliece Cryptosystem.
IACR Cryptol. ePrint Arch., 2022

Consecutive k-out-of-n: F Systems Have Unbounded Roots.
CoRR, 2022

Generalized Inverse Based Decoding.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Key-Recovery by Side-Channel Information on the Matrix-Vector Product in Code-Based Cryptosystems.
Proceedings of the Information Security and Cryptology - ICISC 2022, 2022

2021
Efficient Approximation of Two-Terminal Networks Reliability Polynomials Using Cubic Splines.
IEEE Trans. Reliab., 2021

Bhattacharyya Parameter of Monomial Codes for the Binary Erasure Channel: From Pointwise to Average Reliability.
Sensors, 2021

Generalized Convexity Properties and Shape Based Approximation in Networks Reliability.
CoRR, 2021

Bhattacharyya parameter of monomials codes for the Binary Erasure Channel: from pointwise to average reliability.
CoRR, 2021

Structural Properties of Self-dual Monomial Codes with Application to Code-Based Cryptography.
Proceedings of the Cryptography and Coding - 18th IMA International Conference, 2021

Message-Recovery Laser Fault Injection Attack on the Classic McEliece Cryptosystem.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2020
Solving a Modified Syndrome Decoding Problem using Integer Programming.
Int. J. Comput. Commun. Control, August, 2020

Studying the Binary Erasure Polarization Subchannels Using Network Reliability.
IEEE Commun. Lett., 2020

Message-recovery Laser Fault Injection Attack on Code-based Cryptosystems.
IACR Cryptol. ePrint Arch., 2020

On recursively defined combinatorial classes and labelled trees.
CoRR, 2020

Tight Bounds on the Coeffcients of Consecutive k-out-of-n: F Systems.
CoRR, 2020

Combinatorial Algorithms for Integer Syndrome Decoding Problem.
Proceedings of the Soft Computing Applications, 2020

Consecutive Systems Asymptotic Threshold Behaviors.
Proceedings of the Soft Computing Applications, 2020

Why Reliability for Computing Needs Rethinking.
Proceedings of the International Conference on Rebooting Computing, 2020

2019
Cubic spline approximation of the reliability polynomials of two dual hammock networks.
CoRR, 2019

2018
How Reliable are Compositions of Series and Parallel Networks Compared with Hammocks?
Int. J. Comput. Commun. Control, 2018

Cryptanalysis of a Public Key Encryption Scheme Based on QC-LDPC and QC-MDPC Codes.
IEEE Commun. Lett., 2018

On Posets for Reliability: How Fine Can They Be?
Proceedings of the Soft Computing Applications, 2018

Vulnerabilities of the McEliece Variants Based on Polar Codes.
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2018

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 ).
PhD thesis, 2017

Improved Timing Attacks against the Secret Permutation in the McEliece PKC.
Int. J. Comput. Commun. Control, 2017

Evolution of the McEliece Public Key Encryption Scheme.
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2017

2016
Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes.
Proceedings of the Post-Quantum Cryptography - 7th International Workshop, 2016

Algebraic properties of polar codes from a new polynomial formalism.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Weak Keys for the Quasi-Cyclic MDPC Public Key Encryption Scheme.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2016, 2016

2013
Polynomial Structures in Code-Based Cryptography.
Proceedings of the Progress in Cryptology - INDOCRYPT 2013, 2013


  Loading...