Digital Repository

McEliece-type CryptosysteMS over Quasi-cyclic Codes

Show simple item record

dc.contributor.advisor MAHALANOBIS, AYAN en_US
dc.contributor.author KAPSHIKAR, UPENDRA en_US
dc.date.accessioned 2018-05-18T05:56:49Z
dc.date.available 2018-05-18T05:56:49Z
dc.date.issued 2018-05 en_US
dc.identifier.uri http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/1036
dc.description.abstract Most 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.language.iso en en_US
dc.subject 2018
dc.subject Mathematics en_US
dc.subject Quantum security en_US
dc.subject Niederreiter CryptosysteMS en_US
dc.subject Quasi-cyclic codes en_US
dc.title McEliece-type CryptosysteMS over Quasi-cyclic Codes en_US
dc.type Thesis en_US
dc.type.degree BS-MS en_US
dc.contributor.department Dept. of Mathematics en_US
dc.contributor.registration 20131136 en_US


Files in this item

This item appears in the following Collection(s)

  • MS THESES [1705]
    Thesis submitted to IISER Pune in partial fulfilment of the requirements for the BS-MS Dual Degree Programme/MSc. Programme/MS-Exit Programme

Show simple item record

Search Repository


Advanced Search

Browse

My Account