McEliece Cryptosystem

A tétel rövid nézete
dc.contributor.advisorTengely, Szabolcs
dc.contributor.authorAli, Amjad
dc.contributor.departmentDE--Természettudományi és Technológiai Kar--Matematikai Intézet
dc.date.accessioned2023-04-26T06:40:29Z
dc.date.available2023-04-26T06:40:29Z
dc.date.created2023-04-20
dc.description.abstractThe aim of this thesis is to explore the McEliece cryptosystem, a post-quantum cryptosystem based on linear codes. As modern cryptosystems based on number theoretic problems, such as integer factorization and discrete logarithms, are no longer considered secure with the advent of quantum computers, there has been a shift towards the study and development of cryptosystems based on other difficult mathematical problems. The McEliece cryptosystem, based on the NP-hard general decoding problem of linear codes, is one such candidate. In this thesis, we provide a simplified explanation of the McEliece cryptosystem, using SageMath interactive codes to provide a hands-on experience with its basic working principles.
dc.description.correctorLB
dc.description.courseMathematics, BSc.
dc.description.degreeBSc/BA
dc.format.extent54
dc.identifier.urihttps://hdl.handle.net/2437/350841
dc.language.isoen
dc.rights.accessHozzáférhető a 2022 decemberi felsőoktatási törvénymódosítás értelmében.
dc.subjectMcEliece Cryptosystem
dc.subject.cerifLinear Codes Based Cryptography
dc.subject.cerifPost-Quantum Cryptography
dc.subject.dspaceDEENK Témalista::Matematikahu_HU
dc.titleMcEliece Cryptosystem
Fájlok
Gyűjtemények
Theses (Faculty of Science and Technology)