5 citations · 6 across the 3 of their papers we have counts for
6 papers
Generalized Subspace Subcodes in the Rank Metric
Ousmane Ndiaye, Peter Arnaud Kidoudou, Hervé Tale Kalachi
Rank-metric codes were studied by E. Gabidulin in 1985 after a brief introduction by Delsarte in 1978 as an equivalent of Reed-Solomon codes, but based on linearized polynomials. T…
On the Rank Decoding Problem Over Finite Principal Ideal Rings
Hervé Tale Kalachi, Hermann Tchatchiem Kamche
The rank decoding problem has been the subject of much attention in this last decade. This problem, which is at the base of the security of public-key cryptosystems based on rank m…
Low-Rank Parity-Check Codes Over Finite Commutative Rings
Hermann Tchatchiem Kamche, Hervé Talé Kalachi, Franck Rivel Kamwa Djomou +1
Low-Rank Parity-Check (LRPC) codes are a class of rank metric codes that have many applications specifically in network coding and cryptography. Recently, LRPC codes have been exte…
On the Failure of the Smart Approach of the GPT Cryptosystem
Herve Tale Kalachi
This paper describes a new algorithm for breaking the smart approach of the GPT cryptosystem. We show that by puncturing the public code several times on specific positions, we get…
Polynomial-Time Key Recovery Attack on the Faure-Loidreau Scheme based on Gabidulin Codes
Philippe Gaborit, Ayoub Otmani, Hervé Talé Kalachi
Encryption schemes based on the rank metric lead to small public key sizes of order of few thousands bytes which represents a very attractive feature compared to Hamming metric-bas…
Improved Cryptanalysis of Rank Metric Schemes Based on Gabidulin Codes
Ayoub Otmani, Hervé Talé Kalachi, Sélestin Ndjeya
We prove that any variant of the GPT cryptosystem which uses a right column scrambler over the extension field as advocated by the works of Gabidulin et al. with the goal to resist…