A McEliece cryptosystem using permutation codes
| dc.contributor.author | Srinivasan, Adarsh | en_US |
| dc.contributor.author | MAHALANOBIS, AYAN | en_US |
| dc.contributor.department | Dept. of Mathematics | en_US |
| dc.date.accessioned | 2025-12-19T11:41:45Z | |
| dc.date.available | 2025-12-19T11:41:45Z | |
| dc.date.issued | 2025-11 | en_US |
| dc.description.abstract | This paper is an attempt to build a new public-key cryptosystem, similar to the McEliece cryptosystem, using permutation error-correcting codes. We study a public-key cryptosystem built using two permutation error-correcting codes. We show that these cryptosystems are insecure. However, the general framework in these cryptosystems can use any permutation error-correcting code and is interesting. We present an enhanced McEliece cryptosystem, which subsumes the McEliece cryptosystem based on linear error correcting codes. | en_US |
| dc.identifier.citation | Journal of Mathematical Cryptology, 19(1), 20240029. | en_US |
| dc.identifier.issn | 1862-2984 | en_US |
| dc.identifier.issn | 1862-2976 | en_US |
| dc.identifier.sourcetitle | Journal of Mathematical Cryptology | en_US |
| dc.identifier.uri | https://doi.org/10.1515/jmc-2024-0029 | |
| dc.identifier.uri | http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/10588 | |
| dc.language.iso | en | en_US |
| dc.publication.originofpublisher | Foreign | en_US |
| dc.publisher | De Gruyter | en_US |
| dc.subject | McEliece cryptosystem | en_US |
| dc.subject | Permutation error correcting codes | en_US |
| dc.subject | Postquantum cryptosystems | en_US |
| dc.subject | 2025-DEC-WEEK2 | en_US |
| dc.subject | TOC-DEC-2025 | en_US |
| dc.subject | 2025 | en_US |
| dc.title | A McEliece cryptosystem using permutation codes | en_US |
| dc.type | Article | en_US |