Therese Bolid: Kryptografins Gränser: En Teoretisk och Praktisk Jämförelse av Moderna Algoritmer
Bachelor Thesis
Time: Wed 2024-06-12 12.30 - 13.30
Location: Cramer room
Respondent: Therese Bolid
Supervisor: Olof Sisask
Abstract.
This study examines and compares the two widely used cryptography algorithms RSA and ECC, focusing on their underlying mathematical theories and practical applications. With an initial theoretical analysis of the underlying mathematical theorems and proofs, and a subsequent practical comparison in Python, we evaluate some of their benefits and downsides regarding effectiveness, security, and efficiency. We find that while RSA remains a widely used and effective method of encryption, ECC can offer superior security and efficiency.