Please use this identifier to cite or link to this item:
Title: A new technique in rank metric code-based encryption
Authors: Lau, T.S.C. 
Tan, C.H. 
Keywords: Code-based cryptography
Provable security
Public key encryption
Issue Date: 2018
Publisher: MDPI AG
Citation: Lau, T.S.C., Tan, C.H. (2018). A new technique in rank metric code-based encryption. Cryptography 2 (4) : 42370. ScholarBank@NUS Repository.
Rights: Attribution 4.0 International
Abstract: We propose a rank metric codes based encryption based on the hard problem of rank syndrome decoding problem. We propose a new encryption with a public key matrix by considering the adding of a random distortion matrix over Fqm of full column rank n. We show that IND-CPA security is achievable for our encryption under assumption of the Decisional Rank Syndrome Decoding problem. Furthermore, we also prove some bounds for the number of matrices of a fixed rank with entries over a finite field. Our proposal allows the choice of the error terms with rank up to 2r, where r is the error-correcting capability of a code. Our encryption based on Gabidulin codes has public key size of 13.68 KB, which is 82 times smaller than the public key size of McEliece Cryptosystem based on Goppa codes. For similar post-quantum security level of 2140 bits, our encryption scheme has a smaller public key size than the key size suggested by LOI17 Encryption. © 2018 by the authors. Licensee MDPI, Basel, Switzerland.
Source Title: Cryptography
ISSN: 2410-387X
DOI: 10.3390/cryptography2040032
Rights: Attribution 4.0 International
Appears in Collections:Elements
Staff Publications

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
10_3390_cryptography2040032.pdf370.61 kBAdobe PDF



Google ScholarTM



This item is licensed under a Creative Commons License Creative Commons