University of Bamenda
Contact Staff & student login EN FR
UBa Cyber Crypto Centre
University of Bamenda
Apply
⌕ Search the centre
Master's PhD Bachelor's Certifications & training Funding & scholarships How to apply · FAQs
Apply
Contact · Login · UBa ↗ EN FR

Research publications

Publication by: TALE KALACHI Herve

Keyeword:

Co-authors: Hermann Tchatchiem Kamche

On the rank decoding problem over finite principal ideal rings. To appear in Advances in Mathematics of Communications, https://doi.org/10.3934/amc.2023003

n/a

About the author
  • Image

    TALE KALACHI Herve

Other publications by the same author

(2017). Polynomial-time key recovery attack on the Faure–Loidreau scheme based on Gabidulin codes. Designs, Codes and Cryptography, 86(7), 1391–1403. https://doi.org/10.1007/s10623-017-0402-0

n/a

Improved cryptanalysis of rank metric schemes based on Gabidulin codes. Designs, Codes and Cryptography, 86(9), 1983–1996. https://doi.org/10.1007/s10623-017-0434-5

n/a

Cryptanalysis of a Public Key Encryption Scheme Based on QC-LDPC and QCMDPC Codes. IEEE Communications Letters, 22(2), 264–267. https://doi.org/10.1109/lcomm.2017.2779449.

n/a

On the failure of the smart approach of the GPT cryptosystem. Cryptologia, 46(2), 167–182. https://doi.org/10.1080/01611194.2020.1829181

n/a

Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer. Arabian Journal of Mathematics, 10(2), 357–366. https://doi.org/10.1007/s40065-021-00327-z

n/a

On the rank decoding problem over finite principal ideal rings. To appear in Advances in Mathematics of Communications, https://doi.org/10.3934/amc.2023003

n/a

Low-Rank Parity-Check Codes Over Finite Commutative Rings, Accepted for publication in Applicable Algebra in Engineering, Communication and Computing, Springer, 2024

n/a