A McEliece cryptosystem using permutation codes

dc.contributor.authorSrinivasan, Adarshen_US
dc.contributor.authorMAHALANOBIS, AYANen_US
dc.contributor.departmentDept. of Mathematicsen_US
dc.date.accessioned2025-12-19T11:41:45Z
dc.date.available2025-12-19T11:41:45Z
dc.date.issued2025-11en_US
dc.description.abstractThis 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.citationJournal of Mathematical Cryptology, 19(1), 20240029.en_US
dc.identifier.issn1862-2984en_US
dc.identifier.issn1862-2976en_US
dc.identifier.sourcetitleJournal of Mathematical Cryptologyen_US
dc.identifier.urihttps://doi.org/10.1515/jmc-2024-0029
dc.identifier.urihttp://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/10588
dc.language.isoenen_US
dc.publication.originofpublisherForeignen_US
dc.publisherDe Gruyteren_US
dc.subjectMcEliece cryptosystemen_US
dc.subjectPermutation error correcting codesen_US
dc.subjectPostquantum cryptosystemsen_US
dc.subject2025-DEC-WEEK2en_US
dc.subjectTOC-DEC-2025en_US
dc.subject2025en_US
dc.titleA McEliece cryptosystem using permutation codesen_US
dc.typeArticleen_US

Files

Collections