McEliece-type CryptosysteMS over Quasi-cyclic Codes

Please use this identifier to cite or link to this item: http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/1036

Full metadata record

DC Field	Value	Language
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
Appears in Collections:	MS THESES

Files in This Item:

File	Description	Size	Format
Thesis_Upendra.pdf		475.79 kB	Adobe PDF	View/Open