Thierry P. Berger

Orcid: 0000-0002-6215-174X

According to our database1, Thierry P. Berger authored at least 43 papers between 1990 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Security Analysis of a Cryptosystem Based on Subspace Subcodes.
Proceedings of the Code-Based Cryptography - 9th International Workshop, 2021

2019
Generalized Subspace Subcodes With Application in Cryptology.
IEEE Trans. Inf. Theory, 2019

2017
Gabidulin Matrix Codes and Their Application to Small Ciphertext Size Cryptosystems.
Proceedings of the Progress in Cryptology - INDOCRYPT 2017, 2017

A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography.
Proceedings of the Codes, Cryptology and Information Security, 2017

2016
Extended Generalized Feistel Networks Using Matrix Representation to Propose a New Lightweight Block Cipher: Lilliput.
IEEE Trans. Computers, 2016

2015
Some Results Using the Matrix Methods on Impossible, Integral and Zero-Correlation Distinguishers for Feistel-Like Ciphers.
Proceedings of the Progress in Cryptology - INDOCRYPT 2015, 2015

CUBE Cipher: A Family of Quasi-Involutive Block Ciphers Easy to Mask.
Proceedings of the Codes, Cryptology, and Information Security, 2015

Codes over <i>L</i>(GF(2)<sup>m, GF(2)<sup>m)</sup></sup> , MDS Diffusion Matrices and Cryptographic Applications.
Proceedings of the Codes, Cryptology, and Information Security, 2015

2014
Codes over finite quotients of polynomial rings.
Finite Fields Their Appl., 2014

2013
Extended Generalized Feistel Networks Using Matrix Representation.
Proceedings of the Selected Areas in Cryptography - SAC 2013, 2013

Construction of Recursive MDS Diffusion Layers from Gabidulin Codes.
Proceedings of the Progress in Cryptology - INDOCRYPT 2013, 2013

2012
Cryptanalysis of Pseudo-random Generators Based on Vectorial FCSRs.
Proceedings of the Progress in Cryptology, 2012

The GLUON Family: A Lightweight Hash Function Family Based on FCSRs.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2012, 2012

2011
Revisiting LFSRs for Cryptographic Applications.
IEEE Trans. Inf. Theory, 2011

A matrix approach for FCSR automata.
Cryptogr. Commun., 2011

2010
Revisiting LFSMs
CoRR, 2010

2009
A new approach for FCSRs.
IACR Cryptol. ePrint Arch., 2009

Software Oriented Stream Ciphers Based upon FCSRs in Diversified Mode.
Proceedings of the Progress in Cryptology, 2009

Reducing Key Length of the McEliece Cryptosystem.
Proceedings of the Progress in Cryptology, 2009

2008
F-FCSR Stream Ciphers.
Proceedings of the New Stream Cipher Designs - The eSTREAM Finalists, 2008

Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators.
IEEE Trans. Inf. Theory, 2008

Correction to "Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm" [May 04 910-917].
IEEE Trans. Inf. Theory, 2008

2007
X-FCSR: a new software oriented stream cipher based upon FCSRs.
IACR Cryptol. ePrint Arch., 2007

2006
On Almost Perfect Nonlinear Functions Over F<sub>2</sub><sup>n</sup>.
IEEE Trans. Inf. Theory, 2006

2005
Design and Properties of a New Pseudorandom Generator Based on a Filtered FCSR Automaton.
IEEE Trans. Computers, 2005

How to Mask the Structure of Codes for a Cryptographic Use.
Des. Codes Cryptogr., 2005

On almost perfect nonlinear mappings over F<sup>n</sup><sub>2</sub>.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Two Algebraic Attacks Against the F-FCSRs Using the IV Mode.
Proceedings of the Progress in Cryptology, 2005

F-FCSR: Design of a New Class of Stream Ciphers.
Proceedings of the Fast Software Encryption: 12th International Workshop, 2005

2004
Feedback with carry shift registers synthesis with the Euclidean algorithm.
IEEE Trans. Inf. Theory, 2004

Designing an Efficient and Secure Public-Key Cryptosystem Based on Reducible Rank Codes.
Proceedings of the Progress in Cryptology, 2004

2003
Isometries for rank distance and permutation group of Gabidulin codes.
IEEE Trans. Inf. Theory, 2003

2002
Automorphism groups of homogeneous and projective Reed-Muller codes.
IEEE Trans. Inf. Theory, 2002

A New Class of Stream Ciphers Combining LFSR and FCSR Architectures.
Proceedings of the Progress in Cryptology, 2002

2001
Cyclic Projective Reed-Muller Codes.
Proceedings of the Applied Algebra, 2001

2000
Goppa and related codes invariant under a prescribed permutation.
IEEE Trans. Inf. Theory, 2000

1999
New Classes of Cyclic Extended Goppa Codes.
IEEE Trans. Inf. Theory, 1999

The Automorphism Groups of BCH Codes and of Some Affine-Invariant Codes Over Extension Fields.
Des. Codes Cryptogr., 1999

1996
The permutation group of affine-invariant extended cyclic codes.
IEEE Trans. Inf. Theory, 1996

On the Automorphism Groups of Affine-Invariant Codes.
Des. Codes Cryptogr., 1996

1994
The automorphism group of double-error-correcting BCH codes.
IEEE Trans. Inf. Theory, 1994

1993
The automorphism group of Generalized Reed-Muller codes.
Discret. Math., 1993

1990
A direct proof for the automorphism group of Reed-Solomon codes.
Proceedings of the EUROCODE '90, 1990


  Loading...