§16§Bachelor Thesis from the year 2014 in the subject Computer Science - IT-Security, grade: 90.00, , course: Computer Security 〓 find an integer, k, such that Q = kP where k = logp(Q) and P, Q (Zp). Compared to the Integer Factorisation Problem - upon which RSA is constructed - the DLP achieves a greater level of complexity in terms of resistance to attack. This project seeks to describe the mathematical properties that enable ECC to outperform RSA, culminating in the construction of a software system to demonstrate ECC's ability to securely encipher and decipher files and text, according to th §16§e National Security Agency's (NSA) Cryptographic Interoperability Strategy (CIS) or Suite B Cryptography.
