Name
Abstract | ||
|---|---|---|
We propose a new rank metric code based encryption based on the hard problem of rank syndrome decoding problem. We consider a generator matrix for Gabidulin codes in the form of k-partial circulant matrix. We distort the matrix G by adding it with another random k-partial circulant matrix and multiplying the product with a random circulant matrix. We also convert our encryption into an IND-CCA2 secured encryption scheme under assumption of Rank Syndrome Decoding problem. Our encryption has the smallest key size (of 4.306 KB) at 256-bit security level as compared to all the other rank code based encryption schemes with zero decryption failure and hidden structure for the decodable codes. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s10623-019-00659-0 | Designs, Codes and Cryptography |
Keywords | Field | DocType |
Code-based cryptography, McEliece, Public-key encryption, Provable security, 94B05, 94A60 | Discrete mathematics,Generator matrix,Matrix (mathematics),Encryption,Circulant matrix,Decoding methods,McEliece cryptosystem,Key size,Mathematics,Provable security | Journal |
Volume | Issue | ISSN |
87 | 12 | 0925-1022 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Terry Shue Chien Lau | 1 | 1 | 3.73 |
| Chik How Tan | 2 | 499 | 54.60 |