McEliece-type CryptosysteMS over Quasi-cyclic Codes

Simple item page
dc.contributor.advisorMAHALANOBIS, AYANen_US
dc.contributor.authorKAPSHIKAR, UPENDRAen_US
dc.contributor.departmentDept. of Mathematicsen_US
dc.contributor.registration20131136en_US
dc.date.accessioned2018-05-18T05:56:49Z
dc.date.available2018-05-18T05:56:49Z
dc.date.issued2018-05en_US
dc.description.abstractMost of the cryptosystems that we use today, are based on hardness of factoring or discrete log in one way or other. As soon as quantum computers become reality, such systems will break down. In this work, we suggest a Niederreiter cryptosystem over quasi-cyclic codes which is secure against current known attacks, both classical and quantum. We give an algorithm for construction of such codes.en_US
dc.identifier.urihttp://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/1036
dc.language.isoenen_US
dc.subject2018en_US
dc.subjectMathematicsen_US
dc.subjectQuantum securityen_US
dc.subjectNiederreiter CryptosysteMSen_US
dc.subjectQuasi-cyclic codesen_US
dc.titleMcEliece-type CryptosysteMS over Quasi-cyclic Codesen_US
dc.typeThesisen_US
dc.type.degreeBS-MSen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Thesis_Upendra.pdf
Size:
475.79 KB
Format:
Adobe Portable Document Format
Description:
Download

Collections

MS THESES