Nicolas Sendrier

According to our database1, Nicolas Sendrier authored at least 54 papers between 1990 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
About Wave Implementation and its Leakage Immunity.
IACR Cryptology ePrint Archive, 2019

On the Decoding Failure Rate of QC-MDPC Bit-Flipping Decoders.
Proceedings of the Post-Quantum Cryptography - 10th International Conference, 2019

2018
This is Not an Attack on Wave.
IACR Cryptology ePrint Archive, 2018

Wave: A New Code-Based Signature Scheme.
IACR Cryptology ePrint Archive, 2018

QC-MDPC: A Timing Attack and a CCA2 KEM.
Proceedings of the Post-Quantum Cryptography - 9th International Conference, 2018

2017
Code-Based Cryptography: State of the Art and Perspectives.
IEEE Security & Privacy, 2017

A new signature scheme based on (U|U+V) codes.
IACR Cryptology ePrint Archive, 2017

Editorial: Special issue on coding and cryptography.
Des. Codes Cryptogr., 2017

Quantum Cryptanalysis (Dagstuhl Seminar 17401).
Dagstuhl Reports, 2017

A code-based blind signature.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

CAKE: Code-Based Algorithm for Key Encapsulation.
Proceedings of the Cryptography and Coding - 16th IMA International Conference, 2017

2016
Code-Based Cryptography: New Security Solutions Against a Quantum Adversary.
ERCIM News, 2016

Analysis of Information Set Decoding for a Sub-linear Error Weight.
Proceedings of the Post-Quantum Cryptography - 7th International Workshop, 2016

Worst case QC-MDPC decoder for McEliece cryptosystem.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Quantum Cryptanalysis (Dagstuhl Seminar 15371).
Dagstuhl Reports, 2015

2014
Recovering the interleaver of an unknown turbo-code.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
A Non Asymptotic Analysis of Information Set Decoding.
IACR Cryptology ePrint Archive, 2013

The Hardness of Code Equivalence over and Its Application to Code-Based Cryptography.
Proceedings of the Post-Quantum Cryptography - 5th International Workshop, 2013

MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
CFS Software Implementation.
IACR Cryptology ePrint Archive, 2012

Reconstruction of constellation labeling with convolutional coded data.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

Implementing CFS.
Proceedings of the Progress in Cryptology, 2012

2011
Niederreiter Encryption Scheme.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

McEliece Public Key Cryptosystem.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Code-Based Cryptography.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Digital Signature Schemes from Codes.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Digital Signature Scheme Based on McEliece.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Decoding One Out of Many.
Proceedings of the Post-Quantum Cryptography - 4th International Workshop, 2011

The tightness of security reductions in code-based cryptography.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

2010
Reconstruction of a turbo-code interleaver from noisy observation.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Reconstruction of convolutional codes from noisy observation.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Security Bounds for the Design of Code-Based Cryptosystems.
Proceedings of the Advances in Cryptology, 2009

2008
McEliece Cryptosystem Implementation: Theory and Practice.
Proceedings of the Post-Quantum Cryptography, Second International Workshop, 2008

2007
SYND: a Fast Code-Based Stream Cipher with a Security Reduction.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2005
Niederreiter Encryption Scheme.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

McEliece Public Key Cryptosystem.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

A Family of Fast Syndrome Based Cryptographic Hash Functions.
Proceedings of the Progress in Cryptology, 2005

Encoding information into constant weight words.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Linear codes with complementary duals meet the Gilbert-Varshamov bound.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
HAVEGE: A user-level software heuristic for generating empirically strong random numbers.
ACM Trans. Model. Comput. Simul., 2003

A Fast Provably Secure Cryptographic Hash Function.
IACR Cryptology ePrint Archive, 2003

2001
Weak keys in the McEliece public-key cryptosystem.
IEEE Trans. Information Theory, 2001

How to Achieve a McEliece-Based Digital Signature Scheme.
Proceedings of the Advances in Cryptology, 2001

2000
Finding the permutation between equivalent linear codes: The support splitting algorithm.
IEEE Trans. Information Theory, 2000

1998
On the Concatenated Structure of a Linear Code.
Appl. Algebra Eng. Commun. Comput., 1998

Cryptanalysis of the Original McEliece Cryptosystem.
Proceedings of the Advances in Cryptology, 1998

1997
On the Dimension of the Hull.
SIAM J. Discrete Math., 1997

1995
Efficient Generation of Binary Words of Given Weight.
Proceedings of the Cryptography and Coding, 1995

1994
Idempotents and the BCH bound.
IEEE Trans. Information Theory, 1994

1993
On the concatenated structures of a [49, 18, 12] binary abelian code.
Discrete Mathematics, 1993

Product codes and the Singleton bound.
Proceedings of the Algebraic Coding, 1993

1992
Studying the locator polynomials of minimum weight codewords of BCH codes.
IEEE Trans. Information Theory, 1992

1991
On Correlation-Immune Functions.
Proceedings of the Advances in Cryptology, 1991

1990
The minimum distance of some binary codes via the Newton's identities.
Proceedings of the EUROCODE '90, 1990


  Loading...