1 citations · 1 across the 5 of their papers we have counts for
5 papers
Subcodes of Lambda-Gabidulin Codes for Compact-Ciphertext Cryptography
Freddy Lendé Metouké, Hervé Talé Kalachi, Hermann Tchatchiem Kamche +2
This paper investigates subcodes of lambda-Gabidulin codes, viewed as rank-metric analogues of generalized Reed--Solomon codes, and their applications to compact-ciphertext cryptos…
Improved Decoding Algorithm of BD-LRPC Codes
Hermann Tchatchiem Kamche
A Bounded-Degree Low-Rank Parity-Check (BD-LRPC) code is a rank-metric code that admits a parity-check matrix whose support is generated by a set of powers of an element. This spec…
Solving Systems of Algebraic Equations Over Finite Commutative Rings and Applications
Hermann Tchatchiem Kamche, Hervé Talé Kalachi
Several problems in algebraic geometry and coding theory over finite rings are modeled by systems of algebraic equations. Among these problems, we have the rank decoding problem, w…
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…